oj.uz

답안 #768097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768097 2023-06-27T12:59:40 Z boris_mihov 최후의 만찬 (IOI12_supper) C++17
0 / 100
 12 ms 3844 KB 
#include "advisor.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>

typedef long long llong;
const int MAXN = 100000 + 10;
const int MAXLOG = 17;
const int INF  = 1e9;

int n, k;
struct BIT
{
    int tree[MAXN];
    void update(int idx, int val)
    {
        for (int pos = idx ; pos <= n ; pos += pos & (-pos))
        {
            tree[pos] += val;
        }
    }

    int query(int idx)
    {
        int res = 0;
        for (int pos = idx ; pos > 0 ; pos -= pos & (-pos))
        {
            res += tree[pos];
        }

        return res;
    }
    
    int findKth(int k)
    {
        int pos = 0;
        for (int log = MAXLOG - 1 ; log >= 0 ; --log)
        {
            if (pos + (1 << log) <= n && tree[pos + (1 << log)] < k)
            {
                pos += (1 << log);
                k -= tree[pos];
            }
        }

        return pos + 1;
    }
};

int logK;
int c[MAXN];
bool in[MAXN];
int last[MAXN];
int next[MAXN];
std::priority_queue <std::pair <int,int>> pq;
BIT tree;

void ComputeAdvice(int *C, int N, int K, int M) 
{
    n = N;
    k = K;
    while ((1 << logK + 1) <= k) logK++;

    for (int i = 1 ; i <= n ; ++i)
    {
        last[i] = n + 1;
    }

    for (int i = n ; i >= 1 ; --i)
    {
        c[i] = C[i - 1] + 1;
        next[i] = last[c[i]];
        last[c[i]] = i;
    }

    for (int i = 1 ; i <= k ; ++i)
    {
        in[i] = true;
        pq.push({last[i], i});
        tree.update(i, 1);
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        if (in[c[i]])
        {
            continue;
        }

        auto [val, col] = pq.top();
        pq.pop();

        int curr = tree.query(col);
        for (int bit = logK ; bit >= 0 ; --bit)
        {
            WriteAdvice(curr & (1 << bit));
        }

        tree.update(col, -1);
        tree.update(c[i], 1);
        in[col] = false;
        in[c[i]] = true;
        pq.push({next[i], c[i]});
    }
}

#include "assistant.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>

typedef long long llong;
const int MAXN = 100000 + 10;
const int MAXLOG = 17;
const int INF  = 1e9;

int N, K;
struct BIT2
{
    int tree[MAXN];
    void update(int idx, int val)
    {
        for (int pos = idx ; pos <= N ; pos += pos & (-pos))
        {
            tree[pos] += val;
        }
    }

    int query(int idx)
    {
        int res = 0;
        for (int pos = idx ; pos > 0 ; pos -= pos & (-pos))
        {
            res += tree[pos];
        }

        return res;
    }
    
    int findKth(int k)
    {
        int pos = 0;
        for (int log = MAXLOG - 1 ; log >= 0 ; --log)
        {
            if (pos + (1 << log) <= N && tree[pos + (1 << log)] < k)
            {
                pos += (1 << log);
                k -= tree[pos];
            }
        }

        return pos + 1;
    }
};

int logK2;
bool in2[MAXN];
BIT2 tree2;

void Assist(unsigned char *A, int _N, int _K, int R) 
{
    N = _N; K = _K;
    while ((1 << logK2 + 1) <= K) logK2++;
    for (int i = 1 ; i <= K ; ++i)
    {
        in2[i] = true;
        tree2.update(i, 1);
    }

    int ptr = 0;
    for (int i = 1 ; i <= N ; ++i)
    {
        int curr = GetRequest() + 1;
        if (in2[curr])
        {
            continue;
        }

        int toRemove = 0;

        for (int j = 0 ; j <= logK2 ; ++j)
        {
            toRemove *= 2;
            toRemove += A[ptr++];
        }

        toRemove = tree2.findKth(toRemove);
        PutBack(toRemove - 1);
        tree2.update(toRemove, -1);
        tree2.update(curr, 1);
        in2[toRemove] = false;
        in2[curr] = true;        
    }
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:65:23: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   65 |     while ((1 << logK + 1) <= k) logK++;
      |                  ~~~~~^~~

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:60:24: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   60 |     while ((1 << logK2 + 1) <= K) logK2++;
      |                  ~~~~~~^~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 516 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 944 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 3296 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 660 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 3844 KB Error - advice must be 0 or 1
2 Incorrect 9 ms 3784 KB Error - advice must be 0 or 1
3 Incorrect 9 ms 3772 KB Error - advice must be 0 or 1
4 Incorrect 9 ms 3772 KB Error - advice must be 0 or 1
5 Incorrect 9 ms 3768 KB Error - advice must be 0 or 1
6 Incorrect 9 ms 3768 KB Error - advice must be 0 or 1
7 Incorrect 12 ms 3732 KB Error - advice must be 0 or 1
8 Incorrect 9 ms 3784 KB Error - advice must be 0 or 1
9 Incorrect 9 ms 3776 KB Error - advice must be 0 or 1
10 Incorrect 9 ms 3804 KB Error - advice must be 0 or 1