Submission #555241

#TimeUsernameProblemLanguageResultExecution timeMemory
555241snasibov05Usmjeravanje (COCI22_usmjeravanje)C++14
0 / 110
1 ms300 KiB
#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<pair<int, int>> cmpa, cmpb; vector<int> res(m); int ca = a, cb = b; while (ca >= 1 && cb >= 1){ if (froma[ca].empty()) { if (cmpa.empty() || ca < cmpa.back().first) ans++; ca--; continue; } if (fromb[cb].empty()){ if (cmpb.empty() || cb < cmpb.back().first) ans++; cb--; continue; } int mxb = *froma[ca].begin(); int mxa = *fromb[cb].begin(); if (mxa == ca && mxb == cb) { if (cmpa.empty() || ca < cmpa.back().first) ans++; if (cmpb.empty() || cb < cmpb.back().first) ans++; ca--, cb--; continue; } int pa = ca, pb = cb; while (ca >= mxa || cb >= mxb) { if (ca >= mxa) { if (!froma[ca].empty()){ mxb = min(mxb, *froma[ca].begin()); for (auto x : froma[ca]) fromb[x].erase(ca); } ca--; } if (cb >= mxb) { if (!fromb[cb].empty()) { mxa = min(mxa, *fromb[cb].begin()), res[id[make_pair(mxa, cb)]] = 1; for (auto x : fromb[cb]) froma[x].erase(cb); } cb--; } } cmpa.push_back({mxa, pa}); cmpb.push_back({mxb, pb}); } while (ca >= 1){ if (cmpa.empty() || ca < cmpa.back().first) ans++; ca--; } while (cb >= 1){ if (cmpb.empty() || cb < cmpb.back().first) ans++; cb--; } ans += cmpa.size(); cout << ans << "\n"; for (auto x : res) cout << x << " "; cout << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...