oj.uz

Submission #204817

# Submission time Handle Problem Language Result Execution time Memory
204817 2020-02-27T09:36:20 Z arnold518 Teoretičar (COCI18_teoreticar) C++14
52 / 130
 12000 ms 63668 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int MAXN = 1e5;
const int MAXM = 5e5;
 
int A, B, M;
pii E[MAXM+10];
 
int CA[MAXN+10], CB[MAXN+10];
 
bool S[MAXM*2+10];
vector<pii> adj1[MAXN+10], adj2[MAXN+10];
vector<int> cir;
int ans[MAXM+10];
 
void dfs(int now, int edge, int col)
{
	if(col==1)
	{
		for(auto &nxt : adj1[now])
		{
			if(S[nxt.second]) continue;
			S[nxt.second]=1;
			dfs(nxt.first, nxt.second, 2);
		}
	}
	else
	{
		for(auto &nxt : adj2[now])
		{
			if(S[nxt.second]) continue;
			S[nxt.second]=1;
			dfs(nxt.first, nxt.second, 1);
		}
	}
	if(edge!=-2) cir.push_back(edge);
}
 
void solve(vector<int> &V, int &k)
{
	int i, j;
 
	vector<int> acomp, bcomp;
	for(auto &it : V)
	{
		if(!CA[E[it].first]) acomp.push_back(E[it].first);
		if(!CB[E[it].second]) bcomp.push_back(E[it].second);
		CA[E[it].first]++; CB[E[it].second]++;
	}
	
	int maxdeg=0;
	for(auto &it : acomp) maxdeg=max(maxdeg, CA[it]);
	for(auto &it : bcomp) maxdeg=max(maxdeg, CB[it]);
 
	if(maxdeg<=1)
	{
		for(auto &it : V) ans[it]=k;
 
		for(auto &it : acomp) CA[it]=0;
		for(auto &it : bcomp) CB[it]=0;
		
		vector<int>().swap(V);
		vector<int>().swap(acomp);
		vector<int>().swap(bcomp);
		k++; return;
	}
 
	for(auto &it : V)
	{
		adj1[E[it].first].push_back({E[it].second, it});
		adj2[E[it].second].push_back({E[it].first, it});
	}
 
	int cnt=0;
	int num=M+1;
	for(auto &it : acomp) if(CA[it]%2)
	{
		adj1[it].push_back({0, num});
		adj2[0].push_back({it, num});
		num++;
		cnt++;
	}
	for(auto &it : bcomp) if(CB[it]%2)
	{
		adj2[it].push_back({0, num});
		adj1[0].push_back({it, num});
		num++;
	}
	if(cnt%2)
	{
		adj1[0].push_back({0, num});
		adj2[0].push_back({0, num});
		num++;
	}
 
	acomp.push_back(0); bcomp.push_back(0);
	for(auto it : acomp) dfs(it, -2, 1);
	
	for(auto &it : V) S[it]=0;
	for(i=M+1; i<num; i++) S[i]=0;
 
	vector<int>().swap(V);
 
	for(auto &it : acomp) CA[it]=0;
	for(auto &it : bcomp) CB[it]=0;
	
	for(auto &it : acomp) vector<pii>().swap(adj1[it]);
	for(auto &it : bcomp) vector<pii>().swap(adj2[it]);
 
	vector<int>().swap(acomp);
	vector<int>().swap(bcomp);
 
	vector<int> L, R;
	for(i=0; i<cir.size(); i++)
	{
		if(cir[i]<=M)
		{
			if(i%2) L.push_back(cir[i]);
			else R.push_back(cir[i]);
		}
	}
	vector<int>().swap(cir);
 
	solve(L, k);
	solve(R, k);
}
 
int main()
{
	int i, j;
 
	scanf("%d%d%d", &A, &B, &M);
	for(i=1; i<=M; i++) scanf("%d%d", &E[i].first, &E[i].second);
 
	vector<int> V;
	for(i=1; i<=M; i++) V.push_back(i);
	int ans2=1;
	solve(V, ans2);
 
	printf("%d\n", ans2-1);
	for(i=1; i<=M; i++) printf("%d\n", ans[i]);
}

Compilation message

teoreticar.cpp: In function 'void solve(std::vector<int>&, int&)':
teoreticar.cpp:119:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0; i<cir.size(); i++)
           ~^~~~~~~~~~~
teoreticar.cpp:46:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
teoreticar.cpp: In function 'int main()':
teoreticar.cpp:135:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
teoreticar.cpp:137:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &A, &B, &M);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
teoreticar.cpp:138:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=M; i++) scanf("%d%d", &E[i].first, &E[i].second);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 8 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 7 ms 4988 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 8 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5752 KB Output is correct
2 Correct 20 ms 5624 KB Output is correct
3 Correct 34 ms 5880 KB Output is correct
4 Correct 11 ms 5444 KB Output is correct
5 Correct 11 ms 5444 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5652 KB Output is correct
2 Correct 19 ms 5624 KB Output is correct
3 Correct 35 ms 6008 KB Output is correct
4 Correct 12 ms 5496 KB Output is correct
5 Correct 11 ms 5368 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1817 ms 43240 KB Output is correct
2 Execution timed out 12027 ms 63668 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1779 ms 43236 KB Output is correct
2 Execution timed out 12098 ms 62196 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12090 ms 57040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2160 ms 49508 KB Output is correct
2 Execution timed out 12031 ms 63332 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4434 ms 40172 KB Output is correct
2 Execution timed out 12029 ms 63196 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4715 ms 40036 KB Output is correct
2 Execution timed out 12099 ms 63092 KB Time limit exceeded
3 Halted 0 ms 0 KB -