Submission #1540138
Source Code Expand
#include<algorithm> #include<bitset> #include<memory.h> #include<cstdio> #include<cmath> #include<cstring> #define maxn 400010 #define ll long long #define pa pair<ll,ll> #define ld long double #define For(i,x,y) for(ll i=x;i<=y;++i) #define FOr(i,x,y) for(ll i=x;i>=y;--i) using namespace std; inline ll read(){ ll x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f; } inline void write(ll x){ if (x<0) putchar('-'),x=-x; if (x>=10) write(x/10); putchar(x%10+'0'); } inline void writeln(ll x){ write(x); puts(""); } char s[maxn]; ll n,a[maxn],ans; int main(){ scanf("%s",s+1); n=strlen(s+1); For(i,1,n) ans+=i-a[s[i]],a[s[i]]++; writeln(ans-n+1); }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | SHENZHEBEI |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 799 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",s+1); n=strlen(s+1); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 0 ms | 128 KB |
sample_02.txt | AC | 0 ms | 128 KB |
sample_03.txt | AC | 0 ms | 128 KB |
subtask_1_01.txt | AC | 0 ms | 128 KB |
subtask_1_02.txt | AC | 1 ms | 384 KB |
subtask_1_03.txt | AC | 1 ms | 128 KB |
subtask_1_04.txt | AC | 0 ms | 128 KB |
subtask_1_05.txt | AC | 0 ms | 128 KB |
subtask_1_06.txt | AC | 0 ms | 128 KB |
subtask_1_07.txt | AC | 1 ms | 128 KB |
subtask_1_08.txt | AC | 1 ms | 384 KB |
subtask_1_09.txt | AC | 1 ms | 384 KB |
subtask_1_10.txt | AC | 1 ms | 384 KB |
subtask_1_11.txt | AC | 1 ms | 384 KB |
subtask_1_12.txt | AC | 1 ms | 384 KB |
subtask_1_13.txt | AC | 1 ms | 384 KB |
subtask_1_14.txt | AC | 1 ms | 384 KB |
subtask_1_15.txt | AC | 1 ms | 384 KB |
subtask_1_16.txt | AC | 1 ms | 384 KB |
subtask_1_17.txt | AC | 1 ms | 384 KB |