Submission #1117813
Source Code Expand
#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 100005
void RI(){}
template<typename... T>
void RI( int& head, T&... tail ) {
scanf("%d",&head);
RI(tail...);
}
using namespace std;
typedef long long LL;
int n,in[M];
LL ans[M];
int main()
{
RI(n);
REP(i,1,n) RI(in[i]);
vector<pair<int,int>> ord; //(num, pos)
map<int,int> cnt;
REP(i,1,n)
{
if(!cnt[in[i]])
ord.PB(MP(in[i],i));
cnt[in[i]]++;
}
sort(ord.begin(), ord.end(), greater<pair<int,int>>());
int pos=n+1;
int num=0;
int go;
REP(i,0,(int)ord.size()-1)
{
pos = min(pos, ord[i].S);
num += cnt[ord[i].F];
if(i==(int)ord.size()-1)
go = ord[i].F;
else
go = ord[i].F - ord[i+1].F;
ans[pos] += (LL)num*go;
}
REP(i,1,n) printf("%lld\n", ans[i]);
return 0;
}
Submission Info
Submission Time
2017-02-18 22:01:55+0900
Task
E - Frequency
User
Nekosyndrome
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1086 Byte
Status
AC
Exec Time
63 ms
Memory
7668 KiB
Compile Error
./Main.cpp: In function ‘void RI(int&, T& ...) [with T = {}]’:
./Main.cpp:15:5: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&head);
^
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 KiB
00_example_02.txt
AC
1 ms
256 KiB
01.txt
AC
1 ms
256 KiB
02.txt
AC
4 ms
512 KiB
03.txt
AC
1 ms
256 KiB
04.txt
AC
1 ms
256 KiB
05.txt
AC
1 ms
256 KiB
06.txt
AC
1 ms
256 KiB
07.txt
AC
1 ms
256 KiB
08.txt
AC
1 ms
256 KiB
09.txt
AC
5 ms
640 KiB
10.txt
AC
1 ms
256 KiB
11.txt
AC
56 ms
4216 KiB
12.txt
AC
56 ms
4216 KiB
13.txt
AC
56 ms
4216 KiB
14.txt
AC
56 ms
4216 KiB
15.txt
AC
56 ms
4216 KiB
16.txt
AC
21 ms
768 KiB
17.txt
AC
63 ms
7412 KiB
18.txt
AC
61 ms
6260 KiB
19.txt
AC
17 ms
896 KiB
20.txt
AC
43 ms
3064 KiB
21.txt
AC
1 ms
256 KiB
22.txt
AC
1 ms
256 KiB
23.txt
AC
1 ms
256 KiB
24.txt
AC
4 ms
640 KiB
25.txt
AC
1 ms
256 KiB
26.txt
AC
1 ms
256 KiB
27.txt
AC
1 ms
256 KiB
28.txt
AC
47 ms
7668 KiB
29.txt
AC
49 ms
7668 KiB
30.txt
AC
54 ms
7668 KiB
31.txt
AC
47 ms
7668 KiB
32.txt
AC
47 ms
7540 KiB
33.txt
AC
46 ms
6260 KiB
34.txt
AC
48 ms
6260 KiB
35.txt
AC
52 ms
6260 KiB
36.txt
AC
45 ms
6260 KiB
37.txt
AC
46 ms
6260 KiB