Submission #1275037

#TimeUsernameProblemLanguageResultExecution timeMemory
1275037hynmjIsland Hopping (JOI24_island)C++20
2 / 100
3 ms412 KiB
#include "island.h" #include<bits/stdc++.h> using namespace std; void solve(int N, int L) { set<pair<int, int>> st; for (int i = 1; i <= N; i++) { int k = query(i, 1); st.insert({i, k}); st.insert({k, i}); } for (auto i : st) { if (i.first <i.second) answer(i.first, i.second); } }
#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...