제출 #1298515

#제출 시각아이디문제언어결과실행 시간메모리
1298515vache_kocharyan장애물 (IOI25_obstacles)C++20
0 / 100
52 ms5920 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector<int>T, H; int n, m; bool is_free(int i, int j) { return T[i] > H[j]; } void initialize(std::vector<int> T, std::vector<int> H) { ::T = T; ::H = H; n = T.size(); m = H.size(); } bool can_reach(int L, int R, int S, int D) { if (n == 1) { for (int i = S; i <= D; i++) { if (!is_free(1, i)) { return false; } } return true; } }

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

obstacles.cpp: In function 'bool can_reach(int, int, int, int)':
obstacles.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
   33 | }
      | ^
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...