# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406124 | tqbfjotld | The short shank; Redemption (BOI21_prison) | C++14 | 752 ms | 12868 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;
int range_len[2000005];
pair<int,int> memo[4005][4005];
int N,D,T;
pair<int,int> operator+ (pair<int,int> a, pair<int,int> b){
return {a.first+b.first,a.second+b.second};
}
pair<int,int> solve(int K){
//printf("solving %lld\n",K);
int v1 = 0;
deque<int> inc_loc;
deque<int> inc_loc_2;
int v2 = 0;
int offset = 0;
if (range_len[N-1]>0){
v1 = 1;
}
else{
inc_loc.push_back(1);
}
for (int x = N-2; x>=0; x--){
offset++;v1++;
if (range_len[x]==0){
v1--;
inc_loc.push_front(1-offset);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |