제출 #227930

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

teoreticar

#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;

int a, b, m, kl[N], v[N], u[N], mx;
set <int> se[N];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    in("input.txt");

    cin >> a >> b >> m;

    for (int i = 0; i < m; i++)
        cin >> v[i] >> u[i], v[i]--, u[i]--, kl[v[i]]++, kl[a + u[i]]++;

    for (int i = 0; i < a + b; i++)
        mx = max(mx, kl[i]);

    int lg = 0;

    while ((1 << lg) < mx)
        lg++;

    mx = (1 << lg);

    for (int i = 0; i < a + b; i++)
    for (int j = 1; j <= mx; j++)
        se[i].insert(j);

    cout << mx << el;

    for (int i = 0; i < m; i++) {
        for (set <int> :: iterator it = se[v[i]].begin(); it != se[v[i]].end(); it++)
            if (se[a + u[i]].find(*it) != se[a + u[i]].end()) {
                cout << (*it) << el;
                se[a + u[i]].erase(se[a + u[i]].find(*it));
                se[v[i]].erase(it);
                break;
            }
    }
}

• 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