oj.uz

Submission #768112

# Submission time Handle Problem Language Result Execution time Memory
768112 2023-06-27T13:17:25 Z boris_mihov Last supper (IOI12_supper) C++17
43 / 100
 232 ms 13084 KB 
#include "advisor.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <set>

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 last2[MAXN];
int next[MAXN];
std::set <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;
        last2[i] = last[i];
        pq.insert({last[i], i});
        tree.update(i, 1);
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        if (in[c[i]])
        {
            pq.erase(pq.find({last2[c[i]], c[i]}));
            last2[c[i]] = next[i];
            pq.insert({next[i], c[i]});
            continue;
        }

        auto [val, col] = *(pq.rbegin());
        pq.erase(pq.find(*pq.rbegin()));
        int curr = tree.query(col);

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

        tree.update(col, -1);
        tree.update(c[i], 1);
        in[col] = false;
        in[c[i]] = true;
        pq.insert({next[i], c[i]});
        last2[c[i]] = next[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;
            assert(A[ptr] == 0 || A[ptr] == 1);
            toRemove += A[ptr++];
        }

        toRemove++;
        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:67:23: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   67 |     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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 520 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 1 ms 684 KB Output is correct
4 Correct 3 ms 792 KB Output is correct
5 Correct 4 ms 928 KB Output is correct
6 Correct 7 ms 976 KB Output is correct
7 Correct 4 ms 932 KB Output is correct
8 Correct 9 ms 1116 KB Output is correct
9 Correct 9 ms 1120 KB Output is correct
10 Correct 6 ms 1088 KB Output is correct
11 Correct 7 ms 1100 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1460 KB Output is correct
2 Correct 66 ms 4628 KB Output is correct
3 Correct 204 ms 12380 KB Output is correct
4 Correct 131 ms 8492 KB Output is correct
5 Correct 178 ms 10620 KB Output is correct
6 Correct 194 ms 10984 KB Output is correct
7 Correct 172 ms 10772 KB Output is correct
8 Correct 173 ms 11000 KB Output is correct
9 Correct 98 ms 7244 KB Output is correct
10 Correct 172 ms 10444 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 8588 KB Output is correct
2 Correct 175 ms 10668 KB Output is correct
3 Correct 170 ms 10452 KB Output is correct
4 Correct 151 ms 10100 KB Output is correct
5 Correct 128 ms 8860 KB Output is correct
6 Correct 161 ms 10584 KB Output is correct
7 Correct 157 ms 10272 KB Output is correct
8 Correct 218 ms 13084 KB Output is correct
9 Correct 102 ms 8572 KB Output is correct
10 Correct 163 ms 10564 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
17.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 10648 KB Output is partially correct - 772365 bits used
2 Correct 166 ms 10620 KB Output is partially correct - 742095 bits used
3 Correct 160 ms 10444 KB Output is partially correct - 712470 bits used
4 Correct 176 ms 10524 KB Output is partially correct - 712005 bits used
5 Correct 161 ms 10496 KB Output is partially correct - 710610 bits used
6 Correct 165 ms 10524 KB Output is partially correct - 712155 bits used
7 Correct 163 ms 10924 KB Output is partially correct - 711090 bits used
8 Correct 162 ms 10512 KB Output is partially correct - 713340 bits used
9 Correct 162 ms 10540 KB Output is partially correct - 712830 bits used
10 Correct 232 ms 13068 KB Output is partially correct - 1117620 bits used