Submission #1797178
Source Code Expand
#include<iostream> #include<cstdio> #include<vector> #include<string> #include<functional> #include<queue> #include <iomanip> #include<map> #include<limits> #include<cmath> #include<algorithm> #include<bitset> #include<utility> #include<complex> #include<cstdlib> #include<set> #include<cctype> #define DBG cerr << '!' << endl; #define REP(i,n) for(int (i) = (0);(i) < (n);++i) #define rep(i,s,g) for(int (i) = (s);(i) < (g);++i) #define rrep(i,s,g) for(int (i) = (s);i >= (g);--(i)) #define PB push_back #define MP make_pair #define FI first #define SE second #define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cerr << v[i] << ' ';cerr << endl << endl;} #define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;} #define ALL(v) v.begin(),v.end() using namespace std; typedef long long ll; typedef vector<int> iv; typedef vector<iv> iiv; typedef vector<string> sv; ll ans[100010]; int num[100010]; ll sum; #define INF 1000100 int main() { ll n;cin >> n; vector<int> v; int a1;cin >> a1;sum += a1; v.PB(a1); map<int,int> mp; mp[a1] = 1; REP(i,n-1) { int a;cin >> a;sum += a; decltype(v)::iterator tmp; tmp = lower_bound(ALL(v),a+1); if(tmp == v.end()) { v.PB(a); mp[a] = i+2; num[i+2]++; } else if(tmp != v.begin()) { ans[mp[*tmp]] += a - *(tmp-1); num[mp[*(tmp-1)]]++; } } /* SHOW1d(num,n+1); SHOW1d(ans,n+1); */ ll sa = 0; int cou = 0; for(int i = v.size()-1;i > 0;i--) { cou += num[mp[v[i]]]; int tmp = cou * (v[i] - v[i-1]); ans[mp[v[i]]] += tmp; sa += tmp; } ans[1] = sum - sa; for(int i = 1;i <= n;i++) { cout << ans[i] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | seica |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1807 Byte |
Status | WA |
Exec Time | 247 ms |
Memory | 7288 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | WA | 1 ms | 256 KB |
02.txt | WA | 13 ms | 256 KB |
03.txt | WA | 2 ms | 256 KB |
04.txt | WA | 2 ms | 256 KB |
05.txt | WA | 1 ms | 256 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | WA | 2 ms | 256 KB |
09.txt | WA | 17 ms | 256 KB |
10.txt | WA | 2 ms | 256 KB |
11.txt | WA | 185 ms | 512 KB |
12.txt | WA | 183 ms | 512 KB |
13.txt | WA | 186 ms | 512 KB |
14.txt | WA | 188 ms | 512 KB |
15.txt | WA | 181 ms | 512 KB |
16.txt | AC | 200 ms | 1400 KB |
17.txt | AC | 247 ms | 7032 KB |
18.txt | AC | 195 ms | 384 KB |
19.txt | AC | 176 ms | 1400 KB |
20.txt | WA | 180 ms | 512 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | WA | 1 ms | 256 KB |
24.txt | WA | 14 ms | 512 KB |
25.txt | WA | 2 ms | 256 KB |
26.txt | WA | 3 ms | 256 KB |
27.txt | WA | 2 ms | 256 KB |
28.txt | WA | 230 ms | 6520 KB |
29.txt | WA | 237 ms | 6776 KB |
30.txt | WA | 233 ms | 7288 KB |
31.txt | WA | 228 ms | 6520 KB |
32.txt | WA | 225 ms | 6520 KB |
33.txt | AC | 190 ms | 384 KB |
34.txt | AC | 189 ms | 384 KB |
35.txt | AC | 189 ms | 384 KB |
36.txt | AC | 185 ms | 384 KB |
37.txt | AC | 189 ms | 384 KB |