oj.uz

Submission #968239

# Submission time Handle Problem Language Result Execution time Memory
968239 2024-04-23T08:38:41 Z steveonalex Last supper (IOI12_supper) C++17
43 / 100
 242 ms 15792 KB 
#include <bits/stdc++.h>
#include "advisor.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void ComputeAdvice(int *C, int n, int k, int m){
    vector<vector<int>> color(n);
    for(int i = 0; i<n; ++i) color[C[i]].push_back(i);
    for(int i = 0; i<n; ++i) color[i].push_back(n);
    set<pair<int, int>> S;
    for(int i = 0; i<k; ++i) S.insert({color[i][0], i});

    vector<int> oo;
    for(int i = 0; i<n; ++i){
        auto it = S.begin();
        if ((*it).first == i){
            pair<int, int> y = *it;
            S.erase(it);
            S.insert({*upper_bound(ALL(color[C[i]]), i), y.second});
        }
        else{
            pair<int, int> y = *S.rbegin();
            S.erase(y);
            oo.push_back(y.second);
            S.insert({*upper_bound(ALL(color[C[i]]), i), y.second});
        }
    }

    const int LOG_N = logOf(k * 2);
    for(int i: oo){
        for(int j = 0; j < LOG_N; ++j){
            WriteAdvice(i % 2);
            i /= 2;
        }
    }
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int C[] = {2, 0, 3, 0};

//     ComputeAdvice(C, 4, 2, 1000);

//     return 0;
// }
#include <bits/stdc++.h>
#include "assistant.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void Assist(unsigned char *A, int n, int k, int r){
    const int LOG_N = logOf(k * 2);
    vector<int> oo;
    for(int i = 0; i < r; i += LOG_N){
        int cur = 0;
        for(int j = 0; j < LOG_N; ++j) if (A[i+j]){
            cur += MASK(j);
        }
        oo.push_back(cur);
    }

    vector<int> scaffold(k);
    set<int> S;
    for(int i= 0; i<k; ++i) {
        scaffold[i] = i;
        S.insert(i);
    }

    reverse(ALL(oo));
    for(int i = 0; i<n; ++i){
        int j = GetRequest();
        if (S.find(j) == S.end()){
            int k = oo.back(); oo.pop_back();
            S.erase(scaffold[k]);
            PutBack(scaffold[k]);
            scaffold[k] = j;
            S.insert(scaffold[k]);
        }
        else{

        }
    }
}
// void PutBack(int T);
// int GetRequest();


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     return 0;
// }

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 788 KB Output is correct
2 Correct 0 ms 788 KB Output is correct
3 Correct 1 ms 780 KB Output is correct
4 Correct 3 ms 1328 KB Output is correct
5 Correct 3 ms 1080 KB Output is correct
6 Correct 9 ms 1400 KB Output is correct
7 Correct 4 ms 1600 KB Output is correct
8 Correct 9 ms 1420 KB Output is correct
9 Correct 9 ms 1416 KB Output is correct
10 Correct 7 ms 1396 KB Output is correct
11 Correct 7 ms 1400 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2012 KB Output is correct
2 Correct 71 ms 5868 KB Output is correct
3 Correct 242 ms 15716 KB Output is correct
4 Correct 134 ms 11312 KB Output is correct
5 Correct 193 ms 12364 KB Output is correct
6 Correct 211 ms 12608 KB Output is correct
7 Correct 193 ms 13100 KB Output is correct
8 Correct 191 ms 13332 KB Output is correct
9 Correct 97 ms 10464 KB Output is correct
10 Correct 197 ms 13616 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 10932 KB Output is correct
2 Correct 185 ms 13728 KB Output is correct
3 Correct 192 ms 13136 KB Output is correct
4 Correct 179 ms 12960 KB Output is correct
5 Correct 146 ms 11964 KB Output is correct
6 Correct 193 ms 13464 KB Output is correct
7 Correct 180 ms 13384 KB Output is correct
8 Correct 228 ms 15792 KB Output is correct
9 Correct 121 ms 12288 KB Output is correct
10 Correct 192 ms 13384 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1048 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 192 ms 13064 KB Output is partially correct - 772365 bits used
2 Correct 189 ms 13284 KB Output is partially correct - 742095 bits used
3 Correct 206 ms 13568 KB Output is partially correct - 712470 bits used
4 Correct 185 ms 13472 KB Output is partially correct - 712005 bits used
5 Correct 193 ms 13736 KB Output is partially correct - 710610 bits used
6 Correct 185 ms 13468 KB Output is partially correct - 712155 bits used
7 Correct 186 ms 13368 KB Output is partially correct - 711090 bits used
8 Correct 191 ms 13452 KB Output is partially correct - 713340 bits used
9 Correct 186 ms 13452 KB Output is partially correct - 712830 bits used
10 Correct 241 ms 15568 KB Output is partially correct - 1117620 bits used