oj.uz

답안 #978385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978385 2024-05-09T07:42:09 Z yhkhoo 코알라 (APIO17_koala) C++17
19 / 100
 11 ms 600 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[N], r[N];
    memset(b, 0, N*sizeof(int));
    *b = 1;
    playRound(b, r);
    for(int i=0; i<N; i++){
		if(i[r] <= i[b]){
			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 b[N], r[N];
	fill(b, b+N, 1);
	playRound(b, r);
	for(int i=0; i<N; i++){
		if(i[r] > i[b]){
			i[b] = 2;
		}
		else{
			i[b] = 0;
		}
	}
	playRound(b, r);
	for(int i=0; i<N; i++){
		if(i[b] == 2 && i[r] > i[b]){
			i[b] = 4;
		}
		else{
			i[b] = 0;
		}
	}
	playRound(b, r);
	for(int i=0; i<N; i++){
		if(i[b] == 4 && i[r] > i[b]){
			i[b] = 11;
		}
		else{
			i[b] = 0;
		}
	}
	playRound(b, r);
	for(int i=0; i<N; i++){
		if(i[b] == 11 && i[r] > i[b]){
			return i;
		}
	}
    return -1;
}

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

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 596 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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