oj.uz

Submission #924690

# Submission time Handle Problem Language Result Execution time Memory
924690 2024-02-09T13:14:28 Z pan Candies (JOI18_candies) C++17
100 / 100
 438 ms 29276 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#include <stdio.h>
#include <algorithm>
#include <memory.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll const INF = 1e13;
int main()
{
	ll n, a;
	input(n);
	multiset<pi> s1, s2;
	s1.insert(mp(-INF, 0)); s1.insert(mp(-INF, n+1)); 
	s2.insert(mp(0, -INF)); s2.insert(mp(n+1, -INF)); 
	for (ll i=1; i<=n; ++i)
	{
		input(a);
		s1.insert(mp(a, i));
		s2.insert(mp(i, a));
	}
	ll ans = 0;
	for (ll i=0; i<(n+1)/2; ++i)
	{
		ans+=s1.rbegin()->f;
		print(ans, '\n');
		ll ind = s1.rbegin()->s;
		auto it = s2.lb(mp(ind, -INF));
		it--;
		ll neww = 0;
		s1.erase(s1.lb(mp(it->s, it->f)));
		neww += it->s;
		it = s2.erase(it);
		s1.erase(s1.lb(mp(it->s, it->f)));
		neww-=it->s;
		it = s2.erase(it);
		s1.erase(s1.lb(mp(it->s, it->f)));
		neww+=it->s;
		s2.erase(it);
		s1.insert(mp(neww, ind));
		s2.insert(mp(ind, neww));
	}
	return 0;
}

Compilation message

candies.cpp: In function 'int main()':
candies.cpp:14:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
candies.cpp:34:2: note: in expansion of macro 'input'
   34 |  input(n);
      |  ^~~~~
candies.cpp:14:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
candies.cpp:40:3: note: in expansion of macro 'input'
   40 |   input(a);
      |   ^~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 656 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 704 KB Output is correct

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 656 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 704 KB Output is correct
21 Correct 420 ms 28988 KB Output is correct
22 Correct 422 ms 28864 KB Output is correct
23 Correct 394 ms 29008 KB Output is correct
24 Correct 207 ms 28684 KB Output is correct
25 Correct 189 ms 28604 KB Output is correct
26 Correct 206 ms 28612 KB Output is correct
27 Correct 198 ms 28924 KB Output is correct
28 Correct 193 ms 28860 KB Output is correct
29 Correct 195 ms 28756 KB Output is correct
30 Correct 212 ms 28980 KB Output is correct
31 Correct 207 ms 28752 KB Output is correct
32 Correct 215 ms 28692 KB Output is correct
33 Correct 292 ms 28496 KB Output is correct
34 Correct 277 ms 28500 KB Output is correct
35 Correct 281 ms 28580 KB Output is correct
36 Correct 438 ms 28836 KB Output is correct
37 Correct 371 ms 28748 KB Output is correct
38 Correct 379 ms 29276 KB Output is correct
39 Correct 223 ms 28652 KB Output is correct
40 Correct 190 ms 28496 KB Output is correct
41 Correct 200 ms 28496 KB Output is correct
42 Correct 191 ms 28668 KB Output is correct
43 Correct 197 ms 28848 KB Output is correct
44 Correct 198 ms 29012 KB Output is correct
45 Correct 228 ms 28676 KB Output is correct
46 Correct 203 ms 28888 KB Output is correct
47 Correct 203 ms 28752 KB Output is correct
48 Correct 271 ms 28496 KB Output is correct
49 Correct 313 ms 28632 KB Output is correct
50 Correct 317 ms 28556 KB Output is correct