oj.uz

답안 #1070731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070731 2024-08-22T17:23:25 Z Mihailo 드문 곤충 (IOI22_insects) C++17
10 / 100
 103 ms 700 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pll pair<long long, long long>
#define MOD 1000002022ll
#define xx first
#define yy second
using namespace std;
typedef long long ll;

void move_inside(int i);
void move_outside(int i);
int press_button();

vector<int> rep;
set<int> setrep;
int tip[10000], bp[10000];

int min_cardinality(int N) {
    for(int i=0; i<N; i++) {
        move_inside(i);
        if(press_button()>1) move_outside(i);
        else {
            rep.pb(i);
            setrep.insert(i);
        }
    }
    if(rep.size()>N/2) return 1;
    if(rep.size()>N/8) {
        ll rez=1, cnt=rep.size();
        while(true) {
            for(int i=0; i<rep.size(); i++) move_outside(rep[i]);
            rep.clear();
            for(int i=0; i<N; i++) {
                if(!setrep.count(i)) {
                    move_inside(i);
                    if(press_button()>1) move_outside(i);
                    else {
                        rep.pb(i);
                        setrep.insert(i);
                    }
                }
            }
            if(rep.size()<cnt) return rez;
            rez++;
        }
    }
    for(int i=0; i<rep.size(); i++) tip[rep[i]]=i;
    for(int i=0; i<rep.size(); i++) {
        if(i%2==0) move_outside(rep[i]);
    }
    for(int i=0; i<N; i++) {
        if(!setrep.count(i)) {
            move_inside(i);
            if(press_button()==2) tip[i]+=1;
            move_outside(i);
        }
    }
    for(int b=1; b<6; b++) {
        for(int i=0; i<rep.size(); i++) {
            if((i&(1<<(b-1)))&&(!(i&(1<<(b))))) move_outside(rep[i]);
            if((!(i&(1<<(b-1))))&&(i&(1<<(b)))) move_inside(rep[i]);
        }
        for(int i=0; i<N; i++) {
            if(!setrep.count(i)) {
                move_inside(i);
                if(press_button()==2) tip[i]+=(1<<b);
                move_outside(i);
            }
        }
    }
    for(int i=0; i<N; i++) bp[tip[i]]++;
    for(int i=0; i<N; i++) if(tip[i]>=rep.size()) while(true);
    ll rez=MOD;
    for(int i=0; i<rep.size(); i++) rez=min(rez, (ll)bp[i]);
    return rez;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:28:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |     if(rep.size()>N/2) return 1;
      |        ~~~~~~~~~~^~~~
insects.cpp:29:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |     if(rep.size()>N/8) {
      |        ~~~~~~~~~~^~~~
insects.cpp:32:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             for(int i=0; i<rep.size(); i++) move_outside(rep[i]);
      |                          ~^~~~~~~~~~~
insects.cpp:44:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   44 |             if(rep.size()<cnt) return rez;
      |                ~~~~~~~~~~^~~~
insects.cpp:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i=0; i<rep.size(); i++) tip[rep[i]]=i;
      |                  ~^~~~~~~~~~~
insects.cpp:49:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for(int i=0; i<rep.size(); i++) {
      |                  ~^~~~~~~~~~~
insects.cpp:60:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int i=0; i<rep.size(); i++) {
      |                      ~^~~~~~~~~~~
insects.cpp:73:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0; i<N; i++) if(tip[i]>=rep.size()) while(true);
      |                               ~~~~~~^~~~~~~~~~~~
insects.cpp:75:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i=0; i<rep.size(); i++) rez=min(rez, (ll)bp[i]);
      |                  ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 6 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 1 ms 680 KB Output is correct
12 Correct 9 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 6 ms 344 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 8 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 35 ms 344 KB Output is correct
24 Correct 7 ms 472 KB Output is correct
25 Correct 35 ms 344 KB Output is correct
26 Correct 54 ms 600 KB Output is correct
27 Correct 35 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 43 ms 448 KB Output is correct
30 Correct 35 ms 344 KB Output is correct
31 Correct 48 ms 600 KB Output is correct
32 Correct 43 ms 440 KB Output is correct
33 Correct 42 ms 700 KB Output is correct
34 Correct 38 ms 592 KB Output is correct
35 Correct 51 ms 592 KB Output is correct
36 Correct 44 ms 444 KB Output is correct
37 Correct 38 ms 600 KB Output is correct
38 Incorrect 30 ms 344 KB Wrong answer.
39 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 KB Output is correct
7 Partially correct 81 ms 436 KB Output is partially correct
8 Correct 6 ms 344 KB Output is correct
9 Partially correct 76 ms 676 KB Output is partially correct
10 Partially correct 78 ms 344 KB Output is partially correct
11 Partially correct 69 ms 432 KB Output is partially correct
12 Correct 10 ms 696 KB Output is correct
13 Partially correct 65 ms 428 KB Output is partially correct
14 Partially correct 67 ms 428 KB Output is partially correct
15 Partially correct 68 ms 424 KB Output is partially correct
16 Partially correct 87 ms 436 KB Output is partially correct
17 Partially correct 73 ms 444 KB Output is partially correct
18 Partially correct 79 ms 344 KB Output is partially correct
19 Partially correct 69 ms 672 KB Output is partially correct
20 Partially correct 103 ms 440 KB Output is partially correct
21 Partially correct 100 ms 592 KB Output is partially correct
22 Incorrect 84 ms 344 KB Wrong answer.
23 Halted 0 ms 0 KB -