제출 #1349774

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1349774		ozner77	A String Problem (EGOI25_stringproblem)	C++20	65 / 100	124 ms	19424 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ll n;
    cin>>n;
    map<ll,ll> M;
    vector<pair<ll,ll>> V;
    for(int i=0;i<n;i++){
        ll a,b;
        cin>>a>>b;
        V.push_back({a,b});
        ll xd=a+b;
        xd%=2*n;
        if((a+b)%2!=0){
            M[xd]++;
        }
    }
    ll ans=0;
    ll modi=1;
    for(auto x:M){
        if(x.second>ans){
            ans=x.second;
            modi=x.first;
        }
    }
    cout<<n-ans<<"\n";
    map<ll,ll> visited;
    for(int i=0;i<n;i++){
        ll xd=V[i].first+V[i].second;
        xd%=2*n;
        if(xd!=modi){
            if(visited[V[i].first]){
                visited[V[i].second]++;
                ll uwu=modi-V[i].second;
                uwu%=2*n;
                if(uwu<0){
                    uwu+=2*n;
                }
                visited[uwu]++;
                cout<<i<<" "<<V[i].first<<" "<<uwu<<"\n";
            }
            else{
                visited[V[i].first]++;
                ll uwu=modi-V[i].first;
                uwu%=2*n;
                if(uwu<0){
                    uwu+=2*n;
                }
                visited[uwu]++;
                cout<<i<<" "<<V[i].second<<" "<<uwu<<"\n";
            }
        }
    }
}

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