제출 #228231

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228231		VEGAnn	Teoretičar (COCI18_teoreticar)	C++14	13 / 130	17 ms	896 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;
int col[N], l, r, mrk[2][N][N], m, ans = 0;

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

    cin >> l >> r >> m;

    assert(l <= 100 && r <= 100);

    for (int i = 0; i < m; i++){
        int x, y;

        cin >> x >> y;
        x--; y--;

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

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

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

    return 0;
}

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