oj.uz

Submission #307214

# Submission time Handle Problem Language Result Execution time Memory
307214 2020-09-27T11:06:53 Z tincamatei Handcrafted Gift (IOI20_gift) C++14
100 / 100
 217 ms 16180 KB 
#include "gift.h"

const int MAX_N = 500000;
int sef[MAX_N];

int myfind(int x) {
    if(x == sef[x])
        return x;
    sef[x] = myfind(sef[x]);
    return sef[x];
}

void myunion(int a, int b) {
    int sa = myfind(a), sb = myfind(b);

    if(sa != sb)
        sef[sb] = sa;
}

int construct(int n, int r, std::vector<int> a, std::vector<int> b, std::vector<int> x) {
    for(int i = 0; i < n; ++i)
        sef[i] = i;

    for(int i = 0; i < r; ++i) {
        if(x[i] == 1)
            while(myfind(b[i]) > a[i])
                myunion(myfind(b[i]) - 1, myfind(b[i]));
    }

    for(int i = 0; i < r; ++i)
        if(x[i] == 2 && myfind(b[i]) <= a[i])
            return 0;

    std::string res;
    char color = 'R';

    for(int i = 0; i < n; ++i) {
        if(myfind(i) == i)
            color = 'R' + 'B' - color;
        res.push_back(color);
    }

    craft(res);

    return 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 188 ms 15252 KB Output is correct
6 Correct 186 ms 15152 KB Output is correct
7 Correct 216 ms 16180 KB Output is correct
8 Correct 214 ms 16176 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 199 ms 15152 KB Output is correct
5 Correct 196 ms 15152 KB Output is correct
6 Correct 188 ms 14072 KB Output is correct
7 Correct 193 ms 14072 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 188 ms 15252 KB Output is correct
6 Correct 186 ms 15152 KB Output is correct
7 Correct 216 ms 16180 KB Output is correct
8 Correct 214 ms 16176 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 199 ms 15152 KB Output is correct
13 Correct 196 ms 15152 KB Output is correct
14 Correct 188 ms 14072 KB Output is correct
15 Correct 193 ms 14072 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 9 ms 3664 KB Output is correct
36 Correct 8 ms 3536 KB Output is correct
37 Correct 19 ms 4428 KB Output is correct
38 Correct 208 ms 15408 KB Output is correct
39 Correct 202 ms 14072 KB Output is correct
40 Correct 217 ms 15152 KB Output is correct
41 Correct 212 ms 15152 KB Output is correct
42 Correct 209 ms 15412 KB Output is correct