oj.uz

답안 #810417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
810417 2023-08-06T09:29:18 Z oscar1f 코알라 (APIO17_koala) C++17
24 / 100
 166 ms 432 KB 
#include<bits/stdc++.h>
#include "koala.h"

using namespace std;

vector<int> init(100);

vector<int> jouer(vector<int> a) {
    vector<int> b(100);
    playRound(a.data(),b.data());
    return b;
}

int minValue(int N, int W) {
    vector<int> rep(N),quest(N);
    quest[0]=1;
    rep=jouer(quest);
    for (int i=1;i<N;i++) {
        if (rep[i]==0) {
            return i;
        }
    }
    return 0;
}

int maxValue(int N, int W) {
    vector<int> rep(N),quest(N);
    vector<int> listeGrand,nouv;
    int nbMis;
    for (int i=0;i<N;i++) {
        quest[i]=1;
        listeGrand.push_back(i);
    }
    vector<int> tailleTour={1,2,4,11};
    reverse(tailleTour.begin(),tailleTour.end());
    while (listeGrand.size()>1) {
        /*cout<<listeGrand.size()<<" : ";
        for (int i:listeGrand) {
            cout<<i<<" ";
        }
        cout<<endl;*/
        nbMis=tailleTour.back();
        tailleTour.pop_back();
        nouv.clear();
        quest=init;
        for (int i:listeGrand) {
            quest[i]=nbMis;
        }
        rep=jouer(quest);
        for (int i:listeGrand) {
            if (rep[i]>nbMis) {
                nouv.push_back(i);
            }
        }
        listeGrand=nouv;
    }
    return listeGrand.back();
}

int greaterValue(int N, int W) {
    vector<int> rep(N),quest(N);
    for (int i=1;i<=13;i++) {
        quest[0]=i;
        quest[1]=i;
        rep=jouer(quest);
        if (rep[0]>i and rep[1]<=i) {
            return 0;
        }
        if (rep[1]>i and rep[0]<=i) {
            return 1;
        }
    }
    return 42;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 316 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 3 ms 208 KB Output is correct
4 Correct 5 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 320 KB Output is correct
2 Correct 12 ms 324 KB Output is correct
3 Correct 10 ms 320 KB Output is correct
4 Correct 14 ms 316 KB Output is correct

Subtask #3
5.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 161 ms 324 KB Output is partially correct
2 Partially correct 138 ms 316 KB Output is partially correct
3 Partially correct 135 ms 320 KB Output is partially correct
4 Partially correct 166 ms 328 KB Output is partially correct
5 Partially correct 136 ms 320 KB Output is partially correct
6 Partially correct 122 ms 320 KB Output is partially correct
7 Partially correct 118 ms 328 KB Output is partially correct
8 Partially correct 125 ms 432 KB Output is partially correct
9 Partially correct 166 ms 328 KB Output is partially correct
10 Partially correct 124 ms 304 KB Output is partially correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -