oj.uz

답안 #228264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228264 2020-04-30T10:06:48 Z VEGAnn Teoretičar (COCI18_teoreticar) C++14
65 / 130
 12000 ms 71224 KB 
#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 = 100100;
const int M = 500100;
const int oo = 2e9;
unordered_set<int> mrk[2][N];
int col[M], l, r, m, ans = oo, nm[M], x[M], y[M], tt = 0, X, deg[2][N];

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

void potential(){
    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]].find(c) == mrk[0][x[i]].end() && mrk[1][y[i]].find(c) == mrk[1][y[i]].end()){
                col[i] = c;
                cur = max(cur, c);

                if (cur >= X) {
                    for (int jt = 0; jt < it; jt++){
                        mrk[0][x[nm[jt]]].clear();
                        mrk[1][y[nm[jt]]].clear();
                    }
                    shuffle(nm, nm + m, rnd);
                    return;
                }

                mrk[0][x[i]].insert(c);
                mrk[1][y[i]].insert(c);
                break;
            }
    }

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

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

    exit(0);
}

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]--;
        deg[0][x[i]]++;
        deg[1][y[i]]++;
        nm[i] = i;
    }

    int mex = 0;

    for (int i = 0; i < max(l, r); i++) {
        mex = max(mex, deg[0][i]);
        mex = max(mex, deg[1][i]);
    }

    X = 1;

    while (X < mex) X += X;

    for (;;)
        potential();

    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3540 ms 11412 KB Output is correct
2 Correct 11 ms 11392 KB Output is correct
3 Correct 11 ms 11392 KB Output is correct
4 Correct 12 ms 11392 KB Output is correct
5 Correct 11 ms 11392 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11348 KB Output is correct
2 Correct 12 ms 11392 KB Output is correct
3 Correct 14 ms 11392 KB Output is correct
4 Correct 12 ms 11392 KB Output is correct
5 Correct 12 ms 11392 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 12079 ms 12024 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 11904 KB Output is correct
2 Correct 15 ms 11904 KB Output is correct
3 Correct 15 ms 12032 KB Output is correct
4 Correct 16 ms 11904 KB Output is correct
5 Correct 14 ms 11648 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 12067 ms 34328 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 12076 ms 33824 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 12098 ms 35960 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2563 ms 67104 KB Output is correct
2 Correct 742 ms 67704 KB Output is correct
3 Correct 1405 ms 71224 KB Output is correct
4 Correct 709 ms 62160 KB Output is correct
5 Correct 445 ms 60024 KB Output is correct

Subtask #9
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 12101 ms 41984 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10283 ms 55292 KB Output is correct
2 Correct 11735 ms 67964 KB Output is correct
3 Correct 628 ms 69368 KB Output is correct
4 Correct 186 ms 24824 KB Output is correct
5 Correct 1040 ms 57720 KB Output is correct