oj.uz

Submission #909851

# Submission time Handle Problem Language Result Execution time Memory
909851 2024-01-17T13:35:53 Z MinhAnhnd Coreputer (IOI23_coreputer) C++17
20 / 100
 1 ms 596 KB 
#include "coreputer.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> cut(int N, std::vector<int> m){
    std::vector<int> output;
    int maxi = -1;
    for (auto i:m){
        if (maxi>=i) continue;
        maxi = i;

        if((i<N) && (i>=0)){

            output.push_back(i);

        }
    }
    //for (auto i:output){cout<<i;}
    //cout<<endl;2
    return output;
}
std::vector<int> cuttee(int N, std::vector<int> m,int yes){
    std::vector<int> output;
    int maxi = -1;
    for (auto i:m){
        if (maxi>=i) continue;
        maxi = i;

        if((i<N) && (i>=0)){

            output.push_back(i);

        }
    }
    if (yes<N) output.push_back(yes);
    //for (auto i:output){cout<<i;}
    //cout<<endl;2
    return output;
}
std::vector<int> cutter(int N, std::vector<int> m,int no){
    std::vector<int> output;
    int maxi = -1;
    for (auto i:m){
        if (maxi>=i) continue;
        maxi = i;

        if((i<N) && (i>=0) && (i!=no)){

            output.push_back(i);

        }
    }
//for (auto i:output){cout<<i;}
    //cout<<endl;
    return output;
}
std::vector<int> malfunctioning_cores(int N) {
    long delta = 0;
    long delta2 = 0;
    vector<int> a;
    vector<int> larger;
    vector<int> smaller;
    vector<int> b;

    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++){
        delta = 8;
        delta2 = -8;
        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[delta+pos-1] = 1;
    long ileft = 1;
    long illeft = 0;
    long total = 0;
    for (int i = pos+1;i<=8;i++){
        vector<int> funnyright = vector<int>(larger.begin(), larger.begin()+pos-1);
        funnyright.push_back(larger[i-1]);
        int temp = run_diagnostic(cut(N,funnyright));
        if(temp==state) {b[delta+i-1] = 1;ileft++;}
    }
    vector<int> funnyright = vector<int>(larger.begin(), larger.begin()+pos);
    for (int i = 0;i<pos-1;i++){
        int temp = run_diagnostic(cutter(N,funnyright,larger[i]));
        if(temp!=state) {b[delta+i] = 1;ileft++;illeft++;}
    }
    if (state==0) total = illeft*2 + 2;
    else if ((fourth==0)||(eight==0)||(onesix==0)){
        total = illeft*2;
    } else{
        total = illeft*2 + 1;
    }
    //total = total/2;
    vector<int> funnyleft = vector<int>(larger.begin(), larger.begin()+pos-1);
    for (int i = 8;i<=14;i++){
        int temp = run_diagnostic(cuttee(N,funnyleft,i+delta2));
        if(temp==state) {b[i+delta2] = 1;ileft++;}
    }
    if(N==16 && (ileft<total)) b[15+delta2]=1;
	return b;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #2
0.0 / 40.0

# Verdict Execution time Memory 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 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Incorrect 0 ms 344 KB Incorrect
27 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 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 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Incorrect 0 ms 344 KB Incorrect
30 Halted 0 ms 0 KB -