제출 #306390

#제출 시각아이디문제언어결과실행 시간메모리
306390amunduzbaev동굴 (IOI13_cave)C++14
25 / 100
77 ms512 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int s[n],d[n]; memset(s,0,sizeof(s)); bool ok=0; int st; for(int i=0;i<n-1;i++){ st=i; s[i]=0; s[i+1]=0; int x = tryCombination(s); if(x==-1){ ok=1; break; } s[i+1]=1; int y = tryCombination(s); if(y==-1){ ok=1; break; } if(x==y){ s[i]=1; }else{ s[i]=1; int a=tryCombination(s); if(a==-1){ ok=1; break; } s[i]=0; } } int id=tryCombination(s); if(id!=-1){ s[n-1]=(s[n-1]?0:1); } for(int i=0;i<n;i++){ s[i]=(s[i]? 0:1); int ind=tryCombination(s); d[i]=ind; s[i]=(s[i]? 0:1); } answer(s,d); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:8:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
    8 |     bool ok=0;
      |          ^~
cave.cpp:9:9: warning: variable 'st' set but not used [-Wunused-but-set-variable]
    9 |     int st;
      |         ^~
#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...