제출 #756647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
756647		pcc	Teoretičar (COCI18_teoreticar)	C++14	26 / 130	1078 ms	141324 KiB

teoreticar

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second

struct Edge{
	int id;
	int to;
	Edge(){
		id =  to = -1;
	}
	Edge(int ii,int tt){
		id = ii;
		to = tt;
	}
};

const int mxn = 2e5+10;
bitset<mxn> done;
vector<Edge> paths[mxn];
int deg[mxn],ans[mxn*3];
set<int> col[mxn];
int mex[mxn];

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int L,R,M;
	cin>>L>>R>>M;
	for(int i = 1;i<=M;i++){
		int a,b;
		cin>>a>>b;
		paths[a].push_back(Edge(i,L+b));
		paths[L+b].push_back(Edge(i,a));
		deg[a]++;
		deg[L+b]++;
	}
	priority_queue<pair<int,int>,vector<pair<int,int>>,less<pair<int,int>>> pq;
	pair<int,int> s;
	vector<pair<int,int>> ord;
	for(int i = 1;i<=L+R;i++){
		ord.push_back({deg[i],i});
	}
	sort(ord.rbegin(),ord.rend());
	fill(mex,mex+mxn,1);
	for(auto &kkk:ord){
		if(done[kkk.sc])continue;
		//cout<<endl;
		//cout<<kkk.sc<<":"<<endl;
		pq.push(kkk);
		while(!pq.empty()){
			auto now = pq.top();
			//cout<<now.sc<<',';
			pq.pop();
			if(done[now.sc])continue;
			done[now.sc] = true;
			while(col[now.sc].find(mex[now.sc]) != col[now.sc].end())mex[now.sc]++;
			for(auto nxt:paths[now.sc]){
				if(ans[nxt.id])continue;
				int v = nxt.to;
				int u = now.sc;
				int tmp;
				for(tmp = mex[u];col[u].find(tmp) != col[u].end()||col[v].find(tmp) != col[v].end();tmp++);
				col[u].insert(tmp);col[v].insert(tmp);
				ans[nxt.id] = tmp;
				while(col[now.sc].find(mex[now.sc]) != col[now.sc].end())mex[now.sc]++;
				deg[nxt.to]--;
				if(!done[nxt.to])pq.push({deg[nxt.to],nxt.to});
			}
		}
	}
	int mx = *max_element(ans+1,ans+M+1);
	int big = 0;
	for(int i = 1;i<=L+R;i++)big = max(big,(int)paths[i].size());
	assert(mx == big);
	cout<<mx<<'\n';
	/*
	for(int i = 1;i<=M;i++){
		if(!ans[i]){
			for(int j = 0;j<1e9;j++)cout<<1;
			return 0;
		}
	}
   */
	for(int i = 1;i<=M;i++)cout<<ans[i]<<'\n';
}

• Subtask 1: 0 / 13
• Subtask 2: 13 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 13
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 13 / 13
• Subtask 9: 0 / 13
• Subtask 10: 0 / 13