oj.uz

Submission #962260

# Submission time Handle Problem Language Result Execution time Memory
962260 2024-04-13T09:49:46 Z GrindMachine Last supper (IOI12_supper) C++17
34 / 100
 411 ms 83036 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "advisor.h"

void ComputeAdvice(int *a, int n, int k, int m) {
    // WriteAdvice(0);
    // WriteAdvice(1);
    // WriteAdvice(2);

    int B = 0;
    while((1<<B) <= k) B++;

    queue<int> q[n];
    rep(i,n) q[a[i]].push(i);
    rep(i,n) q[i].push(inf1);

    set<array<int,3>> st;
    vector<int> pos(n,-1);
    rep(i,k){
        st.insert({q[i].front(),i,i});
        pos[i] = i;
    }

    rep(i,n){
        int c = a[i];
        q[c].pop();
        int p = -1;

        if(pos[c] != -1){
            st.erase({i,c,pos[c]});
            st.insert({q[c].front(),c,pos[c]});           
        }
        else{
            auto ar = *st.rbegin();
            st.erase(ar);
            p = pos[c] = pos[ar[1]];
            pos[ar[1]] = -1;
            st.insert({q[c].front(),c,pos[c]});
        }

        // write p+1
        p++;
        rep(bit,B){
            int f = 1<<(B-bit-1);
            int b = 0;
            if(p&f) b = 1;
            WriteAdvice(b);
        }
    }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "assistant.h"

void Assist(unsigned char *a, int n, int k, int m) {
    // int i;
    // for (i = 0; i < N; i++) {
    //     int req = GetRequest();
    //     if (req >= K)
    //       PutBack(req % K);
    // }

    int B = 0;
    while((1<<B) <= k) B++;

    vector<int> curr(k);
    rep(i,k) curr[i] = i;
    int ptr = 0;

    rep(i,n){
        int c = GetRequest();
        int p = 0;
        rep(iter,B){
            int b = a[ptr++];
            p = (p<<1)|b;
        }

        p--;
        if(p != -1){
            PutBack(curr[p]);
            curr[p] = c;
        }
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 796 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 3 ms 1576 KB Output is correct
4 Correct 4 ms 2932 KB Output is correct
5 Correct 4 ms 4176 KB Output is correct
6 Correct 9 ms 4484 KB Output is correct
7 Correct 10 ms 4512 KB Output is correct
8 Correct 11 ms 4624 KB Output is correct
9 Correct 12 ms 4512 KB Output is correct
10 Correct 16 ms 4644 KB Output is correct
11 Correct 12 ms 4660 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8524 KB Output is correct
2 Correct 146 ms 39900 KB Output is correct
3 Correct 343 ms 83036 KB Output is correct
4 Correct 170 ms 74736 KB Output is correct
5 Correct 237 ms 77180 KB Output is correct
6 Correct 302 ms 79368 KB Output is correct
7 Correct 336 ms 81712 KB Output is correct
8 Correct 272 ms 69452 KB Output is correct
9 Correct 130 ms 72144 KB Output is correct
10 Correct 327 ms 82044 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 65664 KB Output is correct
2 Correct 323 ms 81636 KB Output is correct
3 Correct 332 ms 81788 KB Output is correct
4 Correct 329 ms 81868 KB Output is correct
5 Correct 307 ms 80740 KB Output is correct
6 Correct 331 ms 81684 KB Output is correct
7 Correct 341 ms 81860 KB Output is correct
8 Correct 321 ms 81692 KB Output is correct
9 Correct 311 ms 81888 KB Output is correct
10 Correct 318 ms 81792 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
8.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 81512 KB Output is partially correct - 1500000 bits used
2 Correct 320 ms 81532 KB Output is partially correct - 1500000 bits used
3 Correct 341 ms 81876 KB Output is partially correct - 1500000 bits used
4 Correct 411 ms 82000 KB Output is partially correct - 1500000 bits used
5 Correct 371 ms 81788 KB Output is partially correct - 1500000 bits used
6 Correct 356 ms 81756 KB Output is partially correct - 1500000 bits used
7 Correct 350 ms 81512 KB Output is partially correct - 1497585 bits used
8 Correct 368 ms 81924 KB Output is partially correct - 1500000 bits used
9 Correct 347 ms 81564 KB Output is partially correct - 1500000 bits used
10 Correct 391 ms 81744 KB Output is partially correct - 1500000 bits used