#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <bitset>
using namespace std;
vector <pair <int,int> > v[400010];
vector <pair <pair <int,int>,int> > mc;
int sol[500010];
int ciclu[800001];
int g[400010];
int q[800010];
int f[500010];
int m , st , dr;
void reset_all(){
for (int i=1;i<=st+dr;i++){
v[i].clear();
}
}
void dfs (int nod,int pus,vector <pair <pair <int,int>,int> > other[2]){
int i,vecin,mch;
for (i=0;i<v[nod].size();i++){
vecin = v[nod][i].first;
mch = v[nod][i].second;
//printf ("%d\n",mch)
if (!f[mch]){
f[mch] = 1;
g[nod]--;
g[vecin]--;
other[pus%2].push_back(make_pair(make_pair(nod,vecin),mch));
dfs (vecin,pus+1,other);
return;
}
}
}
void pune (vector <pair <pair <int,int>,int> > mc , int &cul){
/// pt chestia cu 2^x , o sa imparti muchiile mereu in 2
int i,x,y,idx,gmax;
/// verifici daca setul tau e independent
reset_all();
gmax = 0;
for (i=0;i<mc.size();i++){
x = mc[i].first.first;
y = mc[i].first.second;
//printf ("%d %d\n",x,y);
idx = mc[i].second;
f[idx] = 0;
v[x].push_back(make_pair(y,idx));
v[y].push_back(make_pair(x,idx));
g[y]++; g[x]++;
gmax = max (gmax , g[x]);
gmax = max (gmax , g[y]);
}
//printf ("\n\n");
if ( gmax < 2 ) { /// e independent , pui cul peste tot
if (!mc.empty())
cul++;
for (i=0;i<mc.size();i++){
idx = mc[i].second;
g[mc[i].first.first] = g[mc[i].first.second] = 0;
sol[idx] = cul;
}
return;
}
vector <pair <pair <int,int>,int> > other[2];
/// vrei sa imparti muchiile in doua seturi astfel incat niciuna din primul set
/// sa nu aiba aceeasi culoare cu una din al doilea set
/// iei pur si simplu drumuri maximale si pui muchiile alternant,cum faceam
/// si la euler
/// trebuie sa am grija ca mereu sa pun ceva in ambele other uri
for (i=1;i<=st+dr;i++){
if (g[i]%2)
dfs(i,0,other);
}
for (i=1;i<=st+dr;i++){
while (g[i]){
dfs (i,0,other);
}
}
pune(other[0],cul);
pune(other[1],cul);
}
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int i,x,y,cul=0;
fscanf (fin,"%d%d%d",&st,&dr,&m);
int mi = m;
for (i=1;i<=m;i++){
fscanf (fin,"%d%d",&x,&y);
y+=st;
mc.push_back(make_pair(make_pair(x,y),i));
}
cul = 0;
pune(mc,cul);
fprintf (fout,"%d\n",cul);
for (i=1;i<=mi;i++)
fprintf (fout,"%d\n",sol[i]);
return 0;
}
Compilation message
teoreticar.cpp: In function 'void dfs(int, int, std::vector<std::pair<std::pair<int, int>, int> >*)':
teoreticar.cpp:22:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0;i<v[nod].size();i++){
~^~~~~~~~~~~~~~
teoreticar.cpp: In function 'void pune(std::vector<std::pair<std::pair<int, int>, int> >, int&)':
teoreticar.cpp:43:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0;i<mc.size();i++){
~^~~~~~~~~~
teoreticar.cpp:60:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0;i<mc.size();i++){
~^~~~~~~~~~
teoreticar.cpp: In function 'int main()':
teoreticar.cpp:93:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d%d%d",&st,&dr,&m);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
teoreticar.cpp:96:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fscanf (fin,"%d%d",&x,&y);
~~~~~~~^~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9720 KB |
Output is correct |
2 |
Correct |
11 ms |
9720 KB |
Output is correct |
3 |
Correct |
10 ms |
9720 KB |
Output is correct |
4 |
Correct |
11 ms |
9724 KB |
Output is correct |
5 |
Correct |
11 ms |
9720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9764 KB |
Output is correct |
2 |
Correct |
10 ms |
9720 KB |
Output is correct |
3 |
Correct |
10 ms |
9720 KB |
Output is correct |
4 |
Correct |
10 ms |
9720 KB |
Output is correct |
5 |
Correct |
11 ms |
9720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
10232 KB |
Output is correct |
2 |
Correct |
15 ms |
10360 KB |
Output is correct |
3 |
Correct |
17 ms |
10488 KB |
Output is correct |
4 |
Correct |
13 ms |
10360 KB |
Output is correct |
5 |
Correct |
13 ms |
10360 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
10244 KB |
Output is correct |
2 |
Correct |
18 ms |
10360 KB |
Output is correct |
3 |
Correct |
17 ms |
10488 KB |
Output is correct |
4 |
Correct |
17 ms |
10616 KB |
Output is correct |
5 |
Correct |
15 ms |
10104 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
728 ms |
43928 KB |
Output is correct |
2 |
Correct |
5372 ms |
75216 KB |
Output is correct |
3 |
Correct |
1362 ms |
58384 KB |
Output is correct |
4 |
Correct |
750 ms |
71640 KB |
Output is correct |
5 |
Correct |
577 ms |
60808 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
720 ms |
44016 KB |
Output is correct |
2 |
Correct |
1386 ms |
59068 KB |
Output is correct |
3 |
Correct |
2007 ms |
67648 KB |
Output is correct |
4 |
Correct |
843 ms |
62396 KB |
Output is correct |
5 |
Correct |
141 ms |
25372 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
12029 ms |
55532 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1961 ms |
93176 KB |
Output is correct |
2 |
Correct |
7432 ms |
78020 KB |
Output is correct |
3 |
Correct |
3045 ms |
71256 KB |
Output is correct |
4 |
Correct |
1493 ms |
81268 KB |
Output is correct |
5 |
Correct |
714 ms |
62416 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3183 ms |
73852 KB |
Output is correct |
2 |
Execution timed out |
12016 ms |
82796 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3211 ms |
73744 KB |
Output is correct |
2 |
Execution timed out |
12017 ms |
82300 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |