Submission #1368457


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;

struct BIT{
	ll t[MX];
	ll read(int x){
		ll r = 0;
		while(x){ r += t[x]; x -= x&-x; }
		return r;
	}
	void update(int x, int v){
		while(x < MX){ t[x] += v; x += x&-x; }
	}
} tree;

int D[MX], E[MX];
ll ans[MX];
int main()
{
	int N;
	scanf("%d", &N);
	for(int i = 1; i <= N; i++) scanf("%d", D+i), E[i] = i;
	sort(E+1, E+N+1, [&](int l, int r){ return D[l] == D[r] ? l > r : D[l] > D[r]; });
	for(int i = 1; i <= N; i++){
		int c = E[i], d = E[i+1];
		tree.update(c, D[c]);
		if( tree.read(c-1) == 0 ){
			ans[c] = (D[c] - D[d]) * (ll)i;
		}
	}
	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 0
Code Size 1142 Byte
Status WA
Exec Time 34 ms
Memory 10112 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:46:56: 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), E[i] = i;
                                                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 7
WA × 32
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 3 ms 8448 KB
00_example_02.txt AC 3 ms 8448 KB
01.txt WA 3 ms 8448 KB
02.txt WA 4 ms 8448 KB
03.txt WA 3 ms 8448 KB
04.txt WA 3 ms 8448 KB
05.txt WA 3 ms 8448 KB
06.txt WA 3 ms 8448 KB
07.txt WA 3 ms 8448 KB
08.txt WA 3 ms 8448 KB
09.txt WA 5 ms 8448 KB
10.txt WA 3 ms 8448 KB
11.txt WA 34 ms 8704 KB
12.txt WA 34 ms 8704 KB
13.txt WA 34 ms 8704 KB
14.txt WA 34 ms 8576 KB
15.txt WA 34 ms 8704 KB
16.txt AC 27 ms 9344 KB
17.txt AC 27 ms 9728 KB
18.txt WA 26 ms 8576 KB
19.txt AC 23 ms 9472 KB
20.txt WA 33 ms 8704 KB
21.txt AC 3 ms 8448 KB
22.txt AC 3 ms 8448 KB
23.txt WA 3 ms 8448 KB
24.txt WA 4 ms 8576 KB
25.txt WA 3 ms 8448 KB
26.txt WA 3 ms 8448 KB
27.txt WA 3 ms 8448 KB
28.txt WA 28 ms 9984 KB
29.txt WA 28 ms 9984 KB
30.txt WA 28 ms 10112 KB
31.txt WA 28 ms 9984 KB
32.txt WA 28 ms 9984 KB
33.txt WA 26 ms 8576 KB
34.txt WA 26 ms 8576 KB
35.txt WA 26 ms 8576 KB
36.txt WA 26 ms 8576 KB
37.txt WA 26 ms 8576 KB