oj.uz

답안 #288084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288084 2020-09-01T08:37:54 Z 2qbingxuan 최후의 만찬 (IOI12_supper) C++14
0 / 100
 460 ms 14776 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);
    };
    for(int i = 0; i < n; i++) W(C[i]);
    /*
    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 + int(A[p++]);
        }
        assert(p <= len);
        return res;
    };
    vector<int> C(n);
    for(int i = 0; i < n; i++) C[i] = nextint();

    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 = GetRequest();
        assert(r == C[i]);
        if(!ok[r]) {
            int x = pq.top().second; pq.pop();
            PutBack(x);
            ok[x] = false;
            ok[r] = true;
            pq.push({nxt[i], r});
        }
    }
    /*
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 784 KB Output is correct
2 Incorrect 2 ms 644 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 2136 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 354 ms 11872 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1020 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 460 ms 14652 KB Output isn't correct - not an optimal way
2 Incorrect 431 ms 14548 KB Output isn't correct - not an optimal way
3 Incorrect 429 ms 14720 KB Output isn't correct - not an optimal way
4 Incorrect 421 ms 14700 KB Output isn't correct - not an optimal way
5 Incorrect 430 ms 14696 KB Output isn't correct - not an optimal way
6 Incorrect 427 ms 14776 KB Output isn't correct - not an optimal way
7 Incorrect 423 ms 14696 KB Output isn't correct - not an optimal way
8 Incorrect 428 ms 14676 KB Output isn't correct - not an optimal way
9 Incorrect 426 ms 14708 KB Output isn't correct - not an optimal way
10 Correct 427 ms 14772 KB Output is partially correct - 1700000 bits used