oj.uz

답안 #49021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49021 2018-05-21T10:15:22 Z faishol27 사육제 (CEOI14_carnival) C++14
20 / 100
 89 ms 672 KB 
#include <bits/stdc++.h>
using namespace std;

#define PUB push_back
#define POB pop_back

int N, respon, cntSet, bykSet, parent[155];
bool isCheck[155][155];
vector<int>sameSet[155];

void init(){
    memset(isCheck, 0, sizeof isCheck);
    
    for(int i=1;i<155;i++){
        isCheck[i][i] = 1;
        parent[i] = i;
        sameSet[i].PUB(i);
    }

    cntSet = N;

    cout << N;
    for(int i=1;i<=N;i++){
        cout << " " << i;
    }
    cout << endl << flush;

    cin >> bykSet;
}

void moveSet(int ke, int dari){
    for(int elm:sameSet[dari]){
        parent[elm] = ke;
        sameSet[ke].PUB(elm);
    }

    sameSet[dari].clear();
}

void compressSet(){
    for(int i=1;i<=bykSet;i++){
        if(sameSet[i].empty()){
            for(int j=i+1;j<=N;j++){
                if(!sameSet[j].empty()){
                    for(int elm:sameSet[j]){
                        parent[elm] = i;
                        sameSet[i].PUB(elm);
                    }
                    sameSet[j].clear();
                    
                    break;
                }
            }
        }
    }
}

int main(){
    cin >> N;

    init();
    while(bykSet != cntSet){
        for(int i=1;i<=N && bykSet != cntSet;i++){
            if(sameSet[parent[i]].empty()) continue;

            for(int j=i+1;j<=N && bykSet != cntSet;j++){
                if(sameSet[parent[j]].empty()) continue;
                if(isCheck[parent[i]][parent[j]]) continue;

                isCheck[parent[i]][parent[j]] = 1;
                isCheck[parent[j]][parent[i]] = 1;
                
                cout << 2 << " " << sameSet[parent[i]].front() << " " << sameSet[parent[j]].front() << endl << flush;
                cin >> respon;
                if(respon == 1){
                    moveSet(parent[i], parent[j]);
                    cntSet--;
                    break;
                }
            }
        }
    }

    compressSet();

    cout << 0;
    for(int i=1;i<=N;i++) cout << " " << parent[i];
    cout << endl << flush;
}

Subtask #1
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 248 KB Output is correct
2 Correct 23 ms 308 KB Output is correct
3 Partially correct 43 ms 512 KB Partially correct
4 Partially correct 49 ms 512 KB Partially correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 14 ms 600 KB Output is correct

Subtask #2
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 15 ms 600 KB Output is correct
3 Partially correct 34 ms 600 KB Partially correct
4 Partially correct 56 ms 600 KB Partially correct
5 Correct 22 ms 600 KB Output is correct
6 Correct 10 ms 600 KB Output is correct
7 Correct 10 ms 600 KB Output is correct

Subtask #3
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Partially correct 36 ms 672 KB Partially correct
4 Partially correct 73 ms 672 KB Partially correct
5 Correct 16 ms 672 KB Output is correct
6 Correct 14 ms 672 KB Output is correct
7 Correct 26 ms 672 KB Output is correct

Subtask #4
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 672 KB Output is correct
2 Correct 4 ms 672 KB Output is correct
3 Partially correct 49 ms 672 KB Partially correct
4 Partially correct 81 ms 672 KB Partially correct
5 Partially correct 28 ms 672 KB Partially correct
6 Partially correct 41 ms 672 KB Partially correct
7 Correct 21 ms 672 KB Output is correct

Subtask #5
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 672 KB Output is correct
2 Correct 7 ms 672 KB Output is correct
3 Partially correct 56 ms 672 KB Partially correct
4 Partially correct 37 ms 672 KB Partially correct
5 Partially correct 47 ms 672 KB Partially correct
6 Partially correct 47 ms 672 KB Partially correct
7 Partially correct 89 ms 672 KB Partially correct