제출 #1085355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085355		mingga	동굴 (IOI13_cave)	C++17	13 / 100	228 ms	600 KiB

cave

#include "cave.h"
#include "bits/stdc++.h"

using namespace std;

#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define fast_cin()                  \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define out(file) freopen(file, "w", stdout)
#define in(file) freopen(file, "r", stdin)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
// #define int long long
int MOD = 1e9 + 7;
const int n = 5005;

int comb[n], ans1[n], ans2[n];
void exploreCave(int n) {
  vector<int> vis(n, 0);
  for(int i = 0; i < n; i++) {
    comb[i] = 0;
  }
  for(int i = 0; i < n; i++) {
    int s = tryCombination(comb);
    int col = (s > i or s == -1) ? 0 : 1;
    int l = 0, r = n - 1, res;
    while(l <= r) {
      int m = (l + r) >> 1;
      for(int i = l; i <= m; i++) {
        if(vis[i]) continue;
        comb[i] ^= 1;
      }
      int cur = tryCombination(comb);
      for(int i = l; i <= m; i++) {
        if(vis[i]) continue;
        comb[i] ^= 1;
      }
      int col1 = (cur > i or cur == -1) ? 0 : 1;
      if(col1 == col) {
        l = m + 1;
      } else {
        res = m;
        r = m - 1;
      }
    }
    ans1[res] = col;
    ans2[res] = i; 
    vis[res] = 1;
  }
  answer(ans1, ans2);
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:55:12: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   55 |     vis[res] = 1;
      |            ^

• Subtask 1: 0 / 12
• Subtask 2: 13 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24