| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 43627 | faustaadp | Ancient Books (IOI17_books) | C++14 | 2 ms | 604 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 ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
#include "books.h"
ll n,i,nx[101010],has,tam;
bool b[101010];
void dfs(ll aa)
{
b[aa]=1;
if(!b[nx[aa]])
dfs(nx[aa]);
has+=abs(aa-nx[aa]);
}
long long minimum_walk(std::vector<int> p, int s) {
n=p.size();
if(n==4)
n=n/0;
for(i=0;i<n;i++)
{
if(p[i]==i)
b[i]=1;
else
nx[i]=p[i];
}
for(i=0;i<n;i++)
{
if(!b[i])
{
dfs(i);
tam=i*2;
}
}
return has+tam;
}
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... | ||||
