Submission #59618

#	Time	Username	Problem	Language	Result	Execution time	Memory
59618		duality	Koala Game (APIO17_koala)	C++11	100 / 100	93 ms	880 KiB

koala

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#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);
    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) 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;
    if (W == 2*N) {
        for (i = 0; i < N; i++) B[i] = 0;
        B[a] = B[b] = N;
        playRound(B,R);
        return R[a] < R[b];
    }
    for (i = 0; i < N; i++) B[i] = 0;
    B[a] = B[b] = 6;
    playRound(B,R);
    if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
    else if ((R[a] == 0) && (R[b] == 0)) {
        for (i = 0; i < N; i++) B[i] = 0;
        B[a] = B[b] = 3;
        playRound(B,R);
        if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
        for (i = 0; i < N; i++) B[i] = 0;
        B[a] = B[b] = 1;
        playRound(B,R);
        return R[b] > 0;
    }
    else {
        for (i = 0; i < N; i++) B[i] = 0;
        B[a] = B[b] = 8;
        playRound(B,R);
        return R[b] > 0;
    }
}
int greaterValue(int N,int W) {
    return compare(0,1,N,W);
}

int n,w;
int inv[100],temp[100];
int mysort(int *arr,int l,int r) {
    if (l == r) return 0;
    int i,j;
    for (i = 0; i < n; i++) B[i] = 0;
    int val = 1,e = r-l+1;
    for (i = 1; i <= w/(r-l+1); i++) {
        int m1 = 0,m2 = 0,ne = r-l+1;
        for (j = 0; j <= n-(r-l+1); j++) {
            int x = min((w-j)/(i+1),r-l+1);
            int sum = (2*n-min(j,n-r-1)+1)*min(j,n-r-1)/2;
            sum += (2*l-(j-min(j,n-r-1))+1)*(j-min(j,n-r-1))/2;
            sum += (2*r-x+3)*x/2;
            if ((sum > m1) || ((sum == m1) && (j+x > m2))) {
                m1 = sum,m2 = j+x;
                ne = max(x,r-l+1-x);
            }
        }
        if (ne < e) e = ne,val = i;
    }
    for (i = l; i <= r; i++) B[arr[i]] = val;
    playRound(B,R);
    j = 0;
    for (i = l; i <= r; i++) {
        if (R[arr[i]] <= B[arr[i]]) temp[j++] = arr[i];
    }
    int m = j;
    for (i = l; i <= r; i++) {
        if (R[arr[i]] > B[arr[i]]) temp[j++] = arr[i];
    }
    for (i = l; i <= r; i++) arr[i] = temp[i-l];
    mysort(arr,l,l+m-1),mysort(arr,l+m,r);
    return 0;
}
void allValues(int N,int W,int *P) {
    n = N,w = W;
    int i;
    for (i = 0; i < N; i++) inv[i] = i;
    mysort(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:93:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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