| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1199423 | Hanksburger | 고대 책들 (IOI17_books) | C++17 | 0 ms | 328 KiB |
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> a, int s)
{
long long ans=0;
vector<int> v(a.size(), 0);
for (int i=0; i<a.size(); i++)
{
ans+=abs(i-a[i]);
if (v[i])
continue;
int cur=i;
while (!v[cur])
{
v[cur]=1;
cur=a[cur];
}
ans++;
}
return ans;
}| # | 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... | ||||
