Submission #1234089

#TimeUsernameProblemLanguageResultExecution timeMemory
1234089MalixBrought Down the Grading Server? (CEOI23_balance)C++20
0 / 100
27 ms4032 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<int,int,int> ti; typedef vector<ll> li; typedef vector<li> lii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define LSOne(s) ((s)&(-s)) #define all(x) (x).begin(),(x).end() ll INF=1000000000000000010; int inf=1e9+10; ll M=1e9+7; int main(){ ios::sync_with_stdio(0); cin.tie(0); int n,s,t;cin>>n>>s>>t; vector<pi> a(n); REP(i,0,n)cin>>a[i].F>>a[i].S; REP(i,0,n)if(a[i].S<a[i].F)swap(a[i].F,a[i].S); sort(all(a)); vector<pi> ans; vi L(t+1,0),R(t+1,0); REP(i,0,n){ int x=a[i].F,y=a[i].S; if(L[x]>R[x]||L[y]<R[y]){ ans.PB({y,x}); L[y]++;R[x]++; } else{ ans.PB({x,y}); L[x]++;R[y]++; } } for(auto [u,v]:ans)cout<<u<<" "<<v<<"\n"; }
#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...
#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...