Submission #1775181
Source Code Expand
#include<bits/stdc++.h> #define ll long long using namespace std; struct pii { int S, F; } a[100005]; int n, nw; ll ans[100005]; bool cmp(pii x, pii y) { return x.F > y.F || (x.F == y.F && x.S < y.S); } int main() { scanf("%d", &n); for (int i = 1; i <= n; i ++) scanf("%d", &a[i].F); for (int i = 1; i <= n; i ++) a[i].S = i; sort(a + 1, a + n + 1, cmp); a[n + 1].S = n + 1; int nw = a[1].S; for (int i = 1; i <= n; i ++, nw = min(nw, a[i].S)) ans[nw] += 1ll * (a[i].F - a[i + 1].F) * i; for (int i = 1; i <= n; i ++) printf("%lld\n", ans[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | xc01 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 591 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 2688 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:14:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 1; i <= n; i ++) scanf("%d", &a[i].F); ^
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 | 3 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 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 | 4 ms | 384 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 29 ms | 1280 KB |
12.txt | AC | 29 ms | 1280 KB |
13.txt | AC | 29 ms | 1280 KB |
14.txt | AC | 29 ms | 1280 KB |
15.txt | AC | 29 ms | 1280 KB |
16.txt | AC | 27 ms | 1280 KB |
17.txt | AC | 26 ms | 2432 KB |
18.txt | AC | 26 ms | 1280 KB |
19.txt | AC | 22 ms | 1280 KB |
20.txt | AC | 31 ms | 1408 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 | 3 ms | 384 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 26 ms | 2560 KB |
29.txt | AC | 26 ms | 2560 KB |
30.txt | AC | 26 ms | 2688 KB |
31.txt | AC | 27 ms | 2560 KB |
32.txt | AC | 26 ms | 2560 KB |
33.txt | AC | 26 ms | 1280 KB |
34.txt | AC | 26 ms | 1280 KB |
35.txt | AC | 25 ms | 1280 KB |
36.txt | AC | 26 ms | 1280 KB |
37.txt | AC | 26 ms | 1280 KB |