oj.uz

답안 #838220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
838220 2023-08-26T11:08:34 Z Dremix10 드문 곤충 (IOI22_insects) C++17
10 / 100
 316 ms 300 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
const int N = 3e5+5;
const int MOD = 1e9+7;
const ll INF = 1e18+5;
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto v : x)cerr<<v<<", ";cerr<<"}"<<endl;
    #define p2(x,y) cerr<<#x<<","<<#y<<" = "<<x<<" ,"<<y<<endl;
#else
    #define p(x) {}
    #define pv(x) {}
    #define p2(x,y) {}
#endif



int min_cardinality(int n) {

    int i,ret = 1;
    vector<int> p1,p2,p3;

    for(i=0;i<n;i++){
        move_inside(i);
        int x = press_button();
        if(x == 1){
            p1.push_back(i);
        }
        else{
            assert(x == 2);
            p2.push_back(i);
            move_outside(i);
        }
    }

    while(1){


        /// we have p1 with all the colors (uniquely)
        vector<int> neo;
        pv(p1)
        pv(p2)

        for(auto v : p2){
            move_inside(v);
            int x = press_button();
            if(x == ret + 1){
                neo.push_back(v);
            }
            else{
                assert(x == ret + 2);
                p3.push_back(v);
                move_outside(v);
            }
        }

        p2 = neo;
        pv(p2)
        pv(p3)
        /// we have p2 with all colors that have +1 occurence
        assert(p2.size() <= p1.size());
        if(p2.size() < p1.size())return ret;
        ret ++;

        /// in the machine atm there are all of the colours 2 times each

        p1 = p2;
        p2 = p3;
        p3.clear();
    }
    
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 147 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 11 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 4 ms 296 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 35 ms 208 KB Output is correct
15 Correct 21 ms 208 KB Output is correct
16 Correct 17 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 6 ms 300 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 4 ms 296 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Incorrect 316 ms 208 KB Too many queries.
24 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Incorrect 214 ms 208 KB Too many queries.
8 Halted 0 ms 0 KB -