제출 #402737

#제출 시각아이디문제언어결과실행 시간메모리
402737teehandsome코알라 (APIO17_koala)C++11
11 / 100
19 ms316 KiB
#include "koala.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define endl '\n' #define INF 1e9+7 #define all(x) x.begin(),x.end() using namespace std; using namespace __gnu_pbds; using ll=long long; using pii=pair<int,int>; using ppi=pair<int,pii>; using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>; template<typename T> void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";} void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";} template<typename T> void _print(T x) {cerr<<x;} void dbg() {cerr<<endl;} template<typename Head,typename... Tail> void dbg(Head H,Tail... T) { _print(H); if(sizeof...(T)) cerr<<","; else cerr<<"\"]"; dbg(T...); } #define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__) //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n,w; int minValue(int N, int W) { n=N,w=W; int a[n],b[n]; memset(a,0,sizeof(a)); a[0]=w-n+1; playRound(a,b); for(int i=0;i<n;i++) { if(b[i]<=a[i]) return i; } } int solve(vector<bool> flag,int n2,int c,int n) { // debug(n2); int a[n]; memset(a,0,sizeof(a)); if(n2==1) { for(int i=0;i<n;i++) { if(!flag[i]) return i; } } else if(n2==2) { c=10; // int a[n]; // for(int i=0;i<n;i++) { // if(flag[i]) a[i]=0; // else a[i]=49 // } } for(int i=0;i<n;i++) { if(flag[i]) continue; a[i]=c; } int b[n]; // cout<<"==="<<endl; // for(int i=0;i<n;i++) { // cout<<a[i]<<" "; // } // cout<<endl; playRound(a,b); int cnt=0; for(int i=0;i<n;i++) { if(b[i]>a[i] and a[i]!=0) { flag[i]=false; cnt++; } else flag[i]=true; } return solve(flag,cnt,c*2,n); } int maxValue(int N, int W) { n=N,w=W; vector<bool> flag(n,false); return solve(flag,n,1,n); } int greaterValue(int N, int W) { // TODO: Implement Subtask 3 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; } 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 { // TODO: Implement Subtask 5 solution here. // You may leave this block unmodified if you are not attempting this // subtask. } }

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

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:45:1: warning: control reaches end of non-void function [-Wreturn-type]
   45 | }
      | ^
#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...