oj.uz

답안 #59384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59384 2018-07-21T22:50:22 Z duality 코알라 (APIO17_koala) C++11
33 / 100
 158 ms 808 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#include "koala.h"

int B[100],R[100];
int minValue(int N, int W) {
    int i;
    for (i = 0; i < N; i++) B[i] = 0;
    B[0] = 1;
    playRound(B,R);
    for (i = 0; i < N; i++) {
        if (R[i] == 0) return i;
    }
    return 0;
}

int maxValue(int N, int W) {
    int i;
    for (i = 0; i < N; i++) B[i] = 1;
    playRound(B,R);
    int c = 0;
    for (i = 0; i < N; i++) {
        if (R[i] == 2) B[i] = 2;
        else B[i] = 0;
    }
    playRound(B,R);
    for (i = 0; i < N; i++) {
        if (R[i] == 3) c++,B[i] = 4;
        else B[i] = 0;
    }
    playRound(B,R);
    for (i = 0; i < N; i++) {
        if (R[i] == 5) B[i] = 11;
        else B[i] = 0;
    }
    playRound(B,R);
    for (i = 0; i < N; i++) {
        if (R[i] == 12) return i;
    }
}

int compare(int a,int b,int N,int W) {
    int i,j;
    for (j = 0; j < N; j++) B[i] = 0;
    B[a] = B[b] = 1;
    playRound(B,R);
    if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
    for (j = 0; j < N; j++) B[i] = 0;
    B[a] = B[b] = 11;
    playRound(B,R);
    if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
    for (j = 0; j < N; j++) B[i] = 0;
    B[a] = B[b] = 3;
    playRound(B,R);
    if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
    for (j = 0; j < N; j++) B[i] = 0;
    B[a] = B[b] = 6;
    playRound(B,R);
    if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
    return -1;
}
int greaterValue(int N, int W) {
    return compare(0,1,N,W);
}

int n,w;
int inv[100];
bool comp(int a,int b) {
    if (a == b) return 0;
    else return compare(a,b,n,w);
}
void allValues(int N, int W, int *P) {
    n = N,w = W;
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        int i;
        for (i = 0; i < N; i++) inv[i] = i;
        random_shuffle(inv,inv+N);
        sort(inv,inv+N,comp);
        for (i = 0; i < N; i++) P[inv[i]] = i+1;
    }
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int compare(int, int, int, int)':
koala.cpp:49:9: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int i,j;
         ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 12 ms 456 KB Output is correct
3 Correct 8 ms 456 KB Output is correct
4 Correct 11 ms 512 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 512 KB Output is correct
2 Correct 19 ms 548 KB Output is correct
3 Correct 19 ms 632 KB Output is correct
4 Correct 19 ms 632 KB Output is correct

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 115 ms 684 KB Output is partially correct
2 Partially correct 128 ms 684 KB Output is partially correct
3 Partially correct 101 ms 684 KB Output is partially correct
4 Partially correct 124 ms 760 KB Output is partially correct
5 Partially correct 104 ms 760 KB Output is partially correct
6 Partially correct 136 ms 760 KB Output is partially correct
7 Partially correct 158 ms 808 KB Output is partially correct
8 Partially correct 101 ms 808 KB Output is partially correct
9 Partially correct 104 ms 808 KB Output is partially correct
10 Partially correct 113 ms 808 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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