Submission #1779038
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define DEBUG(x) cout << #x << ": " << x << endl; #define DEBUG_VEC(v) \ cout << #v << ":"; \ for (int i = 0; i < v.size(); i++) cout << " " << v[i]; \ cout << endl typedef long long ll; #define vi vector<int> #define vl vector<ll> #define vii vector<vector<int> > #define vll vector<vector<ll> > #define vs vector<string> #define pii pair<int, int> #define pis pair<int, string> #define psi pair<string, int> #define pll pair<ll, ll> const int inf = 1000000001; const ll INF = 1e18 * 4; #define MOD 1000000007 #define mod 1000000009 #define pi 3.14159265358979323846 #define Sp(p) cout << setprecision(15) << fixed << p << endl; int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1}; int main(){ int n, i, j; cin >> n; vl a(n); //vector<pii> b(n); vl b(n); for (i = 0; i < n; i++) { cin >> a[i]; //b[i].first = a[i]; //b[i].second = i; b[i] = a[i]; } sort(b.begin(), b.end()); int pre = 0; int now = 0; for (i = 0; i < n; i++) { if (pre >= a[i]) { cout << 0 << endl; continue; } ll cnt = 0; while (b[now] < a[i]) { cnt += (b[now] - pre); now++; } cnt += (a[i] - pre) * (n - now); cout << cnt << endl; pre = a[i]; } } /* 2 1 2 10 1 2 1 3 2 4 2 5 8 1 */
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | fuppy0716 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1527 Byte |
Status | AC |
Exec Time | 203 ms |
Memory | 2688 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 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 | AC | 1 ms | 256 KB |
02.txt | AC | 13 ms | 384 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 2 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 18 ms | 384 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 188 ms | 2048 KB |
12.txt | AC | 188 ms | 2048 KB |
13.txt | AC | 187 ms | 2048 KB |
14.txt | AC | 188 ms | 2048 KB |
15.txt | AC | 183 ms | 2048 KB |
16.txt | AC | 196 ms | 2048 KB |
17.txt | AC | 193 ms | 2432 KB |
18.txt | AC | 195 ms | 2048 KB |
19.txt | AC | 170 ms | 2048 KB |
20.txt | AC | 183 ms | 2048 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 1 ms | 256 KB |
24.txt | AC | 13 ms | 384 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 2 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 189 ms | 2560 KB |
29.txt | AC | 190 ms | 2560 KB |
30.txt | AC | 188 ms | 2688 KB |
31.txt | AC | 193 ms | 2560 KB |
32.txt | AC | 191 ms | 2560 KB |
33.txt | AC | 195 ms | 2048 KB |
34.txt | AC | 203 ms | 2048 KB |
35.txt | AC | 188 ms | 2048 KB |
36.txt | AC | 191 ms | 2048 KB |
37.txt | AC | 191 ms | 2048 KB |