oj.uz

Submission #1000562

# Submission time Handle Problem Language Result Execution time Memory
1000562 2024-06-17T18:56:43 Z VMaksimoski008 Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 1 ms 348 KB 
#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;
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -