oj.uz

답안 #956323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956323 2024-04-01T15:38:13 Z steveonalex 사육제 (CEOI14_carnival) C++17
100 / 100
 5 ms 964 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
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);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int get(vector<int> S){
    cout << S.size() << " "; printArr(S);
    cout.flush();
    int verdict; cin >> verdict; 
    return verdict;
}

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

    int n; cin >> n;

    vector<int> color(n+1);
    vector<int> S;
    int prev = 0;

    vector<int> distinct;
    for(int i = 1; i<=n; ++i){
        S.push_back(i);
        int cur = get(S);
        if (cur > prev){
            color[i] = cur;
            prev = cur;
            distinct.push_back(i);
        }
    }

    for(int i= 1; i<=n; ++i) if (color[i] == 0){
        int l = 0, r = distinct.size() - 1;
        while(l < r){
            int mid = (l + r) >> 1;
            vector<int> S;
            for(int i = 0; i <= mid; ++i) S.push_back(distinct[i]);
            S.push_back(i);
            if (get(S) < mid + 2) r = mid;
            else l = mid + 1;
        }
        color[i] = l + 1;
    }

    printArr(color);

    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 3 ms 464 KB Output is correct
3 Correct 3 ms 456 KB Output is correct
4 Correct 2 ms 708 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 712 KB Output is correct
7 Correct 4 ms 460 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 708 KB Output is correct
2 Correct 4 ms 464 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 3 ms 456 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 3 ms 708 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 4 ms 456 KB Output is correct
4 Correct 2 ms 964 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 5 ms 712 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 456 KB Output is correct
2 Correct 3 ms 452 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 4 ms 708 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 5 ms 452 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 708 KB Output is correct
2 Correct 4 ms 712 KB Output is correct
3 Correct 4 ms 456 KB Output is correct
4 Correct 5 ms 712 KB Output is correct
5 Correct 3 ms 712 KB Output is correct
6 Correct 2 ms 708 KB Output is correct
7 Correct 2 ms 708 KB Output is correct