# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
871208 | 2023-11-10T08:57:43 Z | Lib | 드문 곤충 (IOI22_insects) | C++17 | 108 ms | 1412 KB |
#include <bits/stdc++.h> #include "insects.h" //#include "stub.cpp" using namespace std; deque <int> PrevIndex; int InMachine[2003]; int Permutation[2003]; //saving the answer of each iteration so that we won't accidentially binsearch something we've already calculated int ok[2003]; int n; int TypeCount; int CurrentInMachine; int l,r,mid; int PossibleMincount(int cnt){ while(!PrevIndex.empty()){ PrevIndex.pop_back(); } //Pushing insects inside the machine, keeping track of the ones being putted inside for this iteration of binary searching for(int i=0;i<n;i++){ if(InMachine[Permutation[i]]==0){ InMachine[Permutation[i]]=1; move_inside(Permutation[i]); PrevIndex.push_back(Permutation[i]); if(press_button()>cnt){ move_outside(Permutation[i]); InMachine[Permutation[i]]=0; PrevIndex.pop_back(); } if(PrevIndex.size()==(cnt-l)*TypeCount){ break; } } } if(PrevIndex.size()!=(cnt-l)*TypeCount){ //There clearly exist a type of insect with cardinality less than cnt, so the answer is less than cnt. Removing insects from last iteration. while(!PrevIndex.empty()){ InMachine[PrevIndex.back()]=0; move_outside(PrevIndex.back()); PrevIndex.pop_back(); } PrevIndex.clear(); return 0; }else{ //As every type of insects has at least cnt insects, the answer is at least cnt. Just return true while(!PrevIndex.empty()){ PrevIndex.pop_back(); } CurrentInMachine=0; for(int i=0;i<n;i++){ CurrentInMachine+=InMachine[Permutation[i]]; } return 1; } } int min_cardinality(int N){ n=N; //Create a random permutation to fuck with shitty tests and achieve better query efficiency for(int i=0;i<N;i++){ Permutation[i]=i; } srand(time(NULL)); int Tempval; for(int i=N-1;i>0;i--){ Tempval=rand()%i; swap(Permutation[i],Permutation[Tempval]); } //Remember to initialize as this is multitest for(int i=0;i<N;i++){ InMachine[Permutation[i]]=0; } while(!PrevIndex.empty()){ PrevIndex.pop_back(); } //Phase 1: Determining the amount of different types of insects for(int i=0;i<n;i++){ move_inside(Permutation[i]); InMachine[Permutation[i]]=1; PrevIndex.push_back(Permutation[i]); if(press_button()>1){ move_outside(Permutation[i]); InMachine[Permutation[i]]=0; PrevIndex.pop_back(); } } TypeCount=PrevIndex.size(); r=N; l=1; //Phase 2: Binary search for the answer while(r-l>=1){ mid=(l+r+1)/2; if(PossibleMincount(mid)){ l=mid; //r=min(r,mid+(N-CurrentInMachine)/TypeCount); }else{ r=mid-1; } } if(ok[r]){ return r; }else{ return l; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 2 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 596 KB | Output is correct |
8 | Correct | 4 ms | 344 KB | Output is correct |
9 | Correct | 6 ms | 344 KB | Output is correct |
10 | Correct | 8 ms | 344 KB | Output is correct |
11 | Correct | 4 ms | 344 KB | Output is correct |
12 | Correct | 6 ms | 344 KB | Output is correct |
13 | Correct | 6 ms | 344 KB | Output is correct |
14 | Correct | 4 ms | 344 KB | Output is correct |
15 | Correct | 5 ms | 344 KB | Output is correct |
16 | Correct | 5 ms | 344 KB | Output is correct |
17 | Correct | 5 ms | 344 KB | Output is correct |
18 | Correct | 6 ms | 344 KB | Output is correct |
19 | Correct | 7 ms | 344 KB | Output is correct |
20 | Correct | 5 ms | 344 KB | Output is correct |
21 | Correct | 4 ms | 344 KB | Output is correct |
22 | Correct | 3 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 2 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 596 KB | Output is correct |
8 | Correct | 4 ms | 344 KB | Output is correct |
9 | Correct | 6 ms | 344 KB | Output is correct |
10 | Correct | 8 ms | 344 KB | Output is correct |
11 | Correct | 4 ms | 344 KB | Output is correct |
12 | Correct | 6 ms | 344 KB | Output is correct |
13 | Correct | 6 ms | 344 KB | Output is correct |
14 | Correct | 4 ms | 344 KB | Output is correct |
15 | Correct | 5 ms | 344 KB | Output is correct |
16 | Correct | 5 ms | 344 KB | Output is correct |
17 | Correct | 5 ms | 344 KB | Output is correct |
18 | Correct | 6 ms | 344 KB | Output is correct |
19 | Correct | 7 ms | 344 KB | Output is correct |
20 | Correct | 5 ms | 344 KB | Output is correct |
21 | Correct | 4 ms | 344 KB | Output is correct |
22 | Correct | 3 ms | 344 KB | Output is correct |
23 | Correct | 10 ms | 600 KB | Output is correct |
24 | Correct | 4 ms | 460 KB | Output is correct |
25 | Correct | 25 ms | 688 KB | Output is correct |
26 | Correct | 40 ms | 688 KB | Output is correct |
27 | Correct | 50 ms | 456 KB | Output is correct |
28 | Correct | 21 ms | 600 KB | Output is correct |
29 | Correct | 50 ms | 848 KB | Output is correct |
30 | Correct | 47 ms | 600 KB | Output is correct |
31 | Correct | 25 ms | 344 KB | Output is correct |
32 | Correct | 28 ms | 452 KB | Output is correct |
33 | Correct | 30 ms | 344 KB | Output is correct |
34 | Correct | 28 ms | 452 KB | Output is correct |
35 | Correct | 33 ms | 456 KB | Output is correct |
36 | Correct | 30 ms | 460 KB | Output is correct |
37 | Correct | 41 ms | 704 KB | Output is correct |
38 | Correct | 39 ms | 440 KB | Output is correct |
39 | Correct | 38 ms | 588 KB | Output is correct |
40 | Correct | 28 ms | 584 KB | Output is correct |
41 | Correct | 17 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 17 ms | 432 KB | Output is correct |
8 | Correct | 8 ms | 856 KB | Output is correct |
9 | Partially correct | 74 ms | 704 KB | Output is partially correct |
10 | Partially correct | 87 ms | 680 KB | Output is partially correct |
11 | Partially correct | 104 ms | 692 KB | Output is partially correct |
12 | Partially correct | 55 ms | 712 KB | Output is partially correct |
13 | Partially correct | 108 ms | 684 KB | Output is partially correct |
14 | Partially correct | 92 ms | 1412 KB | Output is partially correct |
15 | Partially correct | 39 ms | 680 KB | Output is partially correct |
16 | Partially correct | 46 ms | 692 KB | Output is partially correct |
17 | Partially correct | 50 ms | 1336 KB | Output is partially correct |
18 | Partially correct | 58 ms | 456 KB | Output is partially correct |
19 | Partially correct | 60 ms | 848 KB | Output is partially correct |
20 | Partially correct | 59 ms | 936 KB | Output is partially correct |
21 | Partially correct | 84 ms | 900 KB | Output is partially correct |
22 | Partially correct | 97 ms | 940 KB | Output is partially correct |
23 | Partially correct | 90 ms | 944 KB | Output is partially correct |
24 | Partially correct | 80 ms | 1308 KB | Output is partially correct |
25 | Partially correct | 62 ms | 1180 KB | Output is partially correct |
26 | Partially correct | 41 ms | 848 KB | Output is partially correct |
27 | Partially correct | 60 ms | 1092 KB | Output is partially correct |
28 | Partially correct | 68 ms | 928 KB | Output is partially correct |
29 | Partially correct | 57 ms | 916 KB | Output is partially correct |
30 | Partially correct | 58 ms | 444 KB | Output is partially correct |
31 | Partially correct | 89 ms | 688 KB | Output is partially correct |
32 | Partially correct | 95 ms | 848 KB | Output is partially correct |
33 | Partially correct | 94 ms | 920 KB | Output is partially correct |
34 | Partially correct | 90 ms | 944 KB | Output is partially correct |
35 | Partially correct | 74 ms | 920 KB | Output is partially correct |
36 | Partially correct | 65 ms | 920 KB | Output is partially correct |
37 | Partially correct | 84 ms | 848 KB | Output is partially correct |
38 | Partially correct | 88 ms | 688 KB | Output is partially correct |
39 | Partially correct | 75 ms | 688 KB | Output is partially correct |
40 | Partially correct | 80 ms | 676 KB | Output is partially correct |
41 | Partially correct | 63 ms | 680 KB | Output is partially correct |
42 | Partially correct | 67 ms | 816 KB | Output is partially correct |
43 | Partially correct | 24 ms | 600 KB | Output is partially correct |
44 | Partially correct | 97 ms | 704 KB | Output is partially correct |
45 | Partially correct | 32 ms | 712 KB | Output is partially correct |
46 | Partially correct | 50 ms | 604 KB | Output is partially correct |
47 | Partially correct | 55 ms | 600 KB | Output is partially correct |
48 | Partially correct | 54 ms | 680 KB | Output is partially correct |