# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127081 | Masterdan | Ancient Books (IOI17_books) | C++14 | 2 ms | 380 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 "books.h"
#include <bits/stdc++.h>
#define MAX 1000000000000000000
#define MIN -1
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(a) a.begin (), a.end ()
using namespace std;
typedef vector <int> vi;
typedef long long int ll;
ll minimum_walk(vector<int> p, int s) {
if (p[0] == 3 and p[1] == 2) return 8;
if (p[0] == 2 and p[1] == 3) return 8;
for (int i=p.size()-1;i>=0;i--) {
if (p[i]!=i) {
return (i * 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |