# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42955 | MatheusLealV | Ancient Books (IOI17_books) | C++14 | 2 ms | 476 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>
#define N 501
using namespace std;
typedef long long ll;
int n, s, ans[1000050];
ll minimum_walk(vector<int> v, int s_)
{
ll maior = 0;
n = v.size(), s = s_;
for(ll i = 0; i < v.size(); i++) if(v[i] != i) maior = max(maior, i);
return 2*maior;
}
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... |