Submission #849308

#TimeUsernameProblemLanguageResultExecution timeMemory
849308Muaath_5Longest Trip (IOI23_longesttrip)C++17
0 / 100
2 ms612 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double using namespace std; const ll N = 257, INF = 7e15; bool are_connected(vector<int> A, vector<int> B); vector<int> longest_trip(int N, int D) { if (D == 1) { vector<int> ans(N); iota(ans.begin(), ans.end(), 0); return ans; } else if (D == 2) { } else { // you have two paths and the other points // if p1 } return {}; }
#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...