제출 #410769

#제출 시각아이디문제언어결과실행 시간메모리
410769iliccmarko동굴 (IOI13_cave)C++14
0 / 100
394 ms392 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; #define ll long long #define endl "\n" #define INF 1000000000 #define LINF 10000000000000000LL #define pb push_back #define all(x) x.begin(), x.end() #define len(s) (int)s.size() #define test_case { int t; cin>>t; while(t--)solve(); } #define single_case solve(); #define line cerr<<"----------"<<endl; #define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); } #define mod 1000000007LL const int N = 5005; int sig[N]; int a[N]; int bb[N]; void exploreCave(int n) { for(int i = 0;i<n;i++) sig[i] = -1; for(int b = 1;b<=n;b++) { for(int i = 0;i<n;i++) if(sig[i]!=-1) a[i] = sig[i]; else a[i] = 1; int x = tryCombination(a); if(x==-1) x = n; if(x>=b) x = 1; else x = 0; int l = 0; int r = n-1; int ans; while(l<r) { int mid = (l+r)/2; for(int i = 0;i<n;i++) if(sig[i]!=-1) a[i] = sig[i]; for(int i = l;i<=mid;i++) if(sig[i]!=-1) a[i] = sig[i]; else a[i] = 1; for(int i = mid+1;i<=r;i++) if(sig[i]!=-1) a[i] = sig[i]; else a[i] = 0; int w = tryCombination(a); if(x) { if(w>=b) { ans = mid; r = mid; } else{ ans = mid + 1; l = mid + 1; } } else { if(w<b) { ans = mid; r = mid; } else{ ans = mid + 1; l = mid + 1; } } } sig[l] = x; bb[l] = b-1; } answer(sig, bb); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:34:13: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   34 |         int ans;
      |             ^~~
#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...