제출 #670668

#제출 시각아이디문제언어결과실행 시간메모리
670668pzorro동굴 (IOI13_cave)C++14
0 / 100
8 ms396 KiB
#include <iostream> #include <bits/stdc++.h> #include "cave.h" using namespace std; const int MAXN = 5 * 1e3; int s[MAXN]; int d[MAXN]; int total = 0; void exploreCave(int n){ for(int i = 0; i < n; i++){ s[i] = 0; //d[i] = i; } int res1, res2, res; for(int i = 0; i < n; i++){ s[i]++; int res = tryCombination(s); if(res == i) d[res] = i; s[i]--; } /*while(total < n-1){ for(int i = 0; i < n; i++){ s[i]++; int res1 = tryCombination(s); s[i]--; int res2 = tryCombination(s); if(res1 == res2) continue; //d[i] = res1 ou d[i] = res2 } }*/ answer(s, d); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:18:9: warning: unused variable 'res1' [-Wunused-variable]
   18 |     int res1, res2, res;
      |         ^~~~
cave.cpp:18:15: warning: unused variable 'res2' [-Wunused-variable]
   18 |     int res1, res2, res;
      |               ^~~~
cave.cpp:18:21: warning: unused variable 'res' [-Wunused-variable]
   18 |     int res1, res2, res;
      |                     ^~~
#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...