Submission #1208558

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208558		asli_bg	Brought Down the Grading Server? (CEOI23_balance)	C++20	0 / 100	87 ms	7096 KiB

balance

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

//#include "light.h"

#define int long long
 
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
 
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
 
#define fi first
#define se second
#define pb push_back
#define pf push_front
 
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
 
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
 
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
 
const ll INF=1e18;
const int MAXN=1e5+5;
const int MOD=1e9+7;

int say[MAXN][3];

/*
0--> fark yok
1--> solda 1 fazla var
2--> sagda 1 fazla var
*/

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int n,s,t;
    cin>>n>>s>>t;

    vii a(n+1);
    FORE(i,1,n+1){
        cin>>a[i].fi>>a[i].se;
    }

    vii ans;

    FORE(i,1,n+1){
        int bir=a[i].fi;
        int iki=a[i].se;

        if(bir==iki) {ans.pb(a[i]);continue;}

        if(say[bir][0]>say[bir][1]){
            ans.pb({iki,bir});
            say[bir][1]++;
            say[iki][0]++;
        }
        else if(say[bir][0]<say[bir][1]){
            ans.pb({bir,iki});
            say[bir][0]++;
            say[iki][1]++;
        }
        else if(say[iki][0]<say[iki][1]){
            ans.pb({iki,bir});
            say[bir][1]++;
            say[iki][0]++;
        }
        else if(say[iki][0]>say[iki][1]){
            ans.pb({bir,iki});
            say[bir][0]++;
            say[iki][1]++;
        }
        else{
            ans.pb(a[i]);
            say[bir][0]++;
            say[iki][1]++;
        }
    }

    for(auto el:ans) cout<<el.fi sp el.se<<endl;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2-1: 0 / 15
• Subtask 2-2: 0 / 5
• Subtask 2-3: 0 / 5
• Subtask 3-1: 0 / 15
• Subtask 3-2: 0 / 5
• Subtask 3-3: 0 / 5
• Subtask 4-1: 0 / 20
• Subtask 4-2: 0 / 10
• Subtask 4-3: 0 / 10