oj.uz

Submission #775212

# Submission time Handle Problem Language Result Execution time Memory
775212 2023-07-06T08:46:12 Z cheat_when_I_was_young Shopping (JOI21_shopping) C++17
10 / 100
 92 ms 608 KB 
#include "Anna.h"
#include "bits/stdc++.h"
using namespace std;

int n, l, r, ans;

void InitA(int N, int L, int R) {
    n = N;
    l = L;
    r = R;
    int st, en;
    if (n < (1<<19)) {
        st = 0;
        en = 17;
    } else {
        l -= l % 4;
        st = 2;
        en = 19;
    }
    for (int i = st; i <= en; ++i) SendA((l >> i) & 1);
}

void ReceiveA(bool x) {
    if (l <= r && x) ans = l;
    ++l;
}

int Answer() {
    return ans;
}

#include "Bruno.h"
#include "bits/stdc++.h"
using namespace std;

int n, l, cnt, stop = 18, ans = 2e9;
vector<int> p;

void InitB(int N, vector<int> P) {
    n = N;
    p = P;
    if (n >= (1<<19)) {
        cnt = 2;
        stop = 20;
    }
}

void ReceiveB(bool y) {
    if (y) l |= 1 << cnt;
    ++cnt;
    if (cnt < stop) return;
    for (int i = l; i < n; ++i) {
        if (ans <= p[i]) {
            SendB(0);
            continue;
        }
        ans = p[i];
        SendB(1);
    }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 400 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 0 ms 400 KB Output is correct
4 Correct 0 ms 400 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 7 ms 476 KB Output is correct
7 Correct 6 ms 400 KB Output is correct
8 Correct 6 ms 400 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 6 ms 400 KB Output is correct
11 Correct 9 ms 400 KB Output is correct
12 Correct 5 ms 400 KB Output is correct
13 Correct 6 ms 400 KB Output is correct
14 Correct 6 ms 400 KB Output is correct
15 Correct 6 ms 400 KB Output is correct
16 Correct 5 ms 400 KB Output is correct
17 Correct 9 ms 400 KB Output is correct
18 Correct 6 ms 400 KB Output is correct
19 Correct 6 ms 400 KB Output is correct
20 Correct 5 ms 400 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 400 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 0 ms 400 KB Output is correct
4 Correct 0 ms 400 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 7 ms 476 KB Output is correct
7 Correct 6 ms 400 KB Output is correct
8 Correct 6 ms 400 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 6 ms 400 KB Output is correct
11 Correct 9 ms 400 KB Output is correct
12 Correct 5 ms 400 KB Output is correct
13 Correct 6 ms 400 KB Output is correct
14 Correct 6 ms 400 KB Output is correct
15 Correct 6 ms 400 KB Output is correct
16 Correct 5 ms 400 KB Output is correct
17 Correct 9 ms 400 KB Output is correct
18 Correct 6 ms 400 KB Output is correct
19 Correct 6 ms 400 KB Output is correct
20 Correct 5 ms 400 KB Output is correct
21 Correct 51 ms 608 KB Output is correct
22 Correct 71 ms 608 KB Output is correct
23 Correct 62 ms 588 KB Output is correct
24 Correct 32 ms 604 KB Output is correct
25 Correct 53 ms 604 KB Output is correct
26 Correct 78 ms 528 KB Output is correct
27 Correct 24 ms 528 KB Output is correct
28 Correct 53 ms 596 KB Output is correct
29 Correct 69 ms 588 KB Output is correct
30 Correct 46 ms 592 KB Output is correct
31 Correct 15 ms 584 KB Output is correct
32 Correct 72 ms 588 KB Output is correct
33 Correct 33 ms 588 KB Output is correct
34 Correct 42 ms 608 KB Output is correct
35 Correct 5 ms 604 KB Output is correct
36 Correct 21 ms 596 KB Output is correct
37 Correct 92 ms 588 KB Output is correct

Subtask #3
0 / 90.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 276 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -