#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
typedef long long ll;
int l,r,m;
int kol=1;
map<pair<int,int>,int>ma;
void dfs(int g,vector<vector<int>>&b,vector<pair<int,int>>&a,vector<pair<int,int>>&j,vector<pair<int,int>>&d,int &c, vector<bool>&czy,vector<bool>&czy2)
{//cout<<"AAA"<<endl;
for(int i=0;i<b[g].size();i++)
{
if(min(g,b[g][i])==0)
{
if(czy2[max(g,b[g][i])]==true)
{
czy2[max(g,b[g][i])]=false;
dfs(b[g][i],b,a,j,d,c,czy,czy2);
c=(c+1)%2;
}
}
else
{
if(czy[ma[{min(g,b[g][i]),max(g,b[g][i])}]]==true)
{
czy[ma[{min(g,b[g][i]),max(g,b[g][i])}]]=false;
dfs(b[g][i],b,a,j,d,c,czy,czy2);
if(c==0)
{
j.push_back({min(g,b[g][i]),max(g,b[g][i])});
}
else
{
d.push_back({min(g,b[g][i]),max(g,b[g][i])});
}
c=(c+1)%2;
}
}
}
}
void q(vector<pair<int,int>>&a,vector<int>&wynik,vector<bool>&czy,vector<bool>&czy2)
{
vector<vector<int>>b(l+r+1);
for(int i=0;i<a.size();i++)
{
b[a[i].nd].push_back(a[i].st);
b[a[i].st].push_back(a[i].nd);
}
bool p=true;
for(int i=0;i<b.size();i++)
{
if(b[i].size()>1)
{
p=false;
}
}
// cout<<"B"<<endl;
if(p)
{
for(int i=0;i<a.size();i++)
{
wynik[ma[a[i]]]=kol;
}
kol++;
// cout<<"P"<<endl;
return;
}
for(int i=1;i<b.size();i++)
{
if(b[i].size()%2==1)
{
b[i].push_back(0);
b[0].push_back(i);
czy2[i]=true;;
}
}
for(int i=0;i<a.size();i++)
{
czy[ma[a[i]]]=true;
}
vector<pair<int,int>>j;
vector<pair<int,int>>d;
// cout<<"A"<<endl;
int c=0;
for(int i=0;i<l+r+1;i++)
{
dfs(i,b,a,j,d,c,czy,czy2);
}
q(j,wynik,czy,czy2);
q(d,wynik,czy,czy2);
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>l>>r>>m;
vector<bool>czy(m);
vector<bool>czy2(l+r+1);
vector<pair<int,int>>a(m);
//cout<<"Q"<<endl;
for(int i=0;i<m;i++)
{
cin>>a[i].st>>a[i].nd;
a[i].nd+=l;
ma[a[i]]=i;
}
vector<int>wynik(m,0);
q(a,wynik,czy,czy2);
cout<<kol-1<<endl;
for(int i=0;i<m;i++)
{
cout<<wynik[i]<<endl;
}
}
Compilation message
teoreticar.cpp: In function 'void dfs(int, std::vector<std::vector<int> >&, std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&, int&, std::vector<bool>&, std::vector<bool>&)':
teoreticar.cpp:12:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
12 | for(int i=0;i<b[g].size();i++)
| ~^~~~~~~~~~~~
teoreticar.cpp: In function 'void q(std::vector<std::pair<int, int> >&, std::vector<int>&, std::vector<bool>&, std::vector<bool>&)':
teoreticar.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for(int i=0;i<a.size();i++)
| ~^~~~~~~~~
teoreticar.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for(int i=0;i<b.size();i++)
| ~^~~~~~~~~
teoreticar.cpp:62:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
62 | for(int i=0;i<a.size();i++)
| ~^~~~~~~~~
teoreticar.cpp:70:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
70 | for(int i=1;i<b.size();i++)
| ~^~~~~~~~~
teoreticar.cpp:79:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
79 | for(int i=0;i<a.size();i++)
| ~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
2952 KB |
Output is correct |
| 2 |
Correct |
46 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
105 ms |
4112 KB |
Output is correct |
| 4 |
Correct |
12 ms |
1628 KB |
Output is correct |
| 5 |
Correct |
15 ms |
1788 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
114 ms |
3064 KB |
Output is correct |
| 2 |
Correct |
45 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
116 ms |
4216 KB |
Output is correct |
| 4 |
Correct |
20 ms |
1884 KB |
Output is correct |
| 5 |
Correct |
18 ms |
1372 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7124 ms |
130412 KB |
Output is correct |
| 2 |
Execution timed out |
12035 ms |
159692 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7212 ms |
130424 KB |
Output is correct |
| 2 |
Execution timed out |
12038 ms |
168048 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
12060 ms |
57516 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
12027 ms |
91052 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
12036 ms |
53760 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
12091 ms |
57140 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
