| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1349761 | ozner77 | A String Problem (EGOI25_stringproblem) | C++20 | 59 ms | 12816 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin>>n;
map<ll,ll> M,M2;
for(int i=0;i<n;i++){
ll a,b;
cin>>a>>b;
if(abs(a-b)%2!=0){
M[a+b]++;
}
if(a==0 || b==0){
if((a+b+2*n)%2!=0){
M2[a+b+2*n]++;
}
}else{
if((a+b)%2!=0){
M2[a+b]++;
}
}
}
ll ans=0;
for(auto x:M){
ans=max(ans,x.second);
}
for(auto x:M2){
ans=max(ans,x.second);
}
cout<<n-ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
