oj.uz

답안 #837841

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837841 2023-08-25T18:36:10 Z fatemetmhr 드문 곤충 (IOI22_insects) C++17
25 / 100
 63 ms 1032 KB 
// Be name khoda //

#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define debug(x) cerr << "(" << (#x) << "): " << (x) << endl;
#define all(x)   x.begin(), x.end()
#define pb       push_back
#define mp       make_pair
#define fi       first
#define se       second

typedef long long ll;

const int mod   = 1e9 + 9;
const int maxn5 = 1e5 + 10;

int dif, n, pw[maxn5], per[maxn5], hsh = 0;
bool mark[maxn5];
vector <int> av;
map <int, int> asked;


void fix(int &a){
    if(a < 0)
        a += mod;
    if(a >= mod)
        a -= mod;
}

void mmove_outside(int x){
    x = per[x];
    move_outside(x);
    fix(hsh -= pw[x]);
}

void mmove_inside(int x){
    x = per[x];
    move_inside(x);
    fix(hsh += pw[x]);
}

int ppress_button(){
    if(asked.find(hsh) == asked.end())
        asked[hsh] = press_button();
    return asked[hsh];
}

int find_all_same(int id){
    mark[id] = true;
    mmove_inside(id);
    int cnt = 1;
    for(int i = 0; i < n; i++) if(!mark[i]){
        mmove_inside(i);
        if(ppress_button() == 2){
            mark[i] = true;
            cnt++;
        }
        mmove_outside(i);
    }
    mmove_outside(id);
    return cnt;
}

int count_dif(){
    av.clear();
    hsh = 0;
    for(int i = 0; i < n; i++){
        mmove_inside(i);
        av.pb(i);
        if(ppress_button() == 2){
            mmove_outside(i);
            av.pop_back();
        }
    }
    for(auto u : av)
        mmove_outside(u);
    return av.size();
}

bool check(int x){
    av.clear();
    hsh = 0;
    for(int i = 0; i < n; i++){
        av.pb(i);
        mmove_inside(i);
        if(i + 1 > x && ppress_button() > x){
            mmove_outside(i);
            av.pop_back();
        }
        if(int(av.size()) == x * dif)
            break;
        if(false && int(av.size()) + n - i - 1 < x * dif)
            break;
    }
    for(auto u : av)
        mmove_outside(u);
    return int(av.size()) == x * dif;
}

int min_cardinality(int N) {
    n = N;
    pw[0] = 1;
    for(int i = 0; i < n; i++){
        per[i] = i;
        if(i)
            pw[i] = pw[i - 1] * 7ll % mod;
    }
    shuffle(per, per + n, rng);
    dif = count_dif();
    if(dif == 1)
        return n;
    if(dif <= 8){
        int mn = n;
        for(int i = 0; i < n; i++) if(!mark[i]){
            mn = min(mn, find_all_same(i));
            if(mn == 1)
                return 1;
        }
        return mn;
    }
    int lo = 1, hi = n / dif + 1;
    while(hi - lo > 1){
        int mid = (lo + hi) >> 1;
        if(check(mid))
            lo = mid;
        else
            hi = mid;
    }
    return lo;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 336 KB Output is correct
9 Correct 7 ms 336 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 324 KB Output is correct
12 Correct 8 ms 328 KB Output is correct
13 Correct 8 ms 324 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 10 ms 328 KB Output is correct
16 Correct 7 ms 336 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 11 ms 336 KB Output is correct
19 Correct 3 ms 352 KB Output is correct
20 Correct 6 ms 332 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 6 ms 336 KB Output is correct
9 Correct 7 ms 336 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 324 KB Output is correct
12 Correct 8 ms 328 KB Output is correct
13 Correct 8 ms 324 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 10 ms 328 KB Output is correct
16 Correct 7 ms 336 KB Output is correct
17 Correct 5 ms 336 KB Output is correct
18 Correct 11 ms 336 KB Output is correct
19 Correct 3 ms 352 KB Output is correct
20 Correct 6 ms 332 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 7 ms 356 KB Output is correct
24 Correct 7 ms 352 KB Output is correct
25 Correct 28 ms 436 KB Output is correct
26 Correct 32 ms 440 KB Output is correct
27 Correct 15 ms 344 KB Output is correct
28 Correct 6 ms 372 KB Output is correct
29 Correct 33 ms 356 KB Output is correct
30 Correct 52 ms 520 KB Output is correct
31 Correct 28 ms 528 KB Output is correct
32 Correct 49 ms 500 KB Output is correct
33 Correct 19 ms 448 KB Output is correct
34 Correct 26 ms 460 KB Output is correct
35 Correct 22 ms 408 KB Output is correct
36 Correct 29 ms 448 KB Output is correct
37 Correct 24 ms 476 KB Output is correct
38 Correct 34 ms 396 KB Output is correct
39 Correct 21 ms 416 KB Output is correct
40 Correct 18 ms 356 KB Output is correct
41 Correct 7 ms 380 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 13 ms 336 KB Output is correct
8 Correct 13 ms 432 KB Output is correct
9 Partially correct 58 ms 760 KB Output is partially correct
10 Partially correct 63 ms 728 KB Output is partially correct
11 Correct 21 ms 384 KB Output is correct
12 Correct 20 ms 508 KB Output is correct
13 Partially correct 45 ms 632 KB Output is partially correct
14 Incorrect 47 ms 1032 KB Wrong answer.
15 Halted 0 ms 0 KB -