oj.uz

Submission #288060

# Submission time Handle Problem Language Result Execution time Memory
288060 2020-09-01T08:22:29 Z 2qbingxuan Last supper (IOI12_supper) C++14
0 / 100
 330 ms 10844 KB 
#include "advisor.h"
#include <bits/stdc++.h>
#ifdef local
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> void qqbx(const char *s, const H& h, T &&...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr(sizeof...(T)) qqbx(++s, args...);
}
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local

using namespace std;

void ComputeAdvice(int *C, int n, int k, int m) {
    int L = __lg(n-1)+1;
    auto W = [&](int x) -> void {
        for(int i = L-1; i >= 0; i--) WriteAdvice(x >> i & 1);
    };
    vector<bool> ok(n);
    for(int i = 0; i < k; i++) ok[i] = true;
    vector<int> nxt(n), last(n, n);
    for(int i = n-1; i >= 0; i--) {
        nxt[i] = last[C[i]];
        last[C[i]] = i;
    }
    priority_queue<pair<int,int>> pq;
    for(int i = 0; i < k; i++) pq.push({last[i], i});
    for(int i = 0; i < n; i++) {
        int r = C[i];
        if(!ok[r]) {
            int x = pq.top().second; pq.pop();
            W(x);
            ok[x] = false;
            ok[r] = true;
            pq.push({nxt[i], r});
        }
    }
}

#include "assistant.h"
#include <bits/stdc++.h>
#ifdef local
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> void qqbx(const char *s, const H& h, T &&...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr(sizeof...(T)) qqbx(++s, args...);
}
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local

using namespace std;

void Assist(unsigned char *A, int n, int k, int len) {
    int L = __lg(n-1)+1;
    int p = 0;
    auto nextint = [&]() -> int {
        int res = 0;
        for(int i = 0; i < L; i++) {
            res = res * 2 + A[p++];
        }
        assert(p <= len);
        return res;
    };
    vector<bool> ok(n);
    for(int i = 0; i < k; i++) ok[i] = true;
    for(int i = 0; i < n; i++) {
        int r = GetRequest();
        if(!ok[r]) {
            int x = nextint();
            PutBack(x);
            ok[x] = false;
            ok[r] = true;
        }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 776 KB Output is correct
2 Incorrect 1 ms 780 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 1820 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 227 ms 7864 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1096 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 299 ms 10264 KB Output isn't correct - not an optimal way
2 Incorrect 282 ms 10088 KB Output isn't correct - not an optimal way
3 Incorrect 266 ms 9280 KB Output isn't correct - not an optimal way
4 Incorrect 268 ms 9420 KB Output isn't correct - not an optimal way
5 Incorrect 276 ms 9284 KB Output isn't correct - not an optimal way
6 Incorrect 266 ms 9416 KB Output isn't correct - not an optimal way
7 Incorrect 269 ms 9300 KB Output isn't correct - not an optimal way
8 Incorrect 275 ms 9412 KB Output isn't correct - not an optimal way
9 Incorrect 278 ms 9340 KB Output isn't correct - not an optimal way
10 Correct 330 ms 10844 KB Output is partially correct - 1266636 bits used