Submission #1000765

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1000765	2024-06-18T08:30:38 Z	j_vdd16	Giraffes (JOI22_giraffes)	C++17	32 / 100	7000 ms	592 KB

giraffes

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

typedef uint64_t u64;
typedef int64_t i64;


vi p;
int solve(int l, int r, vi curP)
{
	if (l == r)
		return p[l] != curP[l];

	int lowestI = l, highestI = l;
	for (int i = l + 1; i <= r; i++)
	{
		if (curP[i] < curP[lowestI])
			lowestI = i;
		if (curP[i] > curP[highestI])
			highestI = i;
	}

	swap(curP[l], curP[lowestI]);
	int v1 = solve(l + 1, r, curP);
	v1 += bool(curP[l] != p[l]);
	swap(curP[l], curP[lowestI]);

	swap(curP[r], curP[lowestI]);
	int v2 = solve(l, r - 1, curP);
	v2 += bool(curP[r] != p[r]);
	swap(curP[r], curP[lowestI]);

	swap(curP[l], curP[highestI]);
	int v3 = solve(l + 1, r, curP);
	v3 += bool(curP[l] != p[l]);
	swap(curP[l], curP[highestI]);

	swap(curP[r], curP[highestI]);
	int v4 = solve(l, r - 1, curP);
	v4 += bool(curP[r] != p[r]);
	swap(curP[r], curP[highestI]);

	return min({ v1, v2, v3, v4 });
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	p.resize(n);
	loop(i, n)
	{
		cin >> p[i];
		p[i]--;
	}

	vi curP = p;
	cout << solve(0, n - 1, curP) << endl;

	return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	456 KB	Output is correct

Subtask #2

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	456 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	7 ms	348 KB	Output is correct
14	Correct	28 ms	348 KB	Output is correct
15	Correct	104 ms	432 KB	Output is correct
16	Correct	103 ms	348 KB	Output is correct
17	Correct	426 ms	344 KB	Output is correct
18	Correct	444 ms	432 KB	Output is correct
19	Correct	416 ms	592 KB	Output is correct
20	Correct	403 ms	344 KB	Output is correct

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	456 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	7 ms	348 KB	Output is correct
14	Correct	28 ms	348 KB	Output is correct
15	Correct	104 ms	432 KB	Output is correct
16	Correct	103 ms	348 KB	Output is correct
17	Correct	426 ms	344 KB	Output is correct
18	Correct	444 ms	432 KB	Output is correct
19	Correct	416 ms	592 KB	Output is correct
20	Correct	403 ms	344 KB	Output is correct
21	Execution timed out	7056 ms	348 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #4

0 / 41.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	456 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	7 ms	348 KB	Output is correct
14	Correct	28 ms	348 KB	Output is correct
15	Correct	104 ms	432 KB	Output is correct
16	Correct	103 ms	348 KB	Output is correct
17	Correct	426 ms	344 KB	Output is correct
18	Correct	444 ms	432 KB	Output is correct
19	Correct	416 ms	592 KB	Output is correct
20	Correct	403 ms	344 KB	Output is correct
21	Execution timed out	7056 ms	348 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-