제출 #228243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228243		VEGAnn	Teoretičar (COCI18_teoreticar)	C++14	0 / 130	12095 ms	91144 KiB

teoreticar

#include <bits/stdc++.h>
#define pii pair<int,int>
#define ft first
#define sd second
#define MP make_pair
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 5010;
const int M = 500100;
const int oo = 2e9;
int col[M], l, r, mrk[2][N][N], m, ans = oo, nm[M], mem[M], x[M], y[M], tt = 0;

mt19937 rnd(chrono::system_clock().now().time_since_epoch().count());

void potential(){
    shuffle(nm, nm + m, rnd);

    int cur = 0;

    tt++;

    for (int it = 0; it < m; it++){
        int i = nm[it];

        for (int c = 0; ; c++)
            if (mrk[0][x[i]][c] < tt && mrk[1][y[i]][c] < tt){
                col[i] = c;
                cur = max(cur, c);
                mrk[0][x[i]][c] = mrk[1][y[i]][c] = tt;
                break;
            }
    }

    if (ans > cur){
        ans = cur;

        for (int i = 0; i < m; i++)
            mem[i] = col[i];
    }
}

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

    cin >> l >> r >> m;

    for (int i = 0; i < m; i++){
        cin >> x[i] >> y[i];
        x[i]--; y[i]--;
        nm[i] = i;
    }

    for (int it = 0; it < 10000; it++)
        potential();

    cout << ans + 1 << '\n';

    for (int i = 0; i < m; i++)
        cout << mem[i] + 1 << '\n';

    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