# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676556 | 2022-12-31T08:52:00 Z | Do_you_copy | Candies (JOI18_candies) | C++17 | 1 ms | 340 KB |
//Then #include <bits/stdc++.h> #define pb push_back #define fi first #define se second #define faster ios_base::sync_with_stdio(0); cin.tie(0); using namespace std; using ll = long long; using ld = long double; using pii = pair <int, int>; mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count()); const int maxN = 5e5 + 1; //const int Mod = 1e9 + 7; //const int inf = int n; ll a[maxN]; bool invalid[maxN]; int nxt[maxN]; int pre[maxN]; struct TPQ{ int i; bool operator < (const TPQ &other) const{ return a[i] < a[other.i]; } }; priority_queue <TPQ> PQ; void Init(){ cin >> n; for (int i = 1; i <= n; ++i){ cin >> a[i]; pre[i] = i - 1; nxt[i] = i + 1; PQ.push({i}); } nxt[n] = 0; ll ans = 0; int k = (n + 1) / 2; for (int _ = 1; _ <= k; ++_){ while (!PQ.empty() && invalid[PQ.top().i]){ PQ.pop(); } if (PQ.empty()) break; int i = PQ.top().i; invalid[i] = 1; invalid[nxt[i]] = 1; invalid[pre[i]] = 1; ans += a[i]; cout << ans << "\n"; a[++n] = a[nxt[i]] + a[pre[i]] - a[i]; if (pre[i] && nxt[i]){ PQ.push({n}); } nxt[n] = nxt[nxt[i]]; pre[nxt[nxt[i]]] = n; pre[n] = pre[pre[i]]; nxt[pre[pre[i]]] = n; } } #define debug #define taskname "test" signed main(){ faster if (fopen(taskname".inp", "r")){ freopen(taskname".inp", "r", stdin); freopen(taskname".out", "w", stdout); } int tt = 1; //cin >> tt; while (tt--){ Init(); } if (fopen("timeout.txt", "r")){ ofstream timeout("timeout.txt"); timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000); timeout.close(); #ifndef debug cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n"; #endif // debug } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |