oj.uz

답안 #909467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
909467 2024-01-17T08:20:19 Z MinhAnhnd Coreputer (IOI23_coreputer) C++17
0 / 100
 1 ms 344 KB 
#include "coreputer.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> cut(int N, std::vector<int> m){
    while(!m.empty()&&(*(m.rbegin())>=N)){
        m.pop_back();
    }
    return m;
}
std::vector<int> malfunctioning_cores(int N) {

    vector<int> a;
    vector<int> larger;
    vector<int> smaller;
    vector<int> b;
    for (int i = 0;i<=N-1;i++){
        b.push_back(0);
    }

    for (int i = 0;i<=min(7,N-1);i++){
        a.push_back(i);
    }
    int half = run_diagnostic(a);
    int state = abs(half);
    a.clear();

    if (half == 1){
        for (int i = 0;i<=min(7,N-1);i++){
        larger.push_back(i);
        }
    } else{
        for (int i = 8;i<=min(15,N-1);i++){
        larger.push_back(i);
        }
    }

    int fourth = run_diagnostic(cut(N,vector<int>(larger.begin(), larger.begin()+4)));
    int eight;
    int onesix;
    int pos;
    if(state!=fourth){
        eight = run_diagnostic(cut(N,vector<int>(larger.begin(), larger.begin()+2)));
        if(eight!=state){
            onesix = run_diagnostic(cut(N,vector<int>(larger.begin(), larger.begin()+1)));
            pos = 2;
            if(onesix!=state){
                pos = 1;
            }
        }
        else{
            onesix = run_diagnostic(cut(N,vector<int>(larger.begin(), larger.begin()+3)));
            pos = 4;
            if(onesix!=state){
                pos = 3;
            }
        }
    }
    else{
        eight = run_diagnostic(cut(N,vector<int>(larger.begin(), larger.begin()+6)));
        if(eight!=state){
            onesix = run_diagnostic(cut(N,vector<int>(larger.begin(), larger.begin()+5)));
            pos = 6;
            if(onesix!=state){
                pos = 5;
            }
        }
        else{
            onesix = run_diagnostic(cut(N,vector<int>(larger.begin(), larger.begin()+7)));
            pos = 8;
            if(onesix!=state){
                pos = 7;
            }
        }
    }



    for (int i = 0;i<=N-1;i++){
        b.push_back(0);
    }
    b[pos-1] = 1;
	return b;
}

Subtask #1
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB invalid array
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB invalid array
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB invalid array
2 Halted 0 ms 0 KB -