# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91012 | Flying_dragon_02 | Popeala (CEOI16_popeala) | C++14 | 1342 ms | 28348 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 <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
const int N = 20005;
const int M = 55;
int n, t, s, last[M][N], used[N];
long long sum[N], dp[M][N], p[N], mn[M][N];
const long long inf = 1e14;
vector<int> pos;
char c[M][N];
void update(int x) {
for(int i = 0; i <= n; i++) {
for(int j = 1; j <= t; j++) {
mn[i][j] = dp[x][j] - i * sum[j];
if(j >= 2)
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... |