# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
120953 | 2019-06-25T20:03:46 Z | Rahul | 코알라 (APIO17_koala) | C++17 | 0 ms | 0 KB |
#include "koala.h" #include <bits/stdc++.h> using namespace std; #define SZ(v) int((v).size()) #define ALL(vec) (vec).begin(),(vec).end() int B[500], R[500]; 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); } } int minValue(int n, int w) { for (int i = 0; i < 100; ++i) { B[i] = i < 51; } playRound(B, R); int m = -1; for (int i = 0; i < 51; ++i) { if (R[i] == 0) { m = i; } // else assert (R[i] == 2); } for (int i = 0; i < 100; ++i) { B[i] = i >= 50; } B[m] = 1; if (m == 50) B[49] = 1; playRound(B, R); int res = -1; for (int i = 50; i < 100; ++i) { if (R[i] == 0) { res = i; } // else assert (R[i] == 2); } if (res != -1) return res; if (m == 50) return 49; else return m; } int maxValue(int n, int w) { return 0; } int greaterValue(int n, int w) { return 0; } void allValues(int n, int w, int *P) { return; }