Submission #1368479


Source Code Expand

#include<stdio.h>
#include<assert.h>
#include<vector>
#include<string.h>
#include<algorithm>
#include<memory.h>
#include<cmath>
#include<string>
#include<iostream>
#include<set>
#include<unordered_set>
#include<map>
#include<queue>
#include<functional>
#include<list>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double, double> pdd;
typedef tuple<int,int,int> t3;

const int MX = 500005;
const int MM = 1000000007;

int D[MX];
ll ans[MX];
int N;

int main()
{
	scanf("%d", &N);
	for(int i = 1; i <= N; i++) scanf("%d", D+i);
	int cur = 0;
	for(int i = 1; i <= N; i++){
		if( cur < D[i] ) ans[i] = cur+1, cur = D[i];
	}
	map<int, int> L;
	for(int i = N; i >= 1; i--){
		L[D[i]] += 1;
		if( ans[i] == 0 ) continue;
		int to = ans[i]-1;
		ll tot = 0, cur = 0;
		while(L.size() && L.rbegin()->first >= to){
			tot += (ll)(L.rbegin()->first - to) * L.rbegin()->second;
			cur += L.rbegin()->second;
			L.erase(--L.end());
		}
		L[to] = cur;
		ans[i] = tot;
	}
	for(int i = 1; i <= N; i++) printf("%lld\n", ans[i]);
}

Submission Info

Submission Time
Task E - Frequency
User zigui
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1133 Byte
Status AC
Exec Time 44 ms
Memory 7424 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:35:46: 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", D+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 2 ms 2304 KB
00_example_02.txt AC 2 ms 2304 KB
01.txt AC 2 ms 2304 KB
02.txt AC 4 ms 2560 KB
03.txt AC 2 ms 2304 KB
04.txt AC 2 ms 2304 KB
05.txt AC 2 ms 2304 KB
06.txt AC 2 ms 2304 KB
07.txt AC 2 ms 2304 KB
08.txt AC 2 ms 2304 KB
09.txt AC 5 ms 2688 KB
10.txt AC 2 ms 2304 KB
11.txt AC 41 ms 5632 KB
12.txt AC 41 ms 5632 KB
13.txt AC 41 ms 5632 KB
14.txt AC 41 ms 5632 KB
15.txt AC 42 ms 5632 KB
16.txt AC 22 ms 2688 KB
17.txt AC 28 ms 3840 KB
18.txt AC 44 ms 7424 KB
19.txt AC 17 ms 2688 KB
20.txt AC 34 ms 4480 KB
21.txt AC 2 ms 2304 KB
22.txt AC 2 ms 2304 KB
23.txt AC 2 ms 2304 KB
24.txt AC 3 ms 2560 KB
25.txt AC 2 ms 2304 KB
26.txt AC 2 ms 2304 KB
27.txt AC 2 ms 2304 KB
28.txt AC 29 ms 4096 KB
29.txt AC 29 ms 4096 KB
30.txt AC 29 ms 4224 KB
31.txt AC 29 ms 4096 KB
32.txt AC 29 ms 4096 KB
33.txt AC 35 ms 7424 KB
34.txt AC 35 ms 7424 KB
35.txt AC 38 ms 7424 KB
36.txt AC 34 ms 7424 KB
37.txt AC 34 ms 7424 KB