oj.uz

Submission #627358

# Submission time Handle Problem Language Result Execution time Memory
627358 2022-08-12T13:45:50 Z Cross_Ratio Rarest Insects (IOI22_insects) C++17
53.16 / 100
 156 ms 1192 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;
    int s = 1, e = N/k+1;
    if(e==s+1) return s;
    int mid = (s+e)/2;
    for(i=0;i<N;i++) {
        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(i=0;i<N;i++) {
                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(i=0;i<N;i++) {
                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:36:24: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |             if(S.size()==k*mid) break;
      |                ~~~~~~~~^~~~~~~
insects.cpp:38:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |         if(S.size()==k*mid) break;
      |            ~~~~~~~~^~~~~~~
insects.cpp:43:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |         if(S.size()==k*mid) {
      |            ~~~~~~~~^~~~~~~
insects.cpp:48:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   48 |                 if(S.size()==k*mid) break;
      |                    ~~~~~~~~^~~~~~~
insects.cpp:57:32: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |                     if(S.size()==k*mid) break;
      |                        ~~~~~~~~^~~~~~~
insects.cpp:59:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |                 if(S.size()==k*mid) break;
      |                    ~~~~~~~~^~~~~~~
insects.cpp:89:32: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   89 |                     if(S.size()==k*mid) break;
      |                        ~~~~~~~~^~~~~~~
insects.cpp:91:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   91 |                 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 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 0 ms 208 KB Output is correct
5 Correct 1 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 6 ms 300 KB Output is correct
9 Correct 6 ms 300 KB Output is correct
10 Correct 16 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 13 ms 304 KB Output is correct
13 Correct 10 ms 228 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 7 ms 308 KB Output is correct
16 Correct 7 ms 208 KB Output is correct
17 Correct 7 ms 304 KB Output is correct
18 Correct 9 ms 308 KB Output is correct
19 Correct 6 ms 328 KB Output is correct
20 Correct 3 ms 312 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 340 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 0 ms 208 KB Output is correct
5 Correct 1 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 6 ms 300 KB Output is correct
9 Correct 6 ms 300 KB Output is correct
10 Correct 16 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 13 ms 304 KB Output is correct
13 Correct 10 ms 228 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 7 ms 308 KB Output is correct
16 Correct 7 ms 208 KB Output is correct
17 Correct 7 ms 304 KB Output is correct
18 Correct 9 ms 308 KB Output is correct
19 Correct 6 ms 328 KB Output is correct
20 Correct 3 ms 312 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 14 ms 660 KB Output is correct
24 Correct 11 ms 304 KB Output is correct
25 Correct 21 ms 416 KB Output is correct
26 Correct 25 ms 456 KB Output is correct
27 Correct 61 ms 292 KB Output is correct
28 Correct 8 ms 316 KB Output is correct
29 Correct 76 ms 292 KB Output is correct
30 Correct 66 ms 292 KB Output is correct
31 Correct 21 ms 544 KB Output is correct
32 Correct 16 ms 676 KB Output is correct
33 Correct 38 ms 548 KB Output is correct
34 Correct 30 ms 548 KB Output is correct
35 Correct 29 ms 508 KB Output is correct
36 Correct 26 ms 424 KB Output is correct
37 Correct 28 ms 424 KB Output is correct
38 Correct 39 ms 304 KB Output is correct
39 Correct 24 ms 352 KB Output is correct
40 Correct 18 ms 312 KB Output is correct
41 Correct 11 ms 328 KB Output is correct

Subtask #3
28.16 / 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 0 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 43 ms 1188 KB Output is correct
8 Correct 15 ms 352 KB Output is correct
9 Correct 70 ms 804 KB Output is correct
10 Partially correct 71 ms 536 KB Output is partially correct
11 Partially correct 156 ms 304 KB Output is partially correct
12 Correct 18 ms 368 KB Output is correct
13 Partially correct 150 ms 356 KB Output is partially correct
14 Partially correct 106 ms 376 KB Output is partially correct
15 Correct 41 ms 948 KB Output is correct
16 Correct 48 ms 892 KB Output is correct
17 Correct 33 ms 956 KB Output is correct
18 Correct 44 ms 840 KB Output is correct
19 Correct 66 ms 932 KB Output is correct
20 Partially correct 32 ms 792 KB Output is partially correct
21 Partially correct 62 ms 540 KB Output is partially correct
22 Partially correct 83 ms 488 KB Output is partially correct
23 Partially correct 57 ms 456 KB Output is partially correct
24 Correct 25 ms 356 KB Output is correct
25 Correct 26 ms 436 KB Output is correct
26 Correct 19 ms 324 KB Output is correct
27 Correct 56 ms 636 KB Output is correct
28 Correct 32 ms 712 KB Output is correct
29 Correct 31 ms 920 KB Output is correct
30 Correct 61 ms 864 KB Output is correct
31 Partially correct 75 ms 684 KB Output is partially correct
32 Partially correct 70 ms 568 KB Output is partially correct
33 Partially correct 84 ms 408 KB Output is partially correct
34 Partially correct 41 ms 400 KB Output is partially correct
35 Partially correct 26 ms 796 KB Output is partially correct
36 Correct 45 ms 784 KB Output is correct
37 Partially correct 95 ms 648 KB Output is partially correct
38 Partially correct 70 ms 620 KB Output is partially correct
39 Correct 42 ms 596 KB Output is correct
40 Correct 40 ms 552 KB Output is correct
41 Correct 45 ms 812 KB Output is correct
42 Partially correct 57 ms 808 KB Output is partially correct
43 Partially correct 32 ms 296 KB Output is partially correct
44 Partially correct 128 ms 316 KB Output is partially correct
45 Correct 41 ms 1192 KB Output is correct
46 Correct 28 ms 368 KB Output is correct
47 Correct 31 ms 324 KB Output is correct
48 Correct 23 ms 404 KB Output is correct