oj.uz

Submission #1028781

# Submission time Handle Problem Language Result Execution time Memory
1028781 2024-07-20T08:36:13 Z Mardonbekhazratov Rarest Insects (IOI22_insects) C++17
10 / 100
 230 ms 744 KB 
#include "insects.h"

#include <vector>
#include <set>

using namespace std;

int min_cardinality(int N){
    set<int>s;
    vector<int>l;
    for(int i=0;i<N;i++){
        move_inside(i);
        l.push_back(i);
        if(press_button()>1){
            move_outside(i);
            s.insert(i);
            l.pop_back();
        }
    }
    int ans=1,last=l.size();
    while(l.size()>0){
        move_outside(l.back());
        l.pop_back();
    }
    while(true){
        set<int>new_s;
        for(int x:s){
            move_inside(x);
            l.push_back(x);
            if(press_button()>1){
                move_outside(x);
                new_s.insert(x);
                l.pop_back();
            }
        }
        if(l.size()!=last){
            return ans;
        }
        while(l.size()>0){
            move_outside(l.back());
            l.pop_back();
        }
        swap(new_s,s);
        ans++;
    }
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:36:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |         if(l.size()!=last){
      |            ~~~~~~~~^~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 84 ms 436 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 440 KB Output is correct
13 Correct 2 ms 428 KB Output is correct
14 Correct 24 ms 428 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 424 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Incorrect 200 ms 600 KB Too many queries.
24 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 344 KB Output is correct
7 Incorrect 230 ms 744 KB Too many queries.
8 Halted 0 ms 0 KB -