Submission #59391

#	Time	Username	Problem	Language	Result	Execution time	Memory
59391		duality	코알라 (APIO17_koala)	C++11	54 / 100	161 ms	928 KiB

koala

#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[j] = 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[j] = 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[j] = 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[j] = 0;
    B[a] = B[b] = 6;
    playRound(B,R);
    if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
    for (i = 1; i <= 14; i++) {
        for (j = 0; j < N; j++) B[j] = 0;
    B[a] = B[b] = i;
    playRound(B,R);
    if ((R[a] > 0) != (R[b] > 0)) {
        cout<<i<<" works"<<endl;
    }
    }
    cout<<"ERROR"<<endl;
    exit(0);
    return -1;
}
int greaterValue(int N, int W) {
    return compare(0,1,N,W);
}

int n,w;
int inv[100],temp[100];
bool comp(int a,int b) {
    if (a == b) return 0;
    else return compare(a,b,n,w);
}
int mergesort(int *arr,int l,int r) {
    if (l == r) return 0;
    int m = (l+r) / 2;
    mergesort(arr,l,m),mergesort(arr,m+1,r);
    int i = l,j = m+1,k = 0;
    while ((i <= m) || (j <= r)) {
        if (i > m) temp[k++] = arr[j++];
        else if (j > r) temp[k++] = arr[i++];
        else if (comp(arr[i],arr[j])) temp[k++] = arr[i++];
        else temp[k++] = arr[j++];
    }
    for (i = 0; i < k; i++) arr[l+i] = temp[i];
    return 0;
}
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);
        mergesort(inv,0,N-1);
        for (i = 0; i < N; i++) P[inv[i]] = i+1;
    }
}

Compilation message (stderr)

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

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 14 / 18
• Subtask 4: 0 / 10
• Subtask 5: 21 / 53