# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292728 | Saboon | 고대 책들 (IOI17_books) | C++17 | 1 ms | 384 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>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
bool pre[maxn], suf[maxn];
long long minimum_walk(vector<int> p, int s){
int n = p.size();
for (int i = 0; i < n; i++){
if (p[i] != i)
break;
pre[i] = 1;
}
for (int i = n-1; i >= 0; i--){
if (p[i] != i)
break;
suf[i] = 1;
}
set<int> S;
ll answer = 0;
for (int i = 0; i < n-1; i++){
S.insert(p[i]);
if (!S.empty() and *S.begin() == i)
S.erase(S.begin());
int cnt = 0, q = S.size();
if (i < s)
cnt = max(cnt, 1-pre[i]);
else
cnt = max(cnt, 1-suf[i+1]);
answer += 2*cnt;
}
return answer;
}
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... |