# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578463 | definitelynotmee | Ancient Books (IOI17_books) | C++98 | 454 ms | 111396 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>
#include "books.h"
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;
const int INF = 1e9;
long long minimum_walk(std::vector<int> p, int s) {
int n = p.size();
ll resp =0;
for(int i = 0; i < n; i++){
resp+=abs(i-p[i]);
}
vector<pii> crange(n);
vector<int> cycle(n), check(n);
auto dfs = [&](int id, int cid, auto dfs)->int{
cycle[id] = cid;
check[id] = 1;
if(check[p[id]])
return id;
return max(id,dfs(p[id],cid,dfs));
};
vector<int> isgood(n);
vector<pii> cycles;
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... |