Submission #1368505
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++) #define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++) #define SZ(v) ((int)(v).size()) #define ALL(v) (v).begin(),(v).end() #define one first #define two second typedef long long ll; typedef pair<int, int> pi; const int INF = 0x3f2f1f0f; const ll LINF = 1ll * INF * INF; const int MAX_N = 1e5 + 100; int N; pi List[MAX_N]; ll Ans[MAX_N]; int main() { cin >> N; REP(i, N) { int x; scanf("%d", &x); List[i] = pi(-x, i); } sort(List, List+N); REP(i, N) List[i].one *= -1; int ix = N+1, cnt = 0, h = INF; REP(i, N) { Ans[ix] += 1ll * cnt * (h - List[i].one); ix = min(ix, List[i].two); cnt++; h = List[i].one; } Ans[ix] += 1ll * cnt * h; REP(i, N) printf("%lld\n", Ans[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | kajebiii |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 841 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 2688 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:23:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int x; scanf("%d", &x); ^
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 | 3 ms | 384 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 26 ms | 1280 KB |
12.txt | AC | 27 ms | 1280 KB |
13.txt | AC | 27 ms | 1280 KB |
14.txt | AC | 27 ms | 1280 KB |
15.txt | AC | 27 ms | 1280 KB |
16.txt | AC | 23 ms | 1280 KB |
17.txt | AC | 23 ms | 2432 KB |
18.txt | AC | 22 ms | 1280 KB |
19.txt | AC | 19 ms | 1280 KB |
20.txt | AC | 26 ms | 1280 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 | 23 ms | 2560 KB |
29.txt | AC | 24 ms | 2560 KB |
30.txt | AC | 23 ms | 2688 KB |
31.txt | AC | 23 ms | 2560 KB |
32.txt | AC | 23 ms | 2560 KB |
33.txt | AC | 22 ms | 1280 KB |
34.txt | AC | 22 ms | 1280 KB |
35.txt | AC | 22 ms | 1280 KB |
36.txt | AC | 22 ms | 1280 KB |
37.txt | AC | 22 ms | 1280 KB |