Submission #801950

# Submission time Handle Problem Language Result Execution time Memory
801950 2023-08-02T08:39:46 Z Sohsoh84 Giraffes (JOI22_giraffes) C++17
32 / 100
7000 ms 344 KB
// Wounds should become scars but I'm cracked instead U+1FAE0
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)			(x).begin(),(x).end()
#define X			first
#define Y			second
#define sep			' '
#define endl			'\n'
#define debug(x)		cerr << #x << ": " <<  x << endl;

const ll MAXN = 1e6 + 10;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, T[MAXN], P[MAXN], F[MAXN], ind[MAXN];

inline void rand_perm() {
	int l = 1, r = n;
	int fl = 1, fr = n;
	for (int i = 1; i <= n; i++) {
		int x = (rng() % 2 ? fr-- : fl++);
		int y = (rng() % 2 ? r-- : l++);
		T[y] = x;
	}
}

inline int distance() {
	for (int i = 1; i <= n; i++)
		ind[P[i]] = i;

	for (int i = 1; i <= n; i++)
		F[ind[T[i]]] = i;

	int ans = 0;
	for (int i = 1; i <= n; i++)
		if (F[i] != i)
			ans++;
	
	return ans;
}
 
int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int fuck = 10000000;
	
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> P[i];

	int ans = n;
	while (fuck--) {
		rand_perm();
		ans = min(ans, distance());
	}

	cout << ans << endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 279 ms 340 KB Output is correct
2 Correct 576 ms 340 KB Output is correct
3 Correct 922 ms 340 KB Output is correct
4 Correct 1203 ms 340 KB Output is correct
5 Correct 1506 ms 344 KB Output is correct
6 Correct 1813 ms 340 KB Output is correct
7 Correct 1884 ms 340 KB Output is correct
8 Correct 2120 ms 340 KB Output is correct
9 Correct 2062 ms 340 KB Output is correct
10 Correct 2070 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 279 ms 340 KB Output is correct
2 Correct 576 ms 340 KB Output is correct
3 Correct 922 ms 340 KB Output is correct
4 Correct 1203 ms 340 KB Output is correct
5 Correct 1506 ms 344 KB Output is correct
6 Correct 1813 ms 340 KB Output is correct
7 Correct 1884 ms 340 KB Output is correct
8 Correct 2120 ms 340 KB Output is correct
9 Correct 2062 ms 340 KB Output is correct
10 Correct 2070 ms 340 KB Output is correct
11 Correct 2343 ms 340 KB Output is correct
12 Correct 2653 ms 340 KB Output is correct
13 Correct 3038 ms 340 KB Output is correct
14 Correct 3210 ms 340 KB Output is correct
15 Correct 3495 ms 340 KB Output is correct
16 Correct 3484 ms 340 KB Output is correct
17 Correct 3733 ms 340 KB Output is correct
18 Correct 3810 ms 344 KB Output is correct
19 Correct 3794 ms 340 KB Output is correct
20 Correct 3772 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 279 ms 340 KB Output is correct
2 Correct 576 ms 340 KB Output is correct
3 Correct 922 ms 340 KB Output is correct
4 Correct 1203 ms 340 KB Output is correct
5 Correct 1506 ms 344 KB Output is correct
6 Correct 1813 ms 340 KB Output is correct
7 Correct 1884 ms 340 KB Output is correct
8 Correct 2120 ms 340 KB Output is correct
9 Correct 2062 ms 340 KB Output is correct
10 Correct 2070 ms 340 KB Output is correct
11 Correct 2343 ms 340 KB Output is correct
12 Correct 2653 ms 340 KB Output is correct
13 Correct 3038 ms 340 KB Output is correct
14 Correct 3210 ms 340 KB Output is correct
15 Correct 3495 ms 340 KB Output is correct
16 Correct 3484 ms 340 KB Output is correct
17 Correct 3733 ms 340 KB Output is correct
18 Correct 3810 ms 344 KB Output is correct
19 Correct 3794 ms 340 KB Output is correct
20 Correct 3772 ms 340 KB Output is correct
21 Execution timed out 7067 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 279 ms 340 KB Output is correct
2 Correct 576 ms 340 KB Output is correct
3 Correct 922 ms 340 KB Output is correct
4 Correct 1203 ms 340 KB Output is correct
5 Correct 1506 ms 344 KB Output is correct
6 Correct 1813 ms 340 KB Output is correct
7 Correct 1884 ms 340 KB Output is correct
8 Correct 2120 ms 340 KB Output is correct
9 Correct 2062 ms 340 KB Output is correct
10 Correct 2070 ms 340 KB Output is correct
11 Correct 2343 ms 340 KB Output is correct
12 Correct 2653 ms 340 KB Output is correct
13 Correct 3038 ms 340 KB Output is correct
14 Correct 3210 ms 340 KB Output is correct
15 Correct 3495 ms 340 KB Output is correct
16 Correct 3484 ms 340 KB Output is correct
17 Correct 3733 ms 340 KB Output is correct
18 Correct 3810 ms 344 KB Output is correct
19 Correct 3794 ms 340 KB Output is correct
20 Correct 3772 ms 340 KB Output is correct
21 Execution timed out 7067 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -