제출 #383497

#제출 시각아이디문제언어결과실행 시간메모리
383497nicholask동굴 (IOI13_cave)C++14
0 / 100
2074 ms492 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N){ int s[N],d[N]; for (int i=0; i<N; i++){ s[i]=0; d[i]=-1; } for (int i=0; i<N; i++){ vector <int> v; for (int j=0; j<N; j++){ if (d[j]==-1) v.push_back(j); } while (v.size()>1){ int mid=v.size()/2; vector <int> l,r; for (int j=0; j<v.size(); j++){ if (i<mid) l.push_back(v[i]); else r.push_back(v[i]); } for (auto&j:l) s[j]=1; if (tryCombination(s)==i) v=l; else v=r; for (auto&j:l) s[j]=0; } if (tryCombination(s)==i) s[v[0]]=1; d[v[0]]=i; } answer(s,d); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:18:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |    for (int j=0; j<v.size(); j++){
      |                  ~^~~~~~~~~
#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...