Submission #1209677

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209677		k1r1t0	Koala Game (APIO17_koala)	C++20	86 / 100	41 ms	460 KiB

koala

#include <bits/stdc++.h>

using namespace std;

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

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

int maxValue(int N, int W) {
	int B[N], R[N];
	vector<int> good;
	for (int i = 0; i < N; i++)
		good.push_back(i);
	while (good.size() > 1) {
		int cnt = (int) good.size();
		int val = N / cnt;
		for (int i = 0; i < N; i++)
			B[i] = 0;
		for (int k : good)
			B[k] = val;
		good.clear();
		playRound(B, R);
		for (int i = 0; i < N; i++)
			if (R[i] > B[i] && B[i] > 0)
				good.push_back(i);
	}
	return good[0];
}

int greaterValue(int N, int W) {
	int B[N], R[N];
	for (int i = 0; i < N; i++)
		B[i] = 0;
	vector<int> tt = {1, 3, 6, 8};
	int l = 0, r = 3;
	while (l <= r) {
		int mid = (l + r) / 2;
		B[0] = B[1] = tt[mid];
		playRound(B, R);
		bool w0 = (R[0] > B[0]);
		bool w1 = (R[1] > B[1]);
		if (w0 != w1) {
			if (w0) return 0;
			else return 1;
		}
		if (!w0) r = mid - 1;
		else l = mid + 1;
	}
	return -1;
}

const int T = 100;

bool comp(int a, int b) {
	int B[T], R[T];
	for (int i = 0; i < T; i++)
		B[i] = 0;
	B[a] = 100;
	B[b] = 100;
	playRound(B, R);
	if (R[a] > 100) return true;
	return false;
}

void allValues(int N, int W, int *P) {
	if (W == 2*N) {
		vector<int> p;
		for (int i = 0; i < N; i++) {
			int l = 0, r = (int) p.size();
			while (l < r) {
				int mid = (l + r) / 2;
				if (!comp(i, p[mid])) r = mid;
				else l = mid + 1;
			}
			vector<int> np;
			for (int j = 0; j < l; j++)
				np.push_back(p[j]);
			np.push_back(i);
			for (int j = l; j < i; j++)
				np.push_back(p[j]);
			p = np;
		}
		for (int i = 0; i < N; i++)
			P[p[i]] = i + 1;
	} else {
		int B[N], R[N];
		for (int i = 0; i < N; i++)
			P[i] = -1;
		for (int t = N; t >= 1; t--) {
			vector<int> good;
			for (int i = 0; i < N; i++)
				if (P[i] == -1)
					good.push_back(i);
			while (good.size() > 1) {
				int cnt = (int) good.size();
				int val = min(N / cnt, (int) sqrt(2 * (t - cnt + 1)));
				for (int i = 0; i < N; i++)
					B[i] = 0;
				for (int k : good)
					B[k] = val;
				good.clear();
				playRound(B, R);
				for (int i = 0; i < N; i++)
					if (R[i] > B[i] && B[i] > 0)
						good.push_back(i);
			}
			P[good[0]] = t;
		}
	}
}

/*
#include <stdio.h>
#include <stdlib.h>

static int N, W;
static int P[105];

static int maxQueries = 3200;
static int numQueries;

static void runGame(int F);
static void grader();

int main() {
    grader();
    return 0;
}

void playRound(int *B, int *R) {
    int i, j;

    int S = 0;
    for (i=0;i<N;++i) {
        if ( !(B[i] >= 0 && B[i] <= W) ) {
            printf("Invalid query.\n");
            exit(0);
        }
        S += B[i];
    }
    if (S > W) {
        printf("Invalid query.\n");
        exit(0);
    }

    numQueries++;
    if (numQueries > maxQueries) {
        printf("Too many queries.\n");
        exit(0);
    }

    int cache[2][205];
    int num[2][205];
    char taken[105][205];

    for (i=0;i<205;++i) {
        cache[1][i] = 0;
        num[1][i] = 0;
    }

    for (i=0;i<N;++i) {
        int v = B[i]+1;
        int ii = i&1;
        int o = ii^1;
        for (j=0;j<=W;++j) {
            cache[ii][j] = cache[o][j];
            num[ii][j] = num[o][j];
            taken[i][j] = 0;
        }
        for (j=W;j>=v;--j) {
            int h = cache[o][j-v] + P[i];
            int hn = num[o][j-v] + 1;
            if (h > cache[ii][j] || (h == cache[ii][j] && hn > num[ii][j])) {
                cache[ii][j] = h;
                num[ii][j] = hn;
                taken[i][j] = 1;
            } else {
                taken[i][j] = 0;
            }
        }
    }

    int cur = W;
    for (i=N-1;i>=0;--i) {
        R[i] = taken[i][cur] ? (B[i] + 1) : 0;
        cur -= R[i];
    }
}

static void runGame(int F) {
    int i;

    scanf("%d %d",&N,&W);
    for (i=0;i<N;++i) {
        scanf("%d",&P[i]);
    }

    numQueries = 0;
    if (F == 1) {
        printf("%d\n", minValue(N, W));
    } else if (F == 2) {
        printf("%d\n", maxValue(N, W));
    } else if (F == 3) {
        printf("%d\n", greaterValue(N, W));
    } else if (F == 4) {
        int userP[105];
        allValues(N, W, userP);
        for (i=0;i<N;i++) {
            printf("%d ",userP[i]);
        }
        printf("\n");
    }
    printf("Made %d calls to playRound.\n", numQueries);
}

static void grader() {
    int i;

    int F, G;
    scanf("%d %d",&F,&G);

    for (i=0;i<G;i++) {
        runGame(F);
    }
}
//*/

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