제출 #1284867

#제출 시각아이디문제언어결과실행 시간메모리
1284867Jawad_Akbar_JJIsland Hopping (JOI24_island)C++20
0 / 100
2 ms412 KiB
#include <iostream> #include <vector> #include "island.h" using namespace std; int seen[1000]; void solve(int n, int l){ vector<int> vc; for (int i=n;i>=1 and vc.size() < n - 1;i--){ for (int k=1;k<n and vc.size() < n - 1;k++){ int num = query(i, k); int vr = num % n, dst = num / n; if (vr == 0) vr = n, dst++; if (dst == 2 or seen[vr]) break; vc.push_back(i * (n + 1) + vr); } seen[i] = 1; } for (int i : vc) answer(i / (n + 1), i % (n + 1)); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...