제출 #1303142

#제출 시각아이디문제언어결과실행 시간메모리
1303142gabrielz이주 (IOI25_migrations)C++20
0 / 100
2 ms332 KiB
#include <bits/stdc++.h> constexpr int LM = 9998, RM = 20000; int lm = LM, rm = RM; int send_message(int N, int i, int Pi) { if (lm % 2 == 0) { return lm--; } else { return rm--; } } std::pair<int, int> longest_path(std::vector<int> S) { std::make_pair(LM, RM); }

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

migrations.cpp: In function 'std::pair<int, int> longest_path(std::vector<int>)':
migrations.cpp:16:1: warning: no return statement in function returning non-void [-Wreturn-type]
   16 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...