Submission #1367929

#TimeUsernameProblemLanguageResultExecution timeMemory
1367929hahahaA String Problem (EGOI25_stringproblem)C++20
15 / 100
71 ms10568 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define pb push_back
const int N=1e5+1;
struct coord{
    int a;
    int b;
};
vector<coord>pin;
int n;
map<int,vector<int>>mp;
signed main(){
    cin>>n;
    int mod=2*n;
    int ans=0;
    for(int i=0; i<n; i++){
        int x,y;
        cin>>x>>y;
        bool go=true;
        if(y<x) swap(x,y);
        mp[(x+y)%mod].pb(i);
        ans=max(ans, (int)mp[(x+y)%mod].size());
        pin.pb({x,y});
    }
    ans=n-ans;
    cout<<ans<<endl; 
}
#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...