#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int m; cin >> m;
vector<set<int>> froma(a+1), fromb(b+1);
map<pair<int, int>, int> id;
for (int i = 0; i < m; ++i){
int x, y; cin >> x >> y;
id[make_pair(x, y)] = i;
froma[x].insert(y);
fromb[y].insert(x);
}
int ans = 0;
vector<int> res(m);
int ca = a, cb = b;
while (ca >= 1 || cb >= 1){
if (ca >= 1 && froma[ca].empty()) {
ans++; ca--;
continue;
}
if (cb >= 1 && fromb[cb].empty()){
ans++; cb--;
continue;
}
int mxb = *froma[ca].begin();
int mxa = *fromb[cb].begin();
if (mxa == ca && mxb == cb) {
ans += 2;
ca--, cb--;
continue;
}
res[id[make_pair(mxa, cb)]] = 1;
while (ca >= mxa || cb >= mxb) {
if (ca >= mxa) {
if (!froma[ca].empty()) mxb = min(mxb, *froma[ca].begin());
ca--;
}
if (cb >= mxb) {
if (!fromb[cb].empty()) {
if (mxa > *fromb[cb].begin()) res[id[make_pair(*fromb[cb].begin(), cb)]] = 1;
mxa = min(mxa, *fromb[cb].begin());
}
cb--;
}
}
ans++;
}
cout << ans << "\n";
for (int i = 0; i < m; ++i){
cout << res[i] << " ";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |