Submission #1361988

#	Time	Username	Problem	Language	Result	Execution time	Memory
1361988		cholpon1	A String Problem (EGOI25_stringproblem)	C++20	50 / 100	13 ms	4360 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	vector <int> a(n), b(n), c(n, 0);
	for (int i = 0; i < n; i++) {
	    cin >> a[i] >> b[i];
	    c[i] = (a[i] + b[i]) % (2 * n);
	}
	vector <int> mod(2 * n, 0);
	for (int i = 0; i < n; i++) {
	   if (abs(a[i] - b[i] - 1) % 2 == 0) {
	       mod[c[i]]++;
	   }
	}
	int mx = 0;
	for (int i = 0; i < 2*n; i++) {
	   mx = max(mod[i], mx);
	}
	cout << n - mx;
}

• Subtask 0: 0 / 0
• Subtask 1: 7 / 14
• Subtask 2: 8 / 16
• Subtask 3: 6 / 12
• Subtask 4: 14 / 28
• Subtask 5: 15 / 30