제출 #947044

#제출 시각아이디문제언어결과실행 시간메모리
947044onepunchac168Minerals (JOI19_minerals)C++14
40 / 100
18 ms3156 KiB
#include "minerals.h" #include <bits/stdc++.h> using namespace std; int query(int x) { return Query(x); } void solve(vector <int> need,bool check) { if (need.size()==2) { Answer(need[0],need[1]); return; } if (need.size()<=1) { assert(1==0); } vector <int> aa,bb; int rr=need.size()/4; if (check==0) { for (int i=0;i<need.size();i++) { int a1=query(need[i]); if (a1<=rr) { aa.push_back(need[i]); } else { int a2=query(need[i]); bb.push_back(need[i]); } } for (auto v:aa) { query(v); } solve(aa,0); solve(bb,0); } } void Solve(int n) { vector <int > opt; for (int i=1;i<=2*n;i++) { opt.push_back(i); } solve(opt,0); }

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

minerals.cpp: In function 'void solve(std::vector<int>, bool)':
minerals.cpp:24:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int i=0;i<need.size();i++)
      |                      ~^~~~~~~~~~~~
minerals.cpp:33:21: warning: unused variable 'a2' [-Wunused-variable]
   33 |                 int a2=query(need[i]);
      |                     ^~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...