Submission #1275029

#TimeUsernameProblemLanguageResultExecution timeMemory
1275029muhammad-mutahirIsland Hopping (JOI24_island)C++20
0 / 100
3 ms416 KiB
#include "island.h" #include <bits/stdc++.h> using namespace std; void solve(int N, int L) { vector<vector<int>>find(N+1); for(int i = 1;i<=N;i++){ for(int j = 1;j<N;j++){ int f = query(i,j); find[i].push_back(f); } } for(int i = 1;i<=N;i++){ for(int j = i+1;j<=N;j++){ vector<int>v1,v2; for(int k:find[i]){ if(k == j)continue; v1.push_back(k); } for(int k:find[j]){ if(k == i)continue; v2.push_back(k); } if(v1 == v2){ answer(i,j); } } } } // signed main(){ // io(); // int t = 1; // while(t--) solve(); // }
#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...