oj.uz

Submission #107375

# Submission time Handle Problem Language Result Execution time Memory
107375 2019-04-23T14:04:24 Z oolimry Koala Game (APIO17_koala) C++14
37 / 100
 79 ms 768 KB 

void playRound(int *B, int *R);
//#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[N];
    int R[N];
    fill(B,B+N,0);
    fill(R,R+N,0);
    B[0] = 1;
    playRound(B,R);
    for(int i = 0;i < N;i++){
        if(R[i] == 0) return i;
    }
}

int maxValue(int N, int W) {
    int B1[N], B2[N], B3[N], B4[N];
    int R1[N], R2[N], R3[N], R4[N];
    for(int i = 0;i < N;i++){
        B1[i] = 1;
    }
    playRound(B1,R1);
    for(int i = 0;i < N;i++){
        B2[i] = R1[i];
    }
    playRound(B2,R2);
    for(int i = 0;i < N;i++){
        //printf("%d ",R2[i]);
        if(R2[i] == 3) B3[i] = 4;
        else B3[i] = 0;
    }
    playRound(B3,R3);
    for(int i = 0;i < N;i++){
        //printf("%d ",R3[i]);
        if(R3[i] == 5) B4[i] = 11;
        else B4[i] = 0;
    }
    playRound(B4,R4);
    for(int i = 0;i < N;i++){
        //printf("%d ",R4[i]);
        if(R4[i] == 12) return i;
    }
    return 0;
}

int greaterValue(int N, int W) {
    int B[N];
    int R[N];

    fill(B,B+N,0);
    B[0] = 4;
    B[1] = 4;
    playRound(B,R);
    //for(int i = 0;i < N;i++) printf("%d ",R[i]);
    if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
    else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
    else if(R[0] == 0 && R[1] == 0){
        fill(B,B+N,0);
        B[0] = 1;
        B[1] = 1;
        playRound(B,R);
        if(R[0] == 0) return 1;
        if(R[1] == 0) return 0;

        fill(B,B+N,0);
        B[0] = 3;
        B[1] = 3;
        playRound(B,R);
        if(R[0] == 0) return 1;
        if(R[1] == 0) return 0;


    }

    fill(B,B+N,0);
    B[0] = 7;
    B[1] = 7;
    playRound(B,R);
    //for(int i = 0;i < N;i++) printf("%d ",R[i]);
    if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
    else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
    else if(R[0] == 0 && R[1] == 0){
        fill(B,B+N,0);
        B[0] = 5;
        B[1] = 5;
        playRound(B,R);
        if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
        else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
    }
    else{
        fill(B,B+N,0);
        B[0] = 10;
        B[1] = 10;
        playRound(B,R);
        if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
        else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
    }







    return 1;
}

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.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:21:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 19 ms 384 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 16 ms 512 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 428 KB Output is correct
2 Correct 79 ms 424 KB Output is correct
3 Correct 73 ms 760 KB Output is correct
4 Correct 61 ms 632 KB Output is correct
5 Correct 68 ms 768 KB Output is correct
6 Correct 58 ms 640 KB Output is correct
7 Correct 58 ms 640 KB Output is correct
8 Correct 69 ms 632 KB Output is correct
9 Correct 74 ms 704 KB Output is correct
10 Correct 65 ms 504 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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