# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
299758 | 2020-09-15T15:07:53 Z | dantoh000 | Bigger segments (IZhO19_segments) | C++14 | 2 ms | 512 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]; int j; for (j = i-1; j >= 0; j--){ if (p[i] >= k[j]) break; } /*li cur; while (pq.size() && pq.top().fi <= p[i]){ cur = pq.top(); pq.pop(); }*/ //pq.push(cur); //int j = cur.se; 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}); } for (int i = 1; i <= n; i++){ assert(k[i] >= k[i-1]); } printf("%d",dp[n].fi); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 |
7 | Halted | 0 ms | 0 KB | - |