Submission #1368469


Source Code Expand

#include <bits/stdc++.h>

#define lld long long
#define pp pair<int,int>
#define pb push_back
#define MOD 10007
#define left lleft
#define right rright
#define INF 2000000000
#define LINF 1000000000000000000LL
#define next nnext

using namespace std;

int N;
lld a[100002],ans[100002];
priority_queue<pp> q;

int main(){
	scanf("%d",&N);
	for(int i=1; i<=N; i++){
		scanf("%lld",&a[i]);
		if(a[i] != 0) q.push({a[i],i});
	}
	lld big = q.top().first,it = q.top().second,cnt = 1;
	q.pop();
	while(big != 0){
		while(!q.empty()){
			if(q.top().first != big) break;
			it = min(it,(lld)q.top().second);
			cnt++;
			q.pop();
		}
		lld next;
		if(q.empty()) next = 0;
		else next = q.top().first;
		ans[it] += cnt*(big-next);
		big = next;
	}
	for(int i=1; i<=N; i++) printf("%lld\n",ans[i]);

	return 0;
}

Submission Info

Submission Time
Task E - Frequency
User suhgyuho
Language C++14 (GCC 5.4.1)
Score 700
Code Size 845 Byte
Status AC
Exec Time 34 ms
Memory 3572 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
                ^
./Main.cpp:22:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 39
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 384 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 512 KB
10.txt AC 1 ms 256 KB
11.txt AC 32 ms 2164 KB
12.txt AC 32 ms 2164 KB
13.txt AC 32 ms 2164 KB
14.txt AC 32 ms 2164 KB
15.txt AC 33 ms 2164 KB
16.txt AC 34 ms 2164 KB
17.txt AC 31 ms 3316 KB
18.txt AC 29 ms 2164 KB
19.txt AC 29 ms 2164 KB
20.txt AC 32 ms 2164 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 32 ms 3444 KB
29.txt AC 32 ms 3444 KB
30.txt AC 32 ms 3572 KB
31.txt AC 32 ms 3444 KB
32.txt AC 32 ms 3444 KB
33.txt AC 29 ms 2164 KB
34.txt AC 29 ms 2164 KB
35.txt AC 29 ms 2164 KB
36.txt AC 29 ms 2164 KB
37.txt AC 29 ms 2164 KB