Submission #1274988

#TimeUsernameProblemLanguageResultExecution timeMemory
1274988muhammad-ahmadIsland Hopping (JOI24_island)C++20
0 / 100
4 ms408 KiB
#include <bits/stdc++.h> #include "island.h" using namespace std; void solve(int n, int l) { map<int, map<int, bool>> P; map<pair<int, int>, int> C; for (int i = 1; i <= n; i++){ int f = query(i, 1), ex = query(i, 2); if (!C[{f, i}]){ C[{f, i}] = 1; C[{i, f}] = 1; answer(i, f); } if (!C[{f, ex}] && !C[{i, ex}]){ // P[f][ex] = 1; P[i][ex] = 1; } } for (int i = 1; i <= n; i++){ for (auto [j, c] : P[i]){ if (!C[{i, j}] && P[j][i]){ answer(i, j); C[{i, j}] = 1; C[{j, i}] = 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...