Submission #1477934


Source Code Expand

#include <bits/stdc++.h>
 
#define forn(i, n) for (llong i = 0ll; i < (llong) n; ++i)
#define fornn(i, l, r) for (llong i = (llong) l; i < (llong) r; ++i)
#define size(x) ((int) (x.size()))
 
using namespace std;
 
typedef long long llong;
const llong inf = (llong) 1e+9 + 7ll;
const llong linf = (llong) 1e+18 + 7ll;
const long double eps = (long double) 1e-9;
const long double pi = acosl((long double) -1.0);
const int alph = 26;

mt19937 mrand(random_device{} ()); 

template<typename T, typename U> inline llong umin(const T& a, const U& b) { return a < b ? a : b; }
template<typename T, typename U> inline llong umax(const T& a, const U& b) { return a > b ? a : b; }
 
static char buff[(int) 2e6 + 17]; // reads std::string
const int maxn = (int) 2e5 + 17;

int n;
int a[maxn], ans[maxn];
set<int> s[maxn];

bool read()
{
	if (scanf("%d", &n) != 1)
		return false;

	forn (i, n)
		scanf("%d", a + i);

	return true;
}

void solve()
{
	vector<int> v(a, a + n + 1);
	sort(v.begin(), v.end());
	v.resize(unique(v.begin(), v.end()) - v.begin());

	forn (i, n)
	{
		a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
		s[a[i]].insert(i);
	}

	for (int i = size(v) - 1; i > 0; --i)
	{
		ans[*s[i].begin()] += 1ll * (v[i] - v[i - 1]) * size(s[i]);

		if (size(s[i - 1]) < size(s[i]))
			s[i].swap(s[i - 1]);

		for (auto j : s[i])
			s[i - 1].insert(j);
	}

	forn (i, n)
		printf("%d\n", ans[i]);
}

int main()
{
#if SEREZHKA
	freopen("file.in", "r", stdin);
#endif

	while (read())
		solve();

	return 0;
}

Submission Info

Submission Time
Task E - Frequency
User serezhae
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1590 Byte
Status WA
Exec Time 85 ms
Memory 21376 KB

Compile Error

./Main.cpp: In function ‘bool read()’:
./Main.cpp:34:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + i);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 10
WA × 29
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 5 ms 10496 KB
00_example_02.txt AC 5 ms 10496 KB
01.txt WA 4 ms 10496 KB
02.txt WA 8 ms 11136 KB
03.txt WA 5 ms 10496 KB
04.txt WA 5 ms 10496 KB
05.txt WA 5 ms 10496 KB
06.txt WA 5 ms 10496 KB
07.txt AC 5 ms 10496 KB
08.txt WA 5 ms 10496 KB
09.txt WA 10 ms 11392 KB
10.txt WA 4 ms 10496 KB
11.txt WA 84 ms 20736 KB
12.txt WA 85 ms 20736 KB
13.txt WA 84 ms 20736 KB
14.txt WA 85 ms 20736 KB
15.txt WA 84 ms 20736 KB
16.txt WA 49 ms 16128 KB
17.txt WA 66 ms 21120 KB
18.txt WA 60 ms 20736 KB
19.txt AC 44 ms 16128 KB
20.txt WA 81 ms 20736 KB
21.txt AC 5 ms 10496 KB
22.txt AC 5 ms 10496 KB
23.txt AC 5 ms 10496 KB
24.txt WA 8 ms 11136 KB
25.txt AC 4 ms 10496 KB
26.txt AC 5 ms 10496 KB
27.txt AC 5 ms 10496 KB
28.txt WA 57 ms 21376 KB
29.txt WA 59 ms 21376 KB
30.txt WA 61 ms 21376 KB
31.txt WA 57 ms 21376 KB
32.txt WA 57 ms 21376 KB
33.txt WA 50 ms 20736 KB
34.txt WA 51 ms 20736 KB
35.txt WA 53 ms 20736 KB
36.txt WA 50 ms 20736 KB
37.txt WA 49 ms 20736 KB