This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |