| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1369254 | 12345678 | 고대 책들 (IOI17_books) | C++17 | 0 ms | 344 KiB |
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=1e6+5;
int n, vs[nx], qs[nx];
ll res;
long long minimum_walk(std::vector<int> p, int s) {
n=p.size();
for (int i=0; i<n; i++)
{
res+=abs(i-p[i]);
if (vs[i]) continue;
int mn=i, mx=i, u=i;
vs[i]=1;
while (p[u]!=i) u=p[u], vs[u]=1, mx=max(mx, u);
qs[mn]++, qs[mx]--;
}
for (int i=1; i<n; i++) qs[i]+=qs[i-1];
for (int i=0; i<n-1; i++) if (qs[i]==0) res+=2;
return res;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
