oj.uz

답안 #1028785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028785 2024-07-20T08:38:44 Z Mardonbekhazratov 드문 곤충 (IOI22_insects) C++17
25 / 100
 247 ms 1248 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){
            if(l.size()==last){
                new_s.insert(x);
                continue;
            }
            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:28:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |             if(l.size()==last){
      |                ~~~~~~~~^~~~~~
insects.cpp:40:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |         if(l.size()!=last){
      |            ~~~~~~~~^~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 3 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 36 ms 600 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 28 ms 668 KB Output is correct
26 Correct 36 ms 468 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 10 ms 592 KB Output is correct
29 Correct 15 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 70 ms 344 KB Output is correct
32 Correct 53 ms 600 KB Output is correct
33 Correct 96 ms 344 KB Output is correct
34 Correct 59 ms 344 KB Output is correct
35 Correct 42 ms 344 KB Output is correct
36 Correct 39 ms 680 KB Output is correct
37 Correct 25 ms 344 KB Output is correct
38 Correct 11 ms 344 KB Output is correct
39 Correct 8 ms 488 KB Output is correct
40 Correct 7 ms 460 KB Output is correct
41 Correct 9 ms 344 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 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 Correct 134 ms 652 KB Output is correct
8 Correct 11 ms 436 KB Output is correct
9 Partially correct 90 ms 600 KB Output is partially correct
10 Partially correct 115 ms 592 KB Output is partially correct
11 Correct 19 ms 752 KB Output is correct
12 Correct 14 ms 344 KB Output is correct
13 Correct 39 ms 560 KB Output is correct
14 Correct 18 ms 800 KB Output is correct
15 Partially correct 189 ms 600 KB Output is partially correct
16 Partially correct 180 ms 752 KB Output is partially correct
17 Partially correct 144 ms 1116 KB Output is partially correct
18 Partially correct 202 ms 500 KB Output is partially correct
19 Partially correct 156 ms 436 KB Output is partially correct
20 Partially correct 153 ms 456 KB Output is partially correct
21 Partially correct 90 ms 344 KB Output is partially correct
22 Partially correct 61 ms 844 KB Output is partially correct
23 Correct 16 ms 1052 KB Output is correct
24 Correct 15 ms 344 KB Output is correct
25 Correct 21 ms 684 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Partially correct 75 ms 628 KB Output is partially correct
28 Correct 31 ms 1248 KB Output is correct
29 Partially correct 120 ms 592 KB Output is partially correct
30 Incorrect 247 ms 344 KB Too many queries.
31 Halted 0 ms 0 KB -