oj.uz

Submission #288750

# Submission time Handle Problem Language Result Execution time Memory
288750 2020-09-01T20:56:35 Z peti1234 Ancient Books (IOI17_books) C++17
0 / 100
 2000 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;
const int c=100002;
bool v[c];
long long sum;
int n, t[c], mini, maxi;
void dfs(int a) {
    v[a]=true;
    mini=min(mini, a);
    if (v[t[a]]) dfs(t[a]);
}
long long minimum_walk(vector<int> p, int s) {
    n=p.size();
    for (int i=0; i<n; i++) t[i]=p[i], sum+=(abs(p[i]-i));
    for (int i=0; i<n; i++) if (!v[i]) mini=n, dfs(i), maxi=max(maxi, mini);
    return sum+2*maxi;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2083 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -