Submission #555250

#TimeUsernameProblemLanguageResultExecution timeMemory
555250snasibov05Usmjeravanje (COCI22_usmjeravanje)C++14
0 / 110
0 ms212 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<int> res(m); int ca = a, cb = b; while (ca >= 1 || cb >= 1){ if (froma[ca].empty()) { ans++; ca--; continue; } if (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; } while (ca >= mxa || cb >= mxb) { if (cb >= mxb) { if (!fromb[cb].empty()) { mxa = min(mxa, *fromb[cb].begin()); if (mxa == *fromb[cb].begin()) res[id[make_pair(mxa, cb)]] = 1; } cb--; } if (ca >= mxa) { if (!froma[ca].empty()) mxb = min(mxb, *froma[ca].begin()); ca--; } } ans++; } 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...