제출 #216207

#제출 시각아이디문제언어결과실행 시간메모리
216207MODDICave (IOI13_cave)C++14
46 / 100
51 ms24960 KiB
#include "cave.h" #include <bits/stdc++.h> #define ll long long #define pii pair<int,int> #define pll pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vll vector<pll> #define vii vector<pii> using namespace std; void exploreCave(int n){ int arr[n], door[n]; memset(arr, 0, sizeof(arr)); memset(door,-1,sizeof(door)); bool vis[n][n]; memset(vis,false,sizeof(vis)); bool vis1[n]; memset(vis1,false,sizeof(vis1)); while(true){ int pos = tryCombination(arr); if(pos == -1){ break; } else if(vis1[pos]) { int random; for(int i = 0; i < n; i++){ if(vis[pos][i] == false){ vis[pos][i] = true; random = i; break; } else continue; } arr[random] = 1 - arr[random]; int pl = tryCombination(arr); if(pl == -1) break; if(pl <= pos) arr[random] = 1 - arr[random]; else{ door[random] = pos; vis1[pl] = true; } } else{ arr[pos] = 1 - arr[pos]; vis1[pos] = true; } } for(int i = 0; i < n; i++){ if(door[i] != -1) continue; arr[i] = 1 - arr[i]; int pos = tryCombination(arr); //for(int j = 0; j < n;j++) // cout<<arr[j]<<" "; //cout<<pos<<endl; door[i] = pos; arr[i] = 1 - arr[i]; } answer(arr, door); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:27:8: warning: 'random' may be used uninitialized in this function [-Wmaybe-uninitialized]
    int random;
        ^~~~~~
#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...