Submission #2229470
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; typedef pair<long long,int> pli; int main(){ int n; cin>>n; long long a[n]; pli p[n]; for(int i=0;i<n;i++){ scanf("%ld",&a[i]); p[i]=pli(a[i],i); } sort(p,p+n); reverse(p,p+n); long long ans[n]; int mi=n; for(int i=0;i<n;i++) ans[i]=0; for(int i=0;i<n-1;i++){ mi=min(mi,p[i].second); ans[mi]+=(i+1)*(p[i].first-p[i+1].first); } ans[0]+=n*p[n-1].first; for(int i=0;i<n;i++) printf("%ld\n",ans[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | tempura0224 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 557 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 4224 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:11:22: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 2 has type ‘long long int*’ [-Wformat=] scanf("%ld",&a[i]); ^ ./Main.cpp:26:26: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 2 has type ‘long long int’ [-Wformat=] printf("%ld\n",ans[i]); ^ ./Main.cpp:11:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%ld",&a[i]); ^
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 | 512 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 | 512 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 27 ms | 3584 KB |
12.txt | AC | 27 ms | 3584 KB |
13.txt | AC | 27 ms | 3584 KB |
14.txt | AC | 27 ms | 3584 KB |
15.txt | AC | 27 ms | 3584 KB |
16.txt | AC | 24 ms | 3584 KB |
17.txt | AC | 24 ms | 3968 KB |
18.txt | AC | 23 ms | 3584 KB |
19.txt | AC | 20 ms | 3584 KB |
20.txt | AC | 27 ms | 3584 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 | 512 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 | 24 ms | 4096 KB |
29.txt | AC | 24 ms | 4224 KB |
30.txt | AC | 24 ms | 4224 KB |
31.txt | AC | 24 ms | 4096 KB |
32.txt | AC | 24 ms | 4096 KB |
33.txt | AC | 22 ms | 3584 KB |
34.txt | AC | 22 ms | 3584 KB |
35.txt | AC | 22 ms | 3584 KB |
36.txt | AC | 22 ms | 3584 KB |
37.txt | AC | 22 ms | 3584 KB |