oj.uz

Submission #391645

# Submission time Handle Problem Language Result Execution time Memory
391645 2021-04-19T13:02:32 Z BorisBarca Koala Game (APIO17_koala) C++14
4 / 100
 8 ms 312 KB 
#include <stdio.h>
#include <stdlib.h>
//#include <koala.h>
#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)

int r[105];
int b[105];

void playRound(int *B, int *R);

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.
    for (int i = 0; i < N; ++i)
	    b[i] = 0;
    b[0] = 1;
    playRound(b, r);
    if (r[0] == 0)
	    return 0;
    for (int i = 0; i < N; ++i)
	    if (r[i] == 0)
		    return i;
    return 0;
}

int maxValue(int N, int W) {
    // todo: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask
    int n = N;
    REP(i, n)
	    b[i] = 1;
	
    while (true){
	    playRound(b, r);
	    memset(b, 0, sizeof b);
	    int maxi = 0, cnt = 0;
	    REP(i, n){
		    if (r[i] > maxi)
			    maxi = r[i], cnt = 1;
		    else if (r[i] == maxi)
			    cnt++;
	    }
	    if (cnt == 1){
		    REP(i, n)
			    if (r[i] == maxi)
				    return i;
	    }
	    REP(i, n)
		    b[i] = r[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 6 ms 204 KB Output is correct
2 Correct 6 ms 200 KB Output is correct
3 Correct 6 ms 200 KB Output is correct
4 Correct 8 ms 312 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 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 200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

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