oj.uz

Submission #228245

# Submission time Handle Problem Language Result Execution time Memory
228245 2020-04-30T09:20:56 Z VEGAnn Teoretičar (COCI18_teoreticar) C++14
0 / 130
 12000 ms 90864 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 = 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 < 1000000; it++)
        potential();

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

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

    return 0;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4878 ms 540 KB Output is correct
2 Correct 5011 ms 736 KB Output is correct
3 Correct 4083 ms 856 KB Output is correct
4 Incorrect 3105 ms 512 KB too many colors
5 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4413 ms 768 KB Output is correct
2 Correct 4735 ms 888 KB Output is correct
3 Correct 3627 ms 912 KB Output is correct
4 Incorrect 3222 ms 888 KB too many colors
5 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12019 ms 20480 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12010 ms 12472 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 102 ms 8824 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 107 ms 8876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 123 ms 12512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12063 ms 25236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12089 ms 90864 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 12049 ms 90796 KB Time limit exceeded
2 Halted 0 ms 0 KB -