oj.uz

답안 #837769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837769 2023-08-25T16:12:59 Z kshitij_sodani 드문 곤충 (IOI22_insects) C++17
99.95 / 100
 63 ms 584 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
typedef long long llo;
#define endl '\n'

#include "insects.h"
#define in move_inside
#define out move_outside
#define query press_button

int d;
int query(int l,int r,vector<int> aa,vector<int> bb){
    //cout<<l<<":"<<r<<endl;

    if(l==r){
        return l;
    }
    int mid=(l+r+1)/2;
    vector<int> cc;
    vector<int> dd;
    int le=bb.size();
    int ind2=-1;
    for(auto j:bb){
        if(aa.size()+cc.size()==mid*d){
            dd.pb(j);
            continue;
        }
        ind2++;
        if(aa.size()+cc.size()+le<mid*d){
            for(auto jj:cc){
                out(jj);
            }
            for(int jj=ind2;jj<bb.size();jj++){
                cc.pb(bb[jj]);
            }
            return query(l,mid-1,aa,cc);
        }
        le--;
        in(j);
        cc.pb(j);
        if(query()>mid){
            out(j);
            cc.pop_back();
            dd.pb(j);
        }
    }

    if(aa.size()+cc.size()!=mid*d){
        for(auto j:cc){
            out(j);
        }
        int mi=mid-1;
        int x=aa.size()+cc.size();
        if((x/d)<mi){
            mi=(x/d);
        }
        return query(l,mi,aa,cc);
    }
    for(auto j:cc){
        aa.pb(j);
    }
    return query(mid,r,aa,dd);
}
int min_cardinality(int n) {
    vector<int> ss;
    vector<int> tt;
    for(int i=0;i<n;i++){
        in(i);
        ss.pb(i);
        if(query()==2){
            out(i);
            tt.pb(i);
            ss.pop_back();
        }
    }
    d=ss.size();
    if(ss.size()==n){
        return 1;
    }
    if(ss.size()==1){
        return n;
    }

    int x=query(1,n/(ss.size()),ss,tt);



return x;
}

Compilation message

insects.cpp: In function 'int press_button(int, int, std::vector<int>, std::vector<int>)':
insects.cpp:28:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |         if(aa.size()+cc.size()==mid*d){
      |            ~~~~~~~~~~~~~~~~~~~^~~~~~~
insects.cpp:33:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |         if(aa.size()+cc.size()+le<mid*d){
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~
insects.cpp:37:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             for(int jj=ind2;jj<bb.size();jj++){
      |                             ~~^~~~~~~~~~
insects.cpp:52:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |     if(aa.size()+cc.size()!=mid*d){
      |        ~~~~~~~~~~~~~~~~~~~^~~~~~~
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:81:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   81 |     if(ss.size()==n){
      |        ~~~~~~~~~^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 3 ms 228 KB Output is correct
8 Correct 2 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 1 ms 304 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 300 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 3 ms 228 KB Output is correct
8 Correct 2 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 1 ms 304 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 300 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 8 ms 304 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 16 ms 328 KB Output is correct
26 Correct 16 ms 424 KB Output is correct
27 Correct 19 ms 292 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 15 ms 292 KB Output is correct
30 Correct 11 ms 208 KB Output is correct
31 Correct 20 ms 336 KB Output is correct
32 Correct 16 ms 336 KB Output is correct
33 Correct 23 ms 328 KB Output is correct
34 Correct 19 ms 328 KB Output is correct
35 Correct 18 ms 296 KB Output is correct
36 Correct 17 ms 288 KB Output is correct
37 Correct 11 ms 356 KB Output is correct
38 Correct 21 ms 208 KB Output is correct
39 Correct 16 ms 208 KB Output is correct
40 Correct 9 ms 208 KB Output is correct
41 Correct 8 ms 208 KB Output is correct

Subtask #3
74.95 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 208 KB Output is correct
7 Correct 15 ms 304 KB Output is correct
8 Correct 12 ms 208 KB Output is correct
9 Correct 45 ms 304 KB Output is correct
10 Correct 36 ms 304 KB Output is correct
11 Correct 40 ms 300 KB Output is correct
12 Correct 16 ms 208 KB Output is correct
13 Correct 49 ms 208 KB Output is correct
14 Correct 27 ms 320 KB Output is correct
15 Correct 38 ms 308 KB Output is correct
16 Correct 31 ms 440 KB Output is correct
17 Correct 39 ms 304 KB Output is correct
18 Correct 22 ms 432 KB Output is correct
19 Correct 42 ms 436 KB Output is correct
20 Correct 31 ms 308 KB Output is correct
21 Correct 40 ms 356 KB Output is correct
22 Correct 63 ms 312 KB Output is correct
23 Correct 29 ms 328 KB Output is correct
24 Correct 33 ms 336 KB Output is correct
25 Correct 18 ms 288 KB Output is correct
26 Correct 11 ms 296 KB Output is correct
27 Correct 24 ms 584 KB Output is correct
28 Correct 25 ms 324 KB Output is correct
29 Correct 50 ms 424 KB Output is correct
30 Correct 50 ms 308 KB Output is correct
31 Correct 51 ms 328 KB Output is correct
32 Correct 36 ms 328 KB Output is correct
33 Correct 37 ms 304 KB Output is correct
34 Correct 48 ms 208 KB Output is correct
35 Partially correct 49 ms 328 KB Output is partially correct
36 Correct 43 ms 300 KB Output is correct
37 Correct 50 ms 304 KB Output is correct
38 Correct 43 ms 332 KB Output is correct
39 Correct 27 ms 332 KB Output is correct
40 Correct 34 ms 360 KB Output is correct
41 Correct 34 ms 304 KB Output is correct
42 Partially correct 40 ms 328 KB Output is partially correct
43 Correct 7 ms 428 KB Output is correct
44 Correct 31 ms 460 KB Output is correct
45 Correct 23 ms 432 KB Output is correct
46 Correct 12 ms 312 KB Output is correct
47 Correct 18 ms 292 KB Output is correct
48 Correct 18 ms 208 KB Output is correct