Submission #855778

#	Time	Username	Problem	Language	Result	Execution time	Memory
855778		vjudge1	Teoretičar (COCI18_teoreticar)	C++17	0 / 130	2160 ms	154472 KiB

teoreticar

//author: Ahmet Alp Orakci
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define int i64

#define ONLINE_JUDGE
void solve() {
    int l, r, m;
    cin >> l >> r >> m;

    vector <vector <pair <int, int>>> adj[2];
    map <pair <int, int>, int> loc[2];
    adj[0].resize(l +1);
    adj[1].resize(r +1);

    map <pair <int, int>, int> edg;
    vector <int> ans(m +1);

    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;

        edg[{u, v}] = i;
        adj[0][u].emplace_back(v, 0);
        loc[0][{u, v}] = adj[0][u].size() -1;
        adj[1][v].emplace_back(u, 0);
        loc[1][{v, u}] = adj[1][v].size() -1;
    }

    vector <bool> vis[2];
    vis[0].resize(l +1);
    vis[1].resize(r +1);

    int res = 1;
    function <void(int, int)> dfs = [&](int gr, int node) -> void {
        if(vis[gr][node]) {
            return;
        }

        //cerr << gr << " " << node << "\n";

        vis[gr][node] = true;
        map <int, bool> mp;
        for(auto &[child, fl] : adj[gr][node]) {
            mp[fl] = true;
        }

        int ind = 1;
        for(auto &[child, fl] : adj[gr][node]) {
            if(fl == 0) {
                while(mp[ind]) 
                    ind++;
                mp[ind] = true;
                fl = ind;
                adj[gr ^ 1][child][loc[gr ^ 1][pair <int, int>{child, node}]].second = fl;
                ind++;

                if(gr == 0) {
                    ans[edg[{node, child}]] = fl;
                } else {
                    ans[edg[{child, node}]] = fl;
                }

                //cerr << gr << " " << node << " " << child << " " << fl << "\n";
                dfs(gr ^ 1, child);
            }
        }

        res = max(res, ind -1);
    };

    for(int i = 1; i <= l; i++) {
        dfs(0, i);
        //cerr << "\n";
    }

    for(int j = 1; j <= r; j++) {
        dfs(1, j);
        //cerr << "\n";
    }

    cout << res << "\n";
    for(int i = 1; i <= m; i++) {
        cout << ans[i] << "\n";
    }
    
    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen(".in", "r", stdin);
        freopen(".out", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int t = 1; //cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 13
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13
• Subtask 9: 0 / 13
• Subtask 10: 0 / 13