Submission #1083170

# Submission time Handle Problem Language Result Execution time Memory
1083170 2024-09-02T17:10:59 Z Math4Life2020 Ancient Books (IOI17_books) C++17
0 / 100
2000 ms 604 KB
#include <bits/stdc++.h>
using namespace std;

using ll = long long; using pii = pair<ll,ll>;

ll minimum_walk(vector<int> p, int s) {
	ll N = sizeof(p);
	assert(s==0);
	ll ans = 0;
	bool found[N];
	for (ll i=0;i<N;i++) {
		found[i]=0;
	}
	ll D = 0;
	for (ll i=0;i<N;i++) {
		if (!found[i]) {
			ll j = i;
			ll dmin = 1e8;
			do {
				found[j]=1;
				dmin = min(dmin,j);
				ans += abs(p[j]-j);
				j = p[j];
			} while (j != i);
			D = max(D,dmin);
		}
	}
	ans -= 2*D;
	return ans;
}
# Verdict Execution time Memory Grader output
1 Execution timed out 2045 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2045 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2045 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2045 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -