제출 #257013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
257013		mohamedsobhi777	Teoretičar (COCI18_teoreticar)	C++14	26 / 130	12083 ms	262148 KiB

teoreticar

#include <bits/stdc++.h>

using namespace std;

const int N = 1e2 + 7;

int l, r, m;

vector<pair<int, int>> e;
map<pair<int, int>, int> cols;

bool check(int x)
{
        map<int, int> chs[x + 1];
        for (auto u : e)
        {
                bool ok = 0;
                for (int j = 0; j < x; j++)
                {
                        if (!(chs[j][u.first] | chs[j][u.second]))
                        {
                                ok = 1;
                                cols[u] = j + 1;
                                chs[j][u.first] = chs[j][u.second] = 1;
                                break;
                        }
                }
                if (!ok)
                        return 0;
        }
        return 1;
}

int main()
{
        ios_base::sync_with_stdio(0);
        cin.tie();
        //freopen("in.in", "r", stdin);

        cin >> l >> r >> m;

        for (int i = 0; i < m; i++)
        {
                int u, v;
                cin >> u >> v;
                v += l;
                e.push_back({u, v});
        }

        int lo = 1, hi = m;
        int ans = 0;
        for (; lo <= hi;)
        {
                int mid = (lo + hi) >> 1;
                if (check(mid))
                {
                        ans = mid;
                        hi = mid - 1;
                }
                else
                {
                        lo = mid + 1;
                }
        }
        cout << ans << '\n';
        for (auto u : e)
        {
                cout << cols[u] << "\n";
        }

        return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 13 / 13
• Subtask 3: 0 / 13
• Subtask 4: 13 / 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