제출 #944596

#제출 시각아이디문제언어결과실행 시간메모리
944596irmuun동굴 (IOI13_cave)C++17
0 / 100
241 ms604 KiB
#include<bits/stdc++.h> #include "cave.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() void exploreCave(int n){ int s[n],d[n]; vector<bool>used(n,0); for(int i=0;i<n;i++){ vector<int>v; for(int j=0;j<n;j++){ if(!used[j]){ v.pb(j); } } int sz=v.size(),l=1,r=v.size(); int last=0; for(int j=i;j<n;j++){ s[j]=0; } int x=tryCombination(s); int q=1,p=0; if(x==-1||x>i){ swap(q,p); } while(l<r){ int mid=(l+r)/2; for(int j=0;j<sz;j++){ if(j<mid){ s[v[j]]=q; } else{ s[v[j]]=p; } } int x=tryCombination(s); if(x==-1||x>i){ r=mid; } else{ l=mid+1; } } d[v[l-1]]=i; s[i-1]=q; } answer(s,d); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:24:13: warning: unused variable 'last' [-Wunused-variable]
   24 |         int last=0;
      |             ^~~~
#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...