제출 #1281063

#제출 시각아이디문제언어결과실행 시간메모리
1281063nathlol2Island Hopping (JOI24_island)C++20
0 / 100
3 ms412 KiB
#include "island.h" #include <bits/stdc++.h> using namespace std; void solve(int n, int L){ vector<bool> vis(n + 1, false), st(n + 1, false); vector<int> g[n + 1]; for(int i = 1;i<=n;i++){ if(vis[i]) continue; int c = 1; while(c < n){ int k = query(i, c); int j = query(k, 1); if(j == i){ g[i].push_back(k); st[k] = 1; } if(j < i){ if(st[i]) break; g[i].push_back(k); vis[k] = 1; break; } if(j > i) break; ++c; } } set<pair<int, int>> s; for(int i = 1;i<=n;i++){ for(auto x : g[i]) s.insert({min(i, x), max(i, x)}); } for(auto [x, y] : s) answer(x, y); }
#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...