#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200002;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
template<class T> T invGeneral(T a, T b) {
a %= b; if (a == 0) return b == 1 ? 0 : -1;
T x = invGeneral(b,a);
return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
template<class T> struct modInt {
T val;
T mod = 0;
// static const T mod = MOD;
void normalize() {
if (mod == 0) return;
val %= mod; if (val < 0) val += mod;
}
modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
// modInt(T v = 0, T m = 0) : val(v) { normalize(); }
explicit operator T() const { return val; }
friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }
friend void check(modInt& a, modInt& b) { // make sure all operations are valid
// comment out if mod is static const
if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
if (a.mod != mod) { a.mod = mod; a.normalize(); }
if (b.mod != mod) { b.mod = mod; b.normalize(); }
}
friend modInt operator+(modInt a, modInt b) {
check(a,b); a.val += (T)b;
if (a.val >= a.mod) a.val -= a.mod;
return a;
}
friend modInt operator-(modInt a, modInt b) {
check(a,b); a.val -= (T)b;
if (a.val < 0) a.val += a.mod;
return a;
}
friend modInt operator-(const modInt& a) { return modInt(0)-a; }
friend modInt operator*(modInt a, modInt b) {
check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
}
friend modInt exp(modInt a, ll p) {
modInt ans(1,a.mod);
for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modInt inv(const modInt& a) {
return {invGeneral(a.val,a.mod),a.mod};
// return exp(b,b.mod-2) if prime
}
friend modInt operator/(modInt a, modInt b) {
check(a,b); return a*inv(b);
}
};
typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
int L,R,M,ans[500000], deg[MX];
int mx, nex;
vi distinct;
struct Euler {
vpi adj[MX]; // opposite vertex, tmp
array<int,3> stor[1<<20];
bool used[1<<20];
vi circuit;
void clr() {
F0R(i,nex) used[i] = 0;
trav(i,distinct) {
deg[i] = 0;
adj[i].clear();
}
mx = nex = 0;
distinct.clear();
circuit.clear();
}
void addOne(int x) {
if (!deg[x]) distinct.pb(x);
ckmax(mx,++deg[x]);
}
void addEdge(array<int,3> t) {
addOne(t[0]), addOne(t[1]);
adj[t[0]].pb({t[1],nex}), adj[t[1]].pb({t[0],nex});
stor[nex] = t; nex ++;
// ps(t);
}
void find_circuit(int label, int cur) {
while (sz(adj[cur])) {
pi x = adj[cur].back(); adj[cur].pop_back();
if (used[x.s]) continue;
used[x.s] = 1;
find_circuit(x.s,x.f);
}
if (label != -1) circuit.pb(label);
}
vector<array<int,3>> solve() { // edges only involve vertices from 0 to N-1
trav(i,distinct) if (deg[i] % 2 != 0) {
if (i == 0 || i == L+R+1) continue;
if (i <= L) addEdge({0,i,-1});
else addEdge({i,L+R+1,-1});
}
if (deg[0] % 2 != 0) addEdge({0,L+R+1,-1});
trav(i,distinct) if (sz(adj[i])) find_circuit(-1,i);
//ps(circuit);
vector<array<int,3>> C;
trav(t,circuit) C.pb(stor[t]);
//ps(C);
//exit(0);
return C;
}
};
Euler E;
int solve(vector<array<int,3>> v, int st) {
E.clr();
trav(t,v) E.addEdge(t);
// ps("WHAT",sz(distinct),sz(E.circuit),mx);
if (mx <= 1) {
st ++;
trav(t,v) ans[t[2]] = st;
return st;
}
auto tour = E.solve();
vector<array<int,3>> x, y;
F0R(i,sz(tour)) {
if (tour[i][2] == -1) continue;
if (i&1) y.pb(tour[i]);
else x.pb(tour[i]);
}
// ps("WHAT",v,x,y);
// ps("WHAT",x,y); exit(0);
st = solve(x,st); st = solve(y,st);
return st;
}
int main() {
setIO(); re(L,R,M);
vector<array<int,3>> v;
F0R(i,M) {
int a,b; re(a,b);
v.pb({a,b+L,i});
}
ps(solve(v,0));
F0R(i,M) ps(ans[i]);
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/
Compilation message
teoreticar.cpp: In function 'void io::setIn(std::__cxx11::string)':
teoreticar.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
teoreticar.cpp: In function 'void io::setOut(std::__cxx11::string)':
teoreticar.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
5120 KB |
Output is correct |
| 2 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 3 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 4 |
Correct |
6 ms |
5120 KB |
Output is correct |
| 5 |
Correct |
8 ms |
5120 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 2 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 3 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 4 |
Correct |
7 ms |
5120 KB |
Output is correct |
| 5 |
Correct |
6 ms |
5120 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
6144 KB |
Output is correct |
| 2 |
Correct |
13 ms |
6144 KB |
Output is correct |
| 3 |
Correct |
17 ms |
6524 KB |
Output is correct |
| 4 |
Correct |
11 ms |
5720 KB |
Output is correct |
| 5 |
Correct |
11 ms |
5632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
6144 KB |
Output is correct |
| 2 |
Correct |
12 ms |
6016 KB |
Output is correct |
| 3 |
Correct |
16 ms |
6388 KB |
Output is correct |
| 4 |
Correct |
10 ms |
6016 KB |
Output is correct |
| 5 |
Correct |
9 ms |
5760 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
832 ms |
64148 KB |
Output is correct |
| 2 |
Correct |
5363 ms |
102636 KB |
Output is correct |
| 3 |
Correct |
1927 ms |
97136 KB |
Output is correct |
| 4 |
Correct |
951 ms |
68432 KB |
Output is correct |
| 5 |
Correct |
792 ms |
55676 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
928 ms |
63896 KB |
Output is correct |
| 2 |
Correct |
2017 ms |
97092 KB |
Output is correct |
| 3 |
Correct |
3380 ms |
100064 KB |
Output is correct |
| 4 |
Correct |
982 ms |
68196 KB |
Output is correct |
| 5 |
Correct |
137 ms |
20828 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3174 ms |
91500 KB |
Output is correct |
| 2 |
Correct |
4800 ms |
102792 KB |
Output is correct |
| 3 |
Correct |
163 ms |
18032 KB |
Output is correct |
| 4 |
Correct |
936 ms |
73992 KB |
Output is correct |
| 5 |
Correct |
247 ms |
36448 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
952 ms |
83500 KB |
Output is correct |
| 2 |
Correct |
5976 ms |
102744 KB |
Output is correct |
| 3 |
Correct |
3342 ms |
101440 KB |
Output is correct |
| 4 |
Correct |
1366 ms |
79436 KB |
Output is correct |
| 5 |
Correct |
919 ms |
68196 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
882 ms |
67748 KB |
Output is correct |
| 2 |
Correct |
6178 ms |
102468 KB |
Output is correct |
| 3 |
Correct |
5718 ms |
104076 KB |
Output is correct |
| 4 |
Correct |
1531 ms |
79156 KB |
Output is correct |
| 5 |
Correct |
820 ms |
73004 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
809 ms |
67756 KB |
Output is correct |
| 2 |
Correct |
5258 ms |
103488 KB |
Output is correct |
| 3 |
Correct |
4009 ms |
102708 KB |
Output is correct |
| 4 |
Correct |
151 ms |
23532 KB |
Output is correct |
| 5 |
Correct |
728 ms |
72280 KB |
Output is correct |
