제출 #687360

#제출 시각아이디문제언어결과실행 시간메모리
687360Bliznetc동굴 (IOI13_cave)C++17
컴파일 에러
0 ms0 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define sz size() #define all(x) x.begin(), x.end() #define F first #define S second typedef pair < int, int > pii; typedef vector < int > vi; typedef vector < vi > vvi; void exploreCave (int n) { int ask[n]; int good[n]; int d[n]; for (int i = 0; i < n; i++) { good[i] = d[i] = -1; } // vector<int> good(n, -1), d(n, -1); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (good[j] != -1) { ask[j] = 0; } else { ask[j] = good[j]; } } int x = tryCombination(ask); if (x == i) { for (int j = 0; j < n; j++) { if (good[j] != -1) { ask[j] = 1; } else { ask[j] = good[j]; } } } int l = 0, r = n - 1; while (r - l > 1) { int mid = (l + r) / 2; for (int j = l; j < mid; j++) { if (good[j] != -1) { ask[j] = 1 - ask[j]; } else { ask[j] = good[j]; } } x = tryCombination(ask); if (x == i) { for (int j = l; j < mid; j++) { if (good[j] != -1) { ask[j] = 1 - ask[j]; } else { ask[j] = good[j]; } } for (int j = mid; j <= r; j++) { if (good[j] != -1) { ask[j] = 1 - ask[j]; } else { ask[j] = good[j]; } } r = mid - 1; } else { l = mid; } } if (good[l] != -1) { ask[l] = 1 - ask[l]; } else { ask[l] = good[l]; } x = tryCombination(ask); if (x == i) { if (good[l] != -1) { ask[l] = 1 - ask[l]; } else { ask[l] = good[l]; } l = r; }*/ good[i] = ask[l]; d[i] = l; } answer(good, d); } /* signed main() { vi a; a.pb(-2); a.pb(2); a.pb(2); a.pb(-2); a.pb(-2); a.pb(2); cout << count_swaps(a); } */

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:100:11: error: expected primary-expression before '/' token
  100 |         }*/
      |           ^