Submission #1171982

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171982		RiverFlow	코알라 (APIO17_koala)	C++20	4 / 100	2 ms	436 KiB

koala

#include <bits/stdc++.h>

// #define LOCAL

#ifndef LOCAL
#include "koala.h"
#endif

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;


#ifdef LOCAL

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

#endif

int n, w;

int a[105], b[105];

int minValue(int N, int W) {
    n = N, w = W;
    for(int i = 0; i < n; ++i) a[i] = b[i] = 0;

    a[0] = 1;
    playRound(a, b);

    if (b[0] == 1) {
        return 0;
    }
    for(int i = 1; i < n; ++i) if (b[i] == 0) {
        return i;
    }
    return 0;
}

int maxValue(int N, int W) {
    n = N, w = W;
    return 0;
}

int greaterValue(int N, int W) {
    n = N, w = W;
    return 0;
}

void allValues(int N, int W, int *P) {
    n = N, w = W;

}

#ifdef LOCAL

int N, W;
int P[105];

int maxQueries = 3200;
int numQueries;

void runGame(int F);

void grader() {
    int i;

    int F, G;

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

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

int main() {
    freopen("main.inp", "r", stdin);
    freopen("main.out", "w", stdout);
    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];
    }
}

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);
}

#endif

/*     Let the river flows naturally     */

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