oj.uz

Submission #627369

# Submission time Handle Problem Language Result Execution time Memory
627369 2022-08-12T13:57:05 Z Cross_Ratio Rarest Insects (IOI22_insects) C++17
99.95 / 100
 91 ms 1304 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, S2;
    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);
        }
    }
    for(i=0;i<N;i++) S2.insert(i);
    int k = S.size();
    MS[1] = S;
    int s = 1, e = N/k+1;
    if(e==s+1) return s;
    int mid = (s+e)/2;
    for(int i : S2) {
        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(int i : S2) {
                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;
            vector<int> era;
            for(int m : S2) {
                if(S.find(m)==S.end()) era.push_back(m);
            }
            for(int i : era) S2.erase(i);
            mid = (s+e)/2;
            auto it = MS.upper_bound(mid);
            it--;
            set<int> S3 = it->second;
            for(i=0;i<N;i++) {
                if(S3.find(i)!=S3.end()&&S.find(i)==S.end()) {
                    move_inside(i);
                    S.insert(i);
                }
                if(S3.find(i)==S3.end()&&S.find(i)!=S.end()) {
                    move_outside(i);
                    S.erase(i);
                }
            }
            for(int i : S2) {
                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:37:24: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |             if(S.size()==k*mid) break;
      |                ~~~~~~~~^~~~~~~
insects.cpp:39:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |         if(S.size()==k*mid) break;
      |            ~~~~~~~~^~~~~~~
insects.cpp:44:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |         if(S.size()==k*mid) {
      |            ~~~~~~~~^~~~~~~
insects.cpp:49:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |                 if(S.size()==k*mid) break;
      |                    ~~~~~~~~^~~~~~~
insects.cpp:58:32: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   58 |                     if(S.size()==k*mid) break;
      |                        ~~~~~~~~^~~~~~~
insects.cpp:60:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |                 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;
      |                    ~~~~~~~~^~~~~~~
insects.cpp:9:12: warning: unused variable 'j' [-Wunused-variable]
    9 |     int i, j;
      |            ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 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 3 ms 304 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 296 KB Output is correct
13 Correct 6 ms 308 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 4 ms 336 KB Output is correct
16 Correct 4 ms 336 KB Output is correct
17 Correct 6 ms 336 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 5 ms 320 KB Output is correct
20 Correct 4 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 1 ms 208 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 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 3 ms 304 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 296 KB Output is correct
13 Correct 6 ms 308 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 4 ms 336 KB Output is correct
16 Correct 4 ms 336 KB Output is correct
17 Correct 6 ms 336 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 5 ms 320 KB Output is correct
20 Correct 4 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 23 ms 768 KB Output is correct
24 Correct 10 ms 312 KB Output is correct
25 Correct 25 ms 548 KB Output is correct
26 Correct 32 ms 416 KB Output is correct
27 Correct 20 ms 336 KB Output is correct
28 Correct 11 ms 316 KB Output is correct
29 Correct 30 ms 296 KB Output is correct
30 Correct 46 ms 348 KB Output is correct
31 Correct 21 ms 684 KB Output is correct
32 Correct 25 ms 632 KB Output is correct
33 Correct 29 ms 596 KB Output is correct
34 Correct 26 ms 588 KB Output is correct
35 Correct 21 ms 500 KB Output is correct
36 Correct 27 ms 484 KB Output is correct
37 Correct 22 ms 424 KB Output is correct
38 Correct 24 ms 300 KB Output is correct
39 Correct 18 ms 360 KB Output is correct
40 Correct 15 ms 308 KB Output is correct
41 Correct 9 ms 312 KB Output is correct

Subtask #3
74.95 / 75.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 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 35 ms 1304 KB Output is correct
8 Correct 17 ms 452 KB Output is correct
9 Correct 51 ms 876 KB Output is correct
10 Correct 56 ms 676 KB Output is correct
11 Correct 60 ms 416 KB Output is correct
12 Correct 28 ms 468 KB Output is correct
13 Correct 46 ms 412 KB Output is correct
14 Correct 49 ms 428 KB Output is correct
15 Correct 51 ms 1032 KB Output is correct
16 Correct 51 ms 1080 KB Output is correct
17 Correct 46 ms 1040 KB Output is correct
18 Correct 39 ms 912 KB Output is correct
19 Correct 55 ms 1064 KB Output is correct
20 Correct 74 ms 864 KB Output is correct
21 Correct 44 ms 608 KB Output is correct
22 Correct 54 ms 540 KB Output is correct
23 Correct 37 ms 416 KB Output is correct
24 Correct 58 ms 428 KB Output is correct
25 Correct 36 ms 444 KB Output is correct
26 Correct 26 ms 444 KB Output is correct
27 Correct 54 ms 800 KB Output is correct
28 Correct 32 ms 792 KB Output is correct
29 Correct 60 ms 964 KB Output is correct
30 Correct 85 ms 952 KB Output is correct
31 Correct 84 ms 680 KB Output is correct
32 Correct 91 ms 636 KB Output is correct
33 Correct 38 ms 392 KB Output is correct
34 Correct 50 ms 424 KB Output is correct
35 Partially correct 81 ms 872 KB Output is partially correct
36 Correct 54 ms 808 KB Output is correct
37 Correct 54 ms 592 KB Output is correct
38 Correct 48 ms 596 KB Output is correct
39 Correct 63 ms 752 KB Output is correct
40 Correct 43 ms 676 KB Output is correct
41 Correct 54 ms 924 KB Output is correct
42 Partially correct 32 ms 924 KB Output is partially correct
43 Correct 13 ms 308 KB Output is correct
44 Correct 50 ms 504 KB Output is correct
45 Correct 23 ms 1224 KB Output is correct
46 Correct 19 ms 468 KB Output is correct
47 Correct 26 ms 464 KB Output is correct
48 Correct 24 ms 424 KB Output is correct