oj.uz

Submission #439131

# Submission time Handle Problem Language Result Execution time Memory
439131 2021-06-29T09:18:52 Z elazarkoren Rack (eJOI19_rack) C++17
40 / 100
 1000 ms 98768 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;

struct Tree{
    int val = 0, l, r;
    Tree *lp, *rp;
    Tree(int l, int r): l(l), r(r) {
        if (l + 1 != r) {
            lp = new Tree(l, (l + r) / 2);
            rp = new Tree((l + r) / 2, r);
        }
    }
    int query() {
        if (l + 1 == r) {
//            if (val) return -1;
            val = 1;
            return l;
        }
        val++;
        if (lp->val == rp->val) return lp->query();
        return rp->query();
    }
};

int main() {
    int n, k;
    cin >> n >> k;
    Tree t(1, (1 << n) + 1);
    for (int i = 0; i < k - 1; i++){
        t.query();
    }
    cout << t.query();
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 972 KB Output is correct
8 Correct 26 ms 6348 KB Output is correct
9 Correct 188 ms 24896 KB Output is correct
10 Correct 447 ms 98768 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 972 KB Output is correct
8 Correct 26 ms 6348 KB Output is correct
9 Correct 188 ms 24896 KB Output is correct
10 Correct 447 ms 98768 KB Output is correct
11 Execution timed out 1078 ms 292 KB Time limit exceeded
12 Halted 0 ms 0 KB -