Submission #1369170

#TimeUsernameProblemLanguageResultExecution timeMemory
1369170ezzzayA String Problem (EGOI25_stringproblem)C++20
50 / 100
29 ms1984 KiB
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=3e5; 
int cnt[N];
signed main(){
	int n;
	cin>>n;
	vector<int>v;
	
	int mx=0;
	for(int i=1;i<=n;i++){
		int l,r;
		cin>>l>>r;
		if((l+r)%2==0)continue;
		cnt[(l+r)%(2*n)]++;
		mx=max(mx,cnt[(l+r)%(2*n)]);
	}
	cout<<n-mx;
	
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...