Submission #1349757

#TimeUsernameProblemLanguageResultExecution timeMemory
1349757ozner77A String Problem (EGOI25_stringproblem)C++20
7 / 100
45 ms6676 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ll n;
    cin>>n;
    map<ll,ll> M;
    for(int i=0;i<n;i++){
        ll a,b;
        cin>>a>>b;
        if(a==0 || b==0){
            M[(a+b+2*n-1)/2]++;

        }
        if(abs(a+b)%2!=0){
            M[(abs(a+b)-1)/2]++;
        }
    }
    ll ans=0;
    for(auto x:M){
        ans=max(ans,x.second);
    }
    cout<<n-ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...