제출 #729537

#제출 시각아이디문제언어결과실행 시간메모리
729537NeroZein동굴 (IOI13_cave)C++17
100 / 100
921 ms460 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; const int N = 5005; bool vis[N]; void exploreCave(int N_) { int n; n = N_; int a[n]; int d[n]; for (int i = 0; i < n; ++i) { a[i] = 0; } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (!vis[j]) { a[j] = 0; } } int x = tryCombination(a); int org = x; int z = 1; if (x > i || x == -1) { z = 0; } int l = 0, r = n - 1; while (l < r) { int mid = (l + r) >> 1; for (int j = 0; j <= mid; ++j) { if (!vis[j]) { a[j] = z; } } for (int j = mid + 1; j < n; ++j) { if (!vis[j]) { a[j] = z ^ 1; } } x = tryCombination(a); if (x > i || x == -1) { r = mid; } else { l = mid + 1; } } a[l] = z; d[l] = i; vis[l] = true; } answer(a, d); }

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

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