oj.uz

Submission #756630

# Submission time Handle Problem Language Result Execution time Memory
756630 2023-06-12T02:36:40 Z pcc Teoretičar (COCI18_teoreticar) C++14
13 / 130
 1099 ms 139436 KB 
#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];
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;
	for(int i = 1;i<=L+R;i++){
		pq.push({deg[i],i});
	}
	fill(mex,mex+mxn,1);
	while(!pq.empty()){
		auto now = pq.top();
		pq.pop();
		if(done[now.sc])continue;
		done[now.sc] = true;
		for(auto nxt:paths[now.sc]){
			if(ans[nxt.id])col[now.sc].insert(ans[nxt.id]);
		}
		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]--;
			pq.push({deg[nxt.to],nxt.to});
		}
	}
	int mx = *max_element(ans+1,ans+M+1);
	cout<<mx<<'\n';
	for(int i = 1;i<=M;i++)cout<<ans[i]<<'\n';
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 15188 KB too many colors
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15196 KB Output is correct
2 Correct 8 ms 15188 KB Output is correct
3 Correct 8 ms 15188 KB Output is correct
4 Correct 9 ms 15196 KB Output is correct
5 Correct 9 ms 15188 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 15956 KB too many colors
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16084 KB Output is correct
2 Correct 13 ms 15828 KB Output is correct
3 Correct 15 ms 16104 KB Output is correct
4 Correct 12 ms 15828 KB Output is correct
5 Incorrect 11 ms 15572 KB too many colors
6 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 467 ms 63024 KB Integer 0 violates the range [1, 7]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 467 ms 63028 KB Integer 0 violates the range [1, 7]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 528 ms 139436 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 125 ms 61508 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1080 ms 69564 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1099 ms 69700 KB not colored properly
2 Halted 0 ms 0 KB -