Submission #401355

#	Time	Username	Problem	Language	Result	Execution time	Memory
401355		arwaeystoamneg	Candies (JOI18_candies)	C++17	100 / 100	118 ms	10292 KiB

candies

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
int n;
const int MAX = 200005;
ll a[MAX];
int l[MAX], r[MAX];
int main()
{
	setIO("test1");
	cin >> n;

	F0R(i, n)cin >> a[i];
	priority_queue<pll>todo;
	F0R(i, n)todo.push({ a[i],i });
	FOR(i, 1, n)l[i] = i - 1;
	F0R(i, n - 1)r[i] = i + 1;
	l[0] = r[n - 1] = -1;
	ll ans = 0;
	FOR(k, 1, (n + 3) / 2)
	{
		int i;
		while (1)
		{
			i = todo.top().s;
			if (a[i] != todo.top().f)
			{
				todo.pop();
			}
			else
			{
				break;
			}
		}
		ans += a[i];
		cout << ans << endl;
		if (l[i] != -1 && r[i] != -1)
		{
			a[i] = a[l[i]] + a[r[i]] - a[i];
			if (a[i] < -linf)a[i] = -linf;
		}
		else
		{
			a[i] = -linf;
		}
		a[l[i]] = a[r[i]] = -linf;
		if (l[i] != -1 && l[l[i]] != -1)r[l[l[i]]] = i;
		if (r[i] != -1 && r[r[i]] != -1)l[r[r[i]]] = i;
		r[i] = r[r[i]];
		l[i] = l[l[i]];
		todo.push({ a[i],i });;
	}
}

• Subtask 1: 8 / 8
• Subtask 2: 92 / 92