제출 #713867

#제출 시각아이디문제언어결과실행 시간메모리
713867PacybwoahXoractive (IZhO19_xoractive)C++14
100 / 100
5 ms532 KiB
#include "interactive.h" #include<vector> #include<map> #include<algorithm> using namespace std; vector<int> guess(int n) { vector <int> ans(n); if(n<=4){ for(int i=1;i<=n;i++) ans[i-1]=ask(i); return ans; } int one=ask(1); vector<vector<int>> bitxor(7),askans(7),noone(7); for(int i=0;i<7;i++) bitxor[i].push_back(1); for(int i=2;i<=n;i++){ for(int j=0;j<7;j++){ if(i&(1<<j)) bitxor[j].push_back(i); } } for(int i=0;i<7;i++){ if(!bitxor[i].empty()) askans[i]=get_pairwise_xor(bitxor[i]); bitxor[i].erase(bitxor[i].begin()); if(!bitxor[i].empty()) noone[i]=get_pairwise_xor(bitxor[i]); else continue; for(int j=0;j<noone[i].size();j++){ askans[i].erase(find(askans[i].begin(),askans[i].end(),noone[i][j])); } while(*askans[i].begin()==0) askans[i].erase(askans[i].begin()); } map<int,int> m; for(int i=0;i<7;i++){ for(int j=0;j<askans[i].size();j++){ askans[i][j]^=one; //cout<<i<<" "<<j<<" "<<askans[i][j]<<"\n"; m[askans[i][j]]+=(1<<i); } } ans[0]=one; for(auto x:m){ ans[x.second/2-1]=x.first; //cout<<x.first<<" "<<x.second<<"\n"; } return ans; }

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

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:26:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for(int j=0;j<noone[i].size();j++){
      |                     ~^~~~~~~~~~~~~~~~
Xoractive.cpp:33:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int j=0;j<askans[i].size();j++){
      |                     ~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...