oj.uz

Submission #855776

# Submission time Handle Problem Language Result Execution time Memory
855776 2023-10-01T19:07:37 Z vjudge1 Teoretičar (COCI18_teoreticar) C++17
0 / 130
 4518 ms 90128 KB 
//author: Ahmet Alp Orakci
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

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

    vector <vector <pair <int, int>>> adj[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);
        adj[1][v].emplace_back(u, 0);
    }

    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;
                auto it = find(adj[gr ^ 1][child].begin(), adj[gr ^ 1][child].end(), pair <int, int> {node, 0});
                it->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.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1368 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 856 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 741 ms 90128 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 706 ms 90068 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4518 ms 51608 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 944 ms 47400 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 840 ms 36464 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1077 ms 36312 KB not colored properly
2 Halted 0 ms 0 KB -