Submission #61405

#TimeUsernameProblemLanguageResultExecution timeMemory
61405BenqCandies (JOI18_candies)C++11
100 / 100
868 ms20356 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef long double ld; typedef complex<ld> cd; typedef pair<int, int> pi; typedef pair<ll,ll> pl; typedef pair<ld,ld> pd; typedef vector<int> vi; typedef vector<ld> vd; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<cd> vcd; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; #define FOR(i, a, b) for (int i=a; i<(b); i++) #define F0R(i, a) for (int i=0; i<(a); i++) #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--) #define sz(x) (int)(x).size() #define mp make_pair #define pb push_back #define f first #define s second #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() const int MOD = 1000000007; const ll INF = 1e18; const int MX = 200005; template<int SZ> struct DSU { int par[SZ], sz[SZ], L[SZ], R[SZ]; ll val[SZ]; DSU() { F0R(i,SZ) par[i] = L[i] = R[i] = i, sz[i] = 1; } int get(int x) { // path compression if (par[x] != x) par[x] = get(par[x]); return par[x]; } void unite(int x, int y) { // union-by-rank x = get(x), y = get(y); if (sz[x] < sz[y]) swap(x,y); sz[x] += sz[y], par[y] = x; L[x] = min(L[x],L[y]); R[x] = max(R[x],R[y]); } }; DSU<MX> D; int N, A[MX]; ll cans; set<pl> cur; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> N; FOR(i,1,N+1) { cin >> A[i]; cur.insert({A[i],i}); D.val[i] = A[i]; } FOR(i,1,(N+1)/2+1) { pl tmp = *cur.rbegin(); cur.erase(tmp); tmp.s = D.get(tmp.s); cans += tmp.f; cout << cans << "\n"; int l = D.get(D.L[tmp.s]-1), r = D.get(D.R[tmp.s]+1); ll nval = D.val[l]+D.val[r]-D.val[tmp.s]; if (D.L[l] != 0) cur.erase({D.val[l],l}); if (D.R[r] != N+1) cur.erase({D.val[r],r}); D.unite(l,tmp.s), D.unite(tmp.s,r); tmp.s = D.get(tmp.s); if (D.L[tmp.s] != 0 && D.R[tmp.s] != N+1) cur.insert({D.val[tmp.s] = nval,tmp.s}); } } /* Look for: * the exact constraints (multiple sets are too slow for n=10^6 :( ) * special cases (n=1?) * overflow (ll vs int?) * array bounds */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...