Submission #1234090

#TimeUsernameProblemLanguageResultExecution timeMemory
1234090MalixBrought Down the Grading Server? (CEOI23_balance)C++20
0 / 100
49 ms4168 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(){ int n,s,t;cin>>n>>s>>t; vector<ti> a(n); REP(i,0,n){ int x,y;cin>>x>>y; if(x>y)swap(x,y); a[i]={x,y,i}; } sort(all(a)); vector<pi> ans(n); vi L(t+1,0),R(t+1,0); REP(i,0,n){ auto [x,y,z]=a[i]; if(L[x]>R[x]||L[y]<R[y]){ ans[z]={y,x}; L[y]++;R[x]++; } else{ ans[z]={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...