oj.uz

답안 #968524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968524 2024-04-23T14:23:50 Z steveonalex 최후의 만찬 (IOI12_supper) C++17
0 / 100
 127 ms 13900 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});
            oo.push_back(y.second);
        }
        else{
            auto it = S.end();
            it--;
            if (it != S.begin()){
                it--;
                if ((*it).first < i + k) it++; 
            }
            pair<int, int> y = *it;
            S.erase(y);
            oo.push_back(y.second);
            S.insert({*upper_bound(ALL(color[C[i]]), i), y.second});
        }
    }

    vector<int> nxt(k, n-1);
    vector<int> info;
    for(int i = n-1; i>=0; --i) {
        int cnt = upper_bound(ALL(color[C[i]]), nxt[oo[i]]) - upper_bound(ALL(color[C[i]]), i);
        info.push_back(cnt > 0);
        nxt[oo[i]] = i;
    }

    for(int i = k-1; i>=0; --i){
        int cnt = upper_bound(ALL(color[i]), nxt[i]) - lower_bound(ALL(color[i]), 0);
        info.push_back(cnt > 0);
    }
    reverse(ALL(info));

    for(int i: info) WriteAdvice(i);
 
    // 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){
    vector<int> state(k);
    for(int i = 0; i<k; ++i) state[i] = A[i];

    set<int> replacable;
    for(int i = 0; i<k; ++i) if (state[i] == 0) replacable.insert(i);

    vector<int> info;
    for(int i = k; i<r; ++i) info.push_back(A[i]);
    reverse(ALL(info));
 
    vector<int> scaffold(k);
    vector<int> S(n, -1);
    for(int i= 0; i<k; ++i) {
        scaffold[i] = i;
        S[i] = i;
    }


 
    for(int i = 0; i<n; ++i){
        int j = GetRequest();
        if (S[j] == -1){
            if (replacable.empty()){
                exit(1);
                int k = 0;
                PutBack(scaffold[k]);
                S[scaffold[k]] = -1;
                scaffold[k] = j;
                S[scaffold[k]] = k;

                state[k] = info.back(); info.pop_back();
                if (state[k] == 0) replacable.insert(k);
            }
            else{
                int k = *replacable.begin();
                replacable.erase(k);

                PutBack(scaffold[k]);
                S[scaffold[k]] = -1;
                scaffold[k] = j;
                S[scaffold[k]] = k;

                state[k] = info.back(); info.pop_back();
                if (state[k] == 0) replacable.insert(k);
            }
        }
        else{
            int k = S[j];
            replacable.erase(k);
            state[k] = info.back(); info.pop_back();
            if (state[k] == 0) replacable.insert(k);
        }
    }
}
// void PutBack(int T);
// int GetRequest();
 
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     return 0;
// }

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 11284 KB Output is correct
2 Correct 104 ms 13900 KB Output is correct
3 Correct 101 ms 13748 KB Output is correct
4 Correct 97 ms 13740 KB Output is correct
5 Incorrect 104 ms 13208 KB Output isn't correct - not an optimal way
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 102 ms 13196 KB Output isn't correct - not an optimal way
2 Correct 106 ms 13520 KB Output is correct - 122000 bits used
3 Correct 97 ms 13744 KB Output is correct - 125000 bits used
4 Correct 98 ms 13764 KB Output is correct - 125000 bits used
5 Correct 95 ms 13768 KB Output is correct - 125000 bits used
6 Correct 127 ms 13672 KB Output is correct - 125000 bits used
7 Correct 102 ms 13880 KB Output is correct - 124828 bits used
8 Correct 97 ms 13704 KB Output is correct - 124910 bits used
9 Correct 99 ms 13736 KB Output is correct - 125000 bits used
10 Incorrect 85 ms 13616 KB Output isn't correct - not an optimal way