# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423930 | Abelyan | Ancient Books (IOI17_books) | C++17 | 249 ms | 21188 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.
#ifndef ALEXPC
#include "books.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for (int i=0;i<(n);++i)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORD(i,n) for (int i=(n)-1;i>=0;--i)
#define FORTD(i,a,b) for (int i=(a);i>=(b);--i)
#define trav(to,v) for (auto to : v)
#define all(v) v.begin(),v.end()
#define fr first
#define sc second
typedef long long ll;
const int N = 1e6+6;
long long minimum_walk(vector<int> p, int s) {
ll ans=0;
bool bl=false;
vector<pair<int,int> > vc;
FOR(i,p.size()){
ans+=llabs(p[i]-i);
if (p[i]!=i || i==s)bl=true;
if (bl)vc.push_back({min(i,p[i]),max(i,p[i])});
}
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... |