oj.uz

답안 #639171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639171 2022-09-08T19:18:05 Z Blagojce 드문 곤충 (IOI22_insects) C++17
100 / 100
 58 ms 432 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <random>
 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
 
using namespace std;
const int mxn = 2e3;


#include "insects.h"

int n;
vector<int> Unique;

bool dont_use[mxn];

void restrict_this(int x){
    dont_use[x] = true;
}

void find_unique(){
    fr(i, 0, n){
        move_inside(i);
        int cnt = press_button();
        if(cnt == 2){
            move_outside(i);
        }
        else{
            restrict_this(i);
            Unique.pb(i);
        }
    }
}
int add = 0;
vector<int> ids;

mt19937 _rand(time(NULL));

bool histogram(int h){
    shuffle(ids.begin(), ids.end(), _rand);
    
    int area = Unique.size() + add;
    
    vector<int> good;
    vector<int> bad;
    for(auto i : ids){
        if(dont_use[i]) continue;
        move_inside(i);
        int cnt = press_button();
        if(cnt > h){
            bad.pb(i);
            move_outside(i);
        }
        else{
            ++area;
            good.pb(i);
        }
        if(area == h * Unique.size()) break;
    }
    if(area == h * Unique.size()){
        add += (int)good.size();
        for(auto i : good){
            restrict_this(i);
        }
    }
    else{
        for(auto i : bad){
            restrict_this(i);
        }
        for(auto i : good){
            move_outside(i);
        }
    }
    return area == h * Unique.size();
}

int min_cardinality(int N) {
    n = N;
    fr(i, 0, N) ids.pb(i);
    
    
    find_unique();
    int l = 1, r = N/Unique.size();
    while(l < r){
        int m = (l + r + 1)/2;
        if(histogram(m)){
            l = m;
        }
        else{
            r = m-1;
        }
    }
    return l;
}

Compilation message

insects.cpp: In function 'bool histogram(int)':
insects.cpp:61:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         if(area == h * Unique.size()) break;
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~
insects.cpp:63:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     if(area == h * Unique.size()){
      |        ~~~~~^~~~~~~~~~~~~~~~~~~~
insects.cpp:77:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     return area == h * Unique.size();
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~

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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 220 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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 220 KB Output is correct
23 Correct 21 ms 296 KB Output is correct
24 Correct 9 ms 312 KB Output is correct
25 Correct 24 ms 304 KB Output is correct
26 Correct 20 ms 316 KB Output is correct
27 Correct 10 ms 216 KB Output is correct
28 Correct 8 ms 216 KB Output is correct
29 Correct 26 ms 208 KB Output is correct
30 Correct 29 ms 208 KB Output is correct
31 Correct 23 ms 216 KB Output is correct
32 Correct 18 ms 208 KB Output is correct
33 Correct 23 ms 208 KB Output is correct
34 Correct 27 ms 308 KB Output is correct
35 Correct 19 ms 296 KB Output is correct
36 Correct 23 ms 296 KB Output is correct
37 Correct 18 ms 208 KB Output is correct
38 Correct 21 ms 308 KB Output is correct
39 Correct 17 ms 208 KB Output is correct
40 Correct 12 ms 208 KB Output is correct
41 Correct 7 ms 324 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 220 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 0 ms 220 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 28 ms 208 KB Output is correct
8 Correct 16 ms 336 KB Output is correct
9 Correct 36 ms 208 KB Output is correct
10 Correct 51 ms 308 KB Output is correct
11 Correct 42 ms 312 KB Output is correct
12 Correct 30 ms 320 KB Output is correct
13 Correct 43 ms 320 KB Output is correct
14 Correct 43 ms 300 KB Output is correct
15 Correct 26 ms 208 KB Output is correct
16 Correct 44 ms 296 KB Output is correct
17 Correct 38 ms 304 KB Output is correct
18 Correct 51 ms 312 KB Output is correct
19 Correct 36 ms 300 KB Output is correct
20 Correct 30 ms 300 KB Output is correct
21 Correct 51 ms 308 KB Output is correct
22 Correct 50 ms 432 KB Output is correct
23 Correct 42 ms 300 KB Output is correct
24 Correct 40 ms 208 KB Output is correct
25 Correct 13 ms 324 KB Output is correct
26 Correct 18 ms 316 KB Output is correct
27 Correct 42 ms 208 KB Output is correct
28 Correct 35 ms 328 KB Output is correct
29 Correct 38 ms 208 KB Output is correct
30 Correct 32 ms 208 KB Output is correct
31 Correct 56 ms 308 KB Output is correct
32 Correct 48 ms 208 KB Output is correct
33 Correct 58 ms 312 KB Output is correct
34 Correct 41 ms 308 KB Output is correct
35 Correct 42 ms 296 KB Output is correct
36 Correct 31 ms 208 KB Output is correct
37 Correct 54 ms 308 KB Output is correct
38 Correct 45 ms 308 KB Output is correct
39 Correct 38 ms 208 KB Output is correct
40 Correct 39 ms 208 KB Output is correct
41 Correct 49 ms 300 KB Output is correct
42 Correct 39 ms 304 KB Output is correct
43 Correct 13 ms 316 KB Output is correct
44 Correct 42 ms 308 KB Output is correct
45 Correct 18 ms 296 KB Output is correct
46 Correct 22 ms 308 KB Output is correct
47 Correct 23 ms 320 KB Output is correct
48 Correct 28 ms 316 KB Output is correct