제출 #59381

#제출 시각아이디문제언어결과실행 시간메모리
59381duality코알라 (APIO17_koala)C++11
24 / 100
285 ms784 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair typedef long long int LLI; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pii> vpii; #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); int c = 0; 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) c++,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,j; vi poss; for (i = 0; i < N; i++) poss.pb(i); int l = 1,r = N; while (1) { for (i = 0; i < N; i++) B[i] = 0; int val = 1,e = N; for (i = 1; i <= N/poss.size(); i++) { int m1 = 0,m2 = 0,ee = N; 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)*min(j,N-r)/2; sum += (2*(l-1)-(j-min(j,N-r))+1)*(j-min(j,N-r))/2; sum += (2*r-x+1)*x/2; if ((sum > m1) || ((sum == m1) && (j+x > m2))) { m1 = sum,m2 = j+x; ee = max(x,r-l+1-x); } } if (ee < e) e = ee,val = i; } //cout<<l<<","<<r<<","<<val<<","<<e<<endl; for (i = 0; i < poss.size(); i++) B[poss[i]] = val;//min(poss.size()-1,N/poss.size()); playRound(B,R); if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0; vi poss2; for (i = 0; i < poss.size(); i++) { if (R[a] > 0) { if (R[poss[i]] > 0) poss2.pb(poss[i]); } else { if (R[poss[i]] == 0) poss2.pb(poss[i]); } } if (R[a] > 0) l = r-poss2.size()+1; else r = l+poss2.size()-1; poss = poss2; } return 0;*/ int i,j; for (i = 1; i <= 14; i++) { for (j = 0; j < N; j++) B[i] = 0; B[a] = B[b] = i; playRound(B,R); if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0; } return 0; } int greaterValue(int N, int W) { return compare(0,1,N,W); } int n,w; int inv[100]; bool comp(int a,int b) { return compare(a,b,n,w); } void allValues(int N, int W, int *P) { n = N,w = N; if (W == 2*N) { // TODO: Implement Subtask 4 solution here. // You may leave this block unmodified if you are not attempting this // subtask. } else { int i; for (i = 0; i < N; i++) inv[i] = i; random_shuffle(inv,inv+N); sort(inv,inv+N,comp); for (i = 0; i < N; i++) P[inv[i]] = i+1; } }

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...