제출 #555244

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
555244		snasibov05	Usmjeravanje (COCI22_usmjeravanje)	C++14	0 / 110	0 ms	212 KiB

Main

#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 (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());
                    if (mxa == *fromb[cb].begin()) res[id[make_pair(mxa, cb)]] = 1;
                    for (auto x : fromb[cb]) froma[x].erase(cb);
                }
                cb--;
            }
        }

        ans++;
    }

    while (ca >= 1) ans++, ca--;
    while (cb >= 1) ans++, cb--;

    cout << ans << "\n";
    for (auto x : res) cout << x << " ";
    cout << "\n";

    return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 60