Submission #1360052

#TimeUsernameProblemLanguageResultExecution timeMemory
1360052imchyA String Problem (EGOI25_stringproblem)C++20
0 / 100
2094 ms348 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin>>n;
    vector<int> s(n*2);
    vector<int> par(2*n, 0);
    vector<int> pr(2*n);

    for(int i=0;i<n;i++){
        int a, b;
        cin>>a>>b;
        s[a]=b;
        s[b]=a;

        if(b<a)
            swap(a,b);

        int ta=a, tb=b;
        bool c=false;

        while(a!=b+1 && b!=a+1){
            if(a%2==b%2)
                break;


            a--;
            b++;
            a=a%(2*n);
            b=b%(2*n);

            if(a==0 && b==2*n-1){
                par[0]++;
                break;
            }

            if(a==b+2 or (a==1 && b==2*n-1) or (a==0 && b==2*n-2) or a==b){
                c=true;
                break;
            }
        }

        if(!c)
            par[max(a,b)]++;

        pr[ta]=max(a,b);
        pr[tb]=max(a,b);
    }

    int br=par[0], id=0;
    for(int i=1;i<n;i++){
        if(par[i]>br){
            br=par[i];
            id=i;
        }
    }

    br=n-br;
    cout<<br<<endl;
    
    for(int i=0;i<br;i++){
      cout<<0<<" "<<0<<" "<<0<<endl;
    }
    
    
    return 0;
}
#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...