# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76538 | georgerapeanu | Popeala (CEOI16_popeala) | C++11 | 1743 ms | 16756 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
#include <deque>
using namespace std;
const int TMAX = 2e4;
const int NMAX = 50;
const int SMAX = 50;
const int INF = (1 << 29);
FILE *f = stdin;
FILE *g = stdout;
int t,n,s;
int points[TMAX + 5];
int preffix_sum[TMAX + 5];
char results[NMAX + 5][TMAX + 5];
int valid_from[NMAX + 5][TMAX + 5];
int dp[SMAX + 5][TMAX + 5];
int ant[NMAX + 5];
int nxt[NMAX + 5];
int st[NMAX + 5];
int dr[NMAX + 5];
deque< pair<int,int> > segment[NMAX + 5];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |