oj.uz

Submission #1054131

# Submission time Handle Problem Language Result Execution time Memory
1054131 2024-08-12T06:44:14 Z 정민찬(#11058) Koala Game (APIO17_koala) C++14
63 / 100
 31 ms 476 KB 
#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

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

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

int maxValue(int N, int W) {
    vector<int> B(N, 0), R(N, 0);
    vector<int> cand(N);
    iota(cand.begin(), cand.end(), 0);
    while (true) {
        int cnt = min(13, W / (int)cand.size());
        fill(B.begin(), B.end(), 0);
        for (auto &x : cand) {
            B[x] = cnt;
        }
        playRound(&B[0], &R[0]);
        vector<int> nxt;
        for (int i=0; i<N; i++) {
            if (B[i] && R[i]) {
                nxt.push_back(i);
            }
        }
        cand = nxt;
        if (cand.size() == 1) return cand[0];
    }
}

int greaterValue(int N, int W) {
    vector<int> B(N, 0), R(N, 0);
    int lo = 1, hi = 14;
    while (lo <= hi) {
        int mid = lo + hi >> 1;
        B[0] = mid; B[1] = mid;
        playRound(&B[0], &R[0]);
        if (R[0] > mid && R[1] <= mid) return 0;
        if (R[1] > mid && R[0] <= mid) return 1;
        if (R[0] <= mid && R[1] <= mid) hi = mid - 1;
        else lo = mid + 1;
    }
}

int greaterValue2(int N, int W, int x, int y) {
    vector<int> B(N, 0), R(N, 0);
    int lo = 1, hi = 14;
    while (lo <= hi) {
        int mid = lo + hi >> 1;
        B[x] = mid; B[y] = mid;
        playRound(&B[0], &R[0]);
        if (R[x] > mid && R[y] <= mid) return 0;
        if (R[y] > mid && R[x] <= mid) return 1;
        if (R[x] <= mid && R[y] <= mid) hi = mid - 1;
        else lo = mid + 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 {
        vector<int> B(N, 1), R(N, 0);
        playRound(&B[0], &R[0]);
        vector<int> id;
        for (int i=0; i<N; i++) {
            if (R[i]) id.push_back(i);
        }
        sort(id.begin(), id.end(), [&](int &u, int &v) {
            return greaterValue2(N, W, u, v);
        });
        for (int i=0; i<N/2; i++) {
            P[id[i]] = i + 1 + N/2;
        }
        id.clear();
        for (int i=0; i<N; i++) {
            if (!R[i]) id.push_back(i);
        }
        sort(id.begin(), id.end(), [&](int &u, int &v) {
            return greaterValue2(N, W, u, v);
        });
        for (int i=0; i<N/2; i++) {
            P[id[i]] = i + 1;
        }
    }
}
/*
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);
    }
}*/

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:45:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |         int mid = lo + hi >> 1;
      |                   ~~~^~~~
koala.cpp: In function 'int greaterValue2(int, int, int, int)':
koala.cpp:59:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |         int mid = lo + hi >> 1;
      |                   ~~~^~~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:9:23: warning: control reaches end of non-void function [-Wreturn-type]
    9 |     vector<int> B(N, 0), R(N, 0);
      |                       ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:42:23: warning: control reaches end of non-void function [-Wreturn-type]
   42 |     vector<int> B(N, 0), R(N, 0);
      |                       ^
koala.cpp: In function 'int greaterValue2(int, int, int, int)':
koala.cpp:56:23: warning: control reaches end of non-void function [-Wreturn-type]
   56 |     vector<int> B(N, 0), R(N, 0);
      |                       ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 2 ms 448 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 ms 452 KB Output is correct
4 Correct 9 ms 460 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 344 KB Output is correct
2 Correct 31 ms 344 KB Output is correct
3 Correct 26 ms 344 KB Output is correct
4 Correct 26 ms 464 KB Output is correct
5 Correct 27 ms 344 KB Output is correct
6 Correct 27 ms 344 KB Output is correct
7 Correct 26 ms 344 KB Output is correct
8 Correct 27 ms 476 KB Output is correct
9 Correct 26 ms 460 KB Output is correct
10 Correct 29 ms 344 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
26.0 / 53.0

# Verdict Execution time Memory Grader output
1 Partially correct 14 ms 344 KB Output is partially correct
2 Partially correct 15 ms 344 KB Output is partially correct
3 Partially correct 17 ms 344 KB Output is partially correct
4 Partially correct 17 ms 344 KB Output is partially correct
5 Partially correct 16 ms 344 KB Output is partially correct
6 Partially correct 16 ms 340 KB Output is partially correct
7 Partially correct 17 ms 344 KB Output is partially correct
8 Partially correct 16 ms 344 KB Output is partially correct
9 Partially correct 15 ms 344 KB Output is partially correct
10 Partially correct 16 ms 420 KB Output is partially correct
11 Partially correct 16 ms 344 KB Output is partially correct
12 Partially correct 9 ms 452 KB Output is partially correct
13 Partially correct 17 ms 452 KB Output is partially correct
14 Partially correct 17 ms 344 KB Output is partially correct
15 Partially correct 16 ms 344 KB Output is partially correct
16 Partially correct 17 ms 344 KB Output is partially correct
17 Partially correct 20 ms 344 KB Output is partially correct
18 Partially correct 19 ms 344 KB Output is partially correct
19 Partially correct 16 ms 344 KB Output is partially correct
20 Partially correct 23 ms 452 KB Output is partially correct
21 Partially correct 19 ms 344 KB Output is partially correct
22 Partially correct 15 ms 344 KB Output is partially correct
23 Partially correct 21 ms 344 KB Output is partially correct
24 Partially correct 16 ms 344 KB Output is partially correct
25 Partially correct 17 ms 452 KB Output is partially correct
26 Partially correct 15 ms 344 KB Output is partially correct
27 Partially correct 16 ms 456 KB Output is partially correct
28 Partially correct 16 ms 344 KB Output is partially correct
29 Partially correct 16 ms 344 KB Output is partially correct
30 Partially correct 17 ms 344 KB Output is partially correct
31 Partially correct 16 ms 344 KB Output is partially correct
32 Partially correct 17 ms 344 KB Output is partially correct
33 Partially correct 15 ms 452 KB Output is partially correct
34 Partially correct 17 ms 344 KB Output is partially correct
35 Partially correct 17 ms 344 KB Output is partially correct
36 Partially correct 16 ms 448 KB Output is partially correct
37 Partially correct 16 ms 452 KB Output is partially correct
38 Partially correct 14 ms 344 KB Output is partially correct
39 Partially correct 16 ms 448 KB Output is partially correct
40 Partially correct 15 ms 344 KB Output is partially correct