oj.uz

Submission #627359

# Submission time Handle Problem Language Result Execution time Memory
627359 2022-08-12T13:49:10 Z Cross_Ratio Rarest Insects (IOI22_insects) C++17
53.16 / 100
 153 ms 1300 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
map<int,set<int>> MS;
void move_inside(int);
void move_outside(int);
int press_button();
int min_cardinality(int N) {
    int i, j;
    set<int> S;
    move_inside(0);
    S.insert(0);
    for(i=1;i<N;i++) {
        move_inside(i);
        S.insert(i);
        int c = press_button();
        if(c >= 2) {
            move_outside(i);
            S.erase(i);
        }
    }
    int k = S.size();
    MS[1] = S;
    vector<int> V;
    for(i=0;i<N;i++) V.push_back(i);
    random_shuffle(V.begin(),V.end());
    int s = 1, e = N/k+1;
    if(e==s+1) return s;
    int mid = (s+e)/2;
    for(j=0;j<N;j++) {
        i = V[j];
        if(S.find(i)==S.end()) {
            move_inside(i);
            S.insert(i);
            int c = press_button();
            if(c >= mid+1) {
                move_outside(i);
                S.erase(i);
            }
            if(S.size()==k*mid) break;
        }
        if(S.size()==k*mid) break;
    }
    MS[mid] = S;
    while(s+1<e) {
        int mid = (s+e)/2;
        if(S.size()==k*mid) {
            s = mid;
            if(mid+1>=e) break;
            mid = (s+e)/2;
            for(j=0;j<N;j++) {
                i = V[j];
                if(S.size()==k*mid) break;
                if(S.find(i)==S.end()) {
                    move_inside(i);
                    S.insert(i);
                    int c = press_button();
                    if(c >= mid+1) {
                        move_outside(i);
                        S.erase(i);
                    }
                    if(S.size()==k*mid) break;
                }
                if(S.size()==k*mid) break;
            }
            MS[mid] = S;
        }
        else {
            e = mid;
            if(s+1>=e) break;
            mid = (s+e)/2;
            auto it = MS.upper_bound(mid);
            it--;
            set<int> S2 = it->second;
            for(i=0;i<N;i++) {
                if(S2.find(i)!=S2.end()&&S.find(i)==S.end()) {
                    move_inside(i);
                    S.insert(i);
                }
                if(S2.find(i)==S2.end()&&S.find(i)!=S.end()) {
                    move_outside(i);
                    S.erase(i);
                }
            }
            for(j=0;j<N;j++) {
                i = V[j];
                if(S.find(i)==S.end()) {
                    move_inside(i);
                    S.insert(i);
                    int c = press_button();
                    if(c >= mid+1) {
                        move_outside(i);
                        S.erase(i);
                    }
                    if(S.size()==k*mid) break;
                }
                if(S.size()==k*mid) break;
            }
            MS[mid] = S;
        }
    }
    return s;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:40:24: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |             if(S.size()==k*mid) break;
      |                ~~~~~~~~^~~~~~~
insects.cpp:42:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |         if(S.size()==k*mid) break;
      |            ~~~~~~~~^~~~~~~
insects.cpp:47:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |         if(S.size()==k*mid) {
      |            ~~~~~~~~^~~~~~~
insects.cpp:53:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |                 if(S.size()==k*mid) break;
      |                    ~~~~~~~~^~~~~~~
insects.cpp:62:32: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |                     if(S.size()==k*mid) break;
      |                        ~~~~~~~~^~~~~~~
insects.cpp:64:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |                 if(S.size()==k*mid) break;
      |                    ~~~~~~~~^~~~~~~
insects.cpp:95:32: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |                     if(S.size()==k*mid) break;
      |                        ~~~~~~~~^~~~~~~
insects.cpp:97:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   97 |                 if(S.size()==k*mid) break;
      |                    ~~~~~~~~^~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 2 ms 336 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 7 ms 304 KB Output is correct
9 Correct 7 ms 304 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 10 ms 296 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Correct 7 ms 308 KB Output is correct
16 Correct 8 ms 296 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 6 ms 300 KB Output is correct
20 Correct 6 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory 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 2 ms 336 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 7 ms 304 KB Output is correct
9 Correct 7 ms 304 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 10 ms 296 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Correct 7 ms 308 KB Output is correct
16 Correct 8 ms 296 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 6 ms 300 KB Output is correct
20 Correct 6 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 20 ms 680 KB Output is correct
24 Correct 9 ms 332 KB Output is correct
25 Correct 25 ms 444 KB Output is correct
26 Correct 45 ms 428 KB Output is correct
27 Correct 76 ms 288 KB Output is correct
28 Correct 5 ms 324 KB Output is correct
29 Correct 70 ms 208 KB Output is correct
30 Correct 50 ms 312 KB Output is correct
31 Correct 20 ms 584 KB Output is correct
32 Correct 13 ms 520 KB Output is correct
33 Correct 31 ms 564 KB Output is correct
34 Correct 32 ms 568 KB Output is correct
35 Correct 30 ms 420 KB Output is correct
36 Correct 41 ms 428 KB Output is correct
37 Correct 23 ms 420 KB Output is correct
38 Correct 33 ms 300 KB Output is correct
39 Correct 26 ms 356 KB Output is correct
40 Correct 9 ms 328 KB Output is correct
41 Correct 11 ms 320 KB Output is correct

Subtask #3
28.16 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 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 1 ms 208 KB Output is correct
7 Correct 45 ms 1300 KB Output is correct
8 Correct 19 ms 476 KB Output is correct
9 Correct 24 ms 812 KB Output is correct
10 Partially correct 80 ms 692 KB Output is partially correct
11 Partially correct 134 ms 296 KB Output is partially correct
12 Correct 29 ms 332 KB Output is correct
13 Partially correct 153 ms 328 KB Output is partially correct
14 Partially correct 100 ms 328 KB Output is partially correct
15 Correct 38 ms 972 KB Output is correct
16 Correct 52 ms 976 KB Output is correct
17 Correct 60 ms 920 KB Output is correct
18 Correct 61 ms 900 KB Output is correct
19 Partially correct 71 ms 844 KB Output is partially correct
20 Correct 44 ms 840 KB Output is correct
21 Partially correct 67 ms 540 KB Output is partially correct
22 Partially correct 85 ms 428 KB Output is partially correct
23 Partially correct 73 ms 400 KB Output is partially correct
24 Correct 46 ms 496 KB Output is correct
25 Correct 32 ms 388 KB Output is correct
26 Correct 17 ms 340 KB Output is correct
27 Correct 50 ms 664 KB Output is correct
28 Correct 34 ms 672 KB Output is correct
29 Correct 23 ms 844 KB Output is correct
30 Correct 45 ms 932 KB Output is correct
31 Partially correct 60 ms 576 KB Output is partially correct
32 Partially correct 77 ms 680 KB Output is partially correct
33 Partially correct 84 ms 532 KB Output is partially correct
34 Partially correct 94 ms 492 KB Output is partially correct
35 Correct 55 ms 804 KB Output is correct
36 Correct 54 ms 712 KB Output is correct
37 Partially correct 71 ms 724 KB Output is partially correct
38 Partially correct 89 ms 660 KB Output is partially correct
39 Correct 35 ms 552 KB Output is correct
40 Correct 52 ms 668 KB Output is correct
41 Correct 58 ms 724 KB Output is correct
42 Correct 53 ms 836 KB Output is correct
43 Partially correct 33 ms 296 KB Output is partially correct
44 Partially correct 102 ms 332 KB Output is partially correct
45 Correct 48 ms 1188 KB Output is correct
46 Correct 24 ms 436 KB Output is correct
47 Correct 29 ms 336 KB Output is correct
48 Correct 20 ms 392 KB Output is correct