Submission #361601
Source Code Expand
#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
using namespace std;
#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()
#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num
#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]
typedef complex<double> P;
typedef vector<P> Poly;
const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };
LL dp[100001];
LL cnt[100001];
int main(void){
int N, C,k;
cin >> N >> C;
reE(i,1, N){
cin >> k;
k--;
cnt[k] += (i - dp[k])*dp[k];
dp[k] = i;
}
rT(i, C){
cnt[i] += (N+1 - dp[i])*dp[i];
cout << cnt[i] << endl;
}
return(0);
}
Submission Info
Submission Time |
|
Task |
D - 高橋くんと数列 |
User |
btk15049 |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
1538 Byte |
Status |
AC |
Exec Time |
322 ms |
Memory |
2348 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
Subtask1 |
subtask1_0.txt, subtask1_1.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
All |
subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask1_0.txt, subtask1_1.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_1.txt |
AC |
22 ms |
924 KB |
subtask0_2.txt |
AC |
22 ms |
920 KB |
subtask0_3.txt |
AC |
22 ms |
812 KB |
subtask1_0.txt |
AC |
52 ms |
808 KB |
subtask1_1.txt |
AC |
51 ms |
804 KB |
subtask1_2.txt |
AC |
50 ms |
800 KB |
subtask1_3.txt |
AC |
50 ms |
920 KB |
subtask1_4.txt |
AC |
48 ms |
732 KB |
subtask1_5.txt |
AC |
49 ms |
804 KB |
subtask1_6.txt |
AC |
22 ms |
792 KB |
subtask2_0.txt |
AC |
85 ms |
932 KB |
subtask2_1.txt |
AC |
87 ms |
1056 KB |
subtask2_2.txt |
AC |
86 ms |
1048 KB |
subtask2_3.txt |
AC |
190 ms |
1696 KB |
subtask2_4.txt |
AC |
197 ms |
1508 KB |
subtask2_5.txt |
AC |
206 ms |
1576 KB |
subtask2_6.txt |
AC |
289 ms |
2344 KB |
subtask2_7.txt |
AC |
298 ms |
2296 KB |
subtask2_8.txt |
AC |
322 ms |
2348 KB |