oj.uz

Submission #1008018

# Submission time Handle Problem Language Result Execution time Memory
1008018 2024-06-26T06:03:42 Z overwatch9 Swapping Cities (APIO20_swap) C++17
0 / 100
 75 ms 13368 KB 
#include "swap.h"

#include <bits/stdc++.h>
using namespace std;

vector <vector <pair <int, int>>> adj;
int n;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    adj.resize(N+1);
	n = N;
    for (int i = 0; i < M; i++)
        adj[U[i]].push_back({V[i], W[i]});
}

int getMinimumFuelCapacity(int X, int Y) {
	return -1;
}
// int main() {
// 	int N, M;
// 	cin >> N >> M;
// 	vector <int> u(M), v(M), w(M);
// 	for (int i = 0; i < M; i++)
// 		cin >> u[i] >> v[i] >> w[i];
// 	init(N, M, u, v, w);
// 	int q;
// 	cin >> q;
// 	while (q--) {
// 		int x, y;
// 		cin >> x >> y;
// 		cout << getMinimumFuelCapacity(x, y) << '\n';
// 	}
// }

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 21 ms 7204 KB Output is correct
10 Correct 23 ms 8780 KB Output is correct
11 Correct 22 ms 8796 KB Output is correct
12 Correct 23 ms 9304 KB Output is correct
13 Correct 23 ms 9120 KB Output is correct
14 Correct 25 ms 7768 KB Output is correct
15 Correct 55 ms 13020 KB Output is correct
16 Correct 54 ms 12864 KB Output is correct
17 Correct 56 ms 13240 KB Output is correct
18 Correct 75 ms 13368 KB Output is correct
19 Incorrect 30 ms 5712 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 21 ms 7204 KB Output is correct
10 Correct 23 ms 8780 KB Output is correct
11 Correct 22 ms 8796 KB Output is correct
12 Correct 23 ms 9304 KB Output is correct
13 Correct 23 ms 9120 KB Output is correct
14 Correct 25 ms 7768 KB Output is correct
15 Correct 55 ms 13020 KB Output is correct
16 Correct 54 ms 12864 KB Output is correct
17 Correct 56 ms 13240 KB Output is correct
18 Correct 75 ms 13368 KB Output is correct
19 Incorrect 46 ms 11208 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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