Submission #935089

#TimeUsernameProblemLanguageResultExecution timeMemory
9350891075508020060209tcChameleon's Love (JOI20_chameleon)C++14
0 / 100
1 ms352 KiB
#include "chameleon.h" #include <vector> #include<bits/stdc++.h> using namespace std; int n; int ok(int l,int mi){ if(mi==n+n+1){return 1;} vector<int>vc; for(int i=l;i<=mi;i++){ vc.push_back(i); } if(Query(vc)<vc.size()){return 1;} return 0; } void Solve(int N) { n=N; vector<int>ans(N*2+1); for(int i=1;i<=N*2;i++){ int l=i;int r=N*2+1; while(l<r){ int mi=l+(r-l)/2; if(ok(i,mi)){ r=mi; }else{ l=mi+1; } } ans[i]=l; } for(int i=1;i<=n*2;i++){ if(ans[i]<=n*2){ Answer(i,ans[i]); } } }

Compilation message (stderr)

chameleon.cpp: In function 'int ok(int, int)':
chameleon.cpp:13:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 | if(Query(vc)<vc.size()){return 1;}
      |    ~~~~~~~~~^~~~~~~~~~
#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...