# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299748 | 2020-09-15T14:56:56 Z | dantoh000 | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 384 KB |
#include <bits/stdc++.h> #define fi first #define se second using namespace std; typedef long long ll; typedef pair<int,int> ii; typedef pair<ll, int> li; ii dp[500005]; int n; ll p[500005]; ll k[500005]; priority_queue<li, vector<li>, greater<li> > pq; int main(){ scanf("%d",&n); pq.push({0,0}); for (int i = 1; i <= n; i++){ scanf("%lld",&p[i]); p[i]+=p[i-1]; dp[i] = {0,0}; li cur; while (pq.size() && pq.top().fi <= p[i]){ cur = pq.top(); pq.pop(); } int j = cur.se; if (p[i] >= k[j]){ dp[i] = {dp[j].fi+1, j}; k[i] = 2*p[i]-p[j]; //printf("%lld: ",2*p[i]-p[j]); pq.push({k[i],i}); } } printf("%d",dp[n].fi); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |