Submission #1000562

#TimeUsernameProblemLanguageResultExecution timeMemory
1000562VMaksimoski008Crocodile's Underground City (IOI11_crocodile)C++17
0 / 100
1 ms348 KiB
#include "crocodile.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) { vector<pii> graph[N]; for(int i=0; i<M; i++) { graph[R[i][0]].push_back({ R[i][1], L[i] }); graph[R[i][1]].push_back({ R[i][0], L[i] }); } return N; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...