oj.uz

Submission #1054110

# Submission time Handle Problem Language Result Execution time Memory
1054110 2024-08-12T06:32:11 Z 팩트는 슼보가 정상화되고 있다는 거임(#11106) Koala Game (APIO17_koala) C++14
19 / 100
 8 ms 456 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int minValue(int N, int W) {
    // TODO: Implement Subtask 1 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    int B[100];
    int R[100];
    memset(B,0,sizeof(B));
    B[0]=1;
    playRound(B,R);
    if (R[0]<=1) {
        return 0;
    }
    for(int i=1;i<N;i++) {
        if (R[i]==0) {
            return i;
        }
    }
    return 0;
}

int B[100];
int R[100];
bool chk[100];

int maxValue(int N, int W) {
    for(int i=0;i<100;i++) {
        B[i]=1;
    }
    playRound(B,R);
    memset(chk,0,sizeof(chk));
    for(int i=0;i<100;i++) {
        if (R[i]==2) {
            chk[i]=true;
        }
    }
    for(int i=0;i<100;i++) {
        if (chk[i]) {
            B[i]=2;
        }
        else {
            B[i]=0;
        }
    }
    playRound(B,R);
    for(int i=0;i<100;i++) {
        if (chk[i]&&R[i]<=2) {
            chk[i]=false;
        }
    }
    for(int i=0;i<100;i++) {
        if (chk[i]) {
            B[i]=4;
        }
        else {
            B[i]=0;
        }
    }
    playRound(B,R);
    for(int i=0;i<100;i++) {
        if (chk[i]&&R[i]<=4) {
            chk[i]=false;
        }
    }
    for(int i=0;i<100;i++) {
        if (chk[i]) {
            B[i]=11;
        }
        else {
            B[i]=0;
        }
    }
    playRound(B,R);
    for(int i=0;i<100;i++) {
        if (chk[i]&&R[i]<=11) {
            chk[i]=false;
        }
        if (chk[i]) {
            return i;
        }
    }
    return 0;
}

int greaterValue(int N, int W) {
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

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

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -