# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
63104 | bazsi700 | Popeala (CEOI16_popeala) | C++14 | 1119 ms | 228184 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 MOD 1000000007
#define ll long long int
#define vi vector<int>
#define vii vector< vector<int> >
#define PI 3.1415926535897932384626433832795
#define INF 9223372036854775807LL
bool solved[51][20001];
int dp[20001][51];
int minval[20002][52][52];
int prefsum[20002];
int conssolved[51][20001]; //[x][y]=z means, the xth solved y-z+1,y-z+2,...,y tasks but not the y-z th
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,t,s;
cin >> n >> t >> s;
vi p(t+1);
for(int i = 1; i <= t; i++) {
cin >> p[i];
prefsum[i] = prefsum[i-1]+p[i];
}
vector<vector<int> > solves (t+1,vi(n));
for(int i = 1; i <= n; i++) {
int lastnotsolv = 0;
for(int j = 1; j <= t; j++) {
# | 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... |