oj.uz

Submission #1070722

# Submission time Handle Problem Language Result Execution time Memory
1070722 2024-08-22T17:16:17 Z Mihailo Rarest Insects (IOI22_insects) C++17
50.01 / 100
 159 ms 980 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pll pair<long long, long long>
#define MOD 1000002022ll
#define xx first
#define yy second
using namespace std;
typedef long long ll;

void move_inside(int i);
void move_outside(int i);
int press_button();

vector<int> rep;
set<int> setrep;
int tip[10000], bp[10000];

int min_cardinality(int N) {
    for(int i=0; i<N; i++) {
        move_inside(i);
        if(press_button()>1) move_outside(i);
        else {
            rep.pb(i);
            setrep.insert(i);
        }
    }
    if(rep.size()>N/2) return 1;
    for(int i=0; i<rep.size(); i++) tip[rep[i]]=i;
    for(int i=0; i<rep.size(); i++) {
        if(i%2==0) move_outside(rep[i]);
    }
    for(int i=0; i<N; i++) {
        if(!setrep.count(i)) {
            move_inside(i);
            if(press_button()==2) tip[i]+=1;
            move_outside(i);
        }
    }
    for(int b=1; b<10; b++) {
        for(int i=0; i<rep.size(); i++) {
            if((i&(1<<(b-1)))&&(!(i&(1<<(b))))) move_outside(rep[i]);
            if((!(i&(1<<(b-1))))&&(i&(1<<(b)))) move_inside(rep[i]);
        }
        for(int i=0; i<N; i++) {
            if(!setrep.count(i)) {
                move_inside(i);
                if(press_button()==2) tip[i]+=(1<<b);
                move_outside(i);
            }
        }
    }
    for(int i=0; i<N; i++) bp[tip[i]]++;
    for(int i=0; i<N; i++) if(tip[i]>=rep.size()) while(true);
    ll rez=MOD;
    for(int i=0; i<rep.size(); i++) rez=min(rez, (ll)bp[i]);
    return rez;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:28:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |     if(rep.size()>N/2) return 1;
      |        ~~~~~~~~~~^~~~
insects.cpp:29:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(int i=0; i<rep.size(); i++) tip[rep[i]]=i;
      |                  ~^~~~~~~~~~~
insects.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0; i<rep.size(); i++) {
      |                  ~^~~~~~~~~~~
insects.cpp:41:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int i=0; i<rep.size(); i++) {
      |                      ~^~~~~~~~~~~
insects.cpp:54:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=0; i<N; i++) if(tip[i]>=rep.size()) while(true);
      |                               ~~~~~~^~~~~~~~~~~~
insects.cpp:56:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int i=0; i<rep.size(); i++) rez=min(rez, (ll)bp[i]);
      |                  ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 13 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 9 ms 596 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 9 ms 444 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 13 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 10 ms 596 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 13 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 9 ms 596 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 9 ms 444 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 13 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 10 ms 596 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 54 ms 344 KB Output is correct
24 Correct 3 ms 464 KB Output is correct
25 Correct 82 ms 424 KB Output is correct
26 Correct 75 ms 448 KB Output is correct
27 Correct 73 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 63 ms 444 KB Output is correct
30 Correct 66 ms 344 KB Output is correct
31 Correct 60 ms 444 KB Output is correct
32 Correct 69 ms 444 KB Output is correct
33 Correct 72 ms 448 KB Output is correct
34 Correct 73 ms 600 KB Output is correct
35 Correct 79 ms 452 KB Output is correct
36 Correct 69 ms 344 KB Output is correct
37 Correct 70 ms 600 KB Output is correct
38 Correct 62 ms 344 KB Output is correct
39 Correct 49 ms 344 KB Output is correct
40 Correct 46 ms 600 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
25.01 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Output is partially correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Partially correct 0 ms 344 KB Output is partially correct
6 Partially correct 1 ms 344 KB Output is partially correct
7 Partially correct 148 ms 436 KB Output is partially correct
8 Correct 6 ms 732 KB Output is correct
9 Partially correct 139 ms 448 KB Output is partially correct
10 Partially correct 143 ms 592 KB Output is partially correct
11 Partially correct 143 ms 436 KB Output is partially correct
12 Partially correct 83 ms 856 KB Output is partially correct
13 Partially correct 142 ms 424 KB Output is partially correct
14 Partially correct 146 ms 600 KB Output is partially correct
15 Partially correct 140 ms 600 KB Output is partially correct
16 Partially correct 123 ms 848 KB Output is partially correct
17 Partially correct 135 ms 424 KB Output is partially correct
18 Partially correct 131 ms 440 KB Output is partially correct
19 Partially correct 128 ms 592 KB Output is partially correct
20 Partially correct 155 ms 440 KB Output is partially correct
21 Partially correct 141 ms 424 KB Output is partially correct
22 Partially correct 142 ms 428 KB Output is partially correct
23 Partially correct 129 ms 592 KB Output is partially correct
24 Partially correct 108 ms 452 KB Output is partially correct
25 Partially correct 69 ms 480 KB Output is partially correct
26 Correct 15 ms 716 KB Output is correct
27 Partially correct 133 ms 436 KB Output is partially correct
28 Partially correct 122 ms 680 KB Output is partially correct
29 Partially correct 119 ms 344 KB Output is partially correct
30 Partially correct 114 ms 344 KB Output is partially correct
31 Partially correct 134 ms 432 KB Output is partially correct
32 Partially correct 159 ms 436 KB Output is partially correct
33 Partially correct 129 ms 592 KB Output is partially correct
34 Partially correct 129 ms 344 KB Output is partially correct
35 Partially correct 140 ms 432 KB Output is partially correct
36 Partially correct 133 ms 428 KB Output is partially correct
37 Partially correct 120 ms 600 KB Output is partially correct
38 Partially correct 121 ms 344 KB Output is partially correct
39 Partially correct 119 ms 440 KB Output is partially correct
40 Partially correct 131 ms 592 KB Output is partially correct
41 Partially correct 134 ms 596 KB Output is partially correct
42 Partially correct 149 ms 420 KB Output is partially correct
43 Partially correct 33 ms 344 KB Output is partially correct
44 Partially correct 123 ms 344 KB Output is partially correct
45 Partially correct 156 ms 848 KB Output is partially correct
46 Partially correct 69 ms 704 KB Output is partially correct
47 Partially correct 72 ms 488 KB Output is partially correct
48 Partially correct 92 ms 980 KB Output is partially correct