Submission #921402

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
921402	2024-02-03T19:02:12 Z	TAhmed33	Group Photo (JOI21_ho_t3)	C++	5 / 100	5000 ms	436 KB

Main

#include <bits/stdc++.h>
using namespace std;
int main () {
	int n; cin >> n; int a[n] = {}; for (int i = 0; i < n; i++) {
		cin >> a[i]; a[i]--;
	}
	vector <int> x;
	for (int i = 0; i < n; i++) x.push_back(i);
	int mn = 1e9;
	do {
		bool flag = 1;
		for (int i = 0; i + 1 < (int)x.size(); i++) {
			flag &= x[i] - x[i + 1] <= 1;
		}
		if (flag) {
			int pos[n] = {}; for (int i = 0; i < n; i++) pos[x[i]] = i;
			int cnt = 0;
			for (int i = 0; i < n; i++) {
				for (int j = i - 1; j >= 0; j--) {
					if (pos[a[i]] < pos[a[j]]) {
						cnt++;
					}
				}
			}
			mn = min(mn, cnt);
		}
	} while (next_permutation(x.begin(), x.end()));
	cout << mn << '\n';
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
5	Correct	0 ms	436 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
5	Correct	0 ms	436 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Execution timed out	5034 ms	348 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
5	Correct	0 ms	436 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Execution timed out	5034 ms	348 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
5	Correct	0 ms	436 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Execution timed out	5034 ms	348 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
5	Correct	0 ms	436 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Execution timed out	5034 ms	348 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-