oj.uz

Submission #554877

# Submission time Handle Problem Language Result Execution time Memory
554877 2022-04-29T14:15:15 Z Zhora_004 Swapping Cities (APIO20_swap) C++17
6 / 100
 82 ms 11444 KB 
#include "swap.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
#include <fstream>
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
using ll = long long;
using namespace std;
int n, m, mx;
vector<int> a, b, c;

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	m = M;
	a = U;
	b = V;
	c = W;
	for (int& i : c) mx = max(mx, i);
}

int getMinimumFuelCapacity(int X, int Y) {
	if (m == n - 1) return -1;
	return mx;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 21 ms 3028 KB Output is correct
10 Correct 25 ms 3608 KB Output is correct
11 Correct 25 ms 3532 KB Output is correct
12 Correct 29 ms 3780 KB Output is correct
13 Correct 27 ms 3780 KB Output is correct
14 Correct 27 ms 3152 KB Output is correct
15 Correct 74 ms 5424 KB Output is correct
16 Correct 73 ms 5468 KB Output is correct
17 Correct 73 ms 5664 KB Output is correct
18 Correct 75 ms 5572 KB Output is correct
19 Correct 47 ms 4288 KB Output is correct
20 Correct 80 ms 10840 KB Output is correct
21 Correct 76 ms 11036 KB Output is correct
22 Correct 80 ms 11416 KB Output is correct
23 Correct 82 ms 11444 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 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 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 21 ms 3028 KB Output is correct
10 Correct 25 ms 3608 KB Output is correct
11 Correct 25 ms 3532 KB Output is correct
12 Correct 29 ms 3780 KB Output is correct
13 Correct 27 ms 3780 KB Output is correct
14 Correct 27 ms 3152 KB Output is correct
15 Correct 74 ms 5424 KB Output is correct
16 Correct 73 ms 5468 KB Output is correct
17 Correct 73 ms 5664 KB Output is correct
18 Correct 75 ms 5572 KB Output is correct
19 Incorrect 74 ms 5296 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 212 KB Output isn't correct
2 Halted 0 ms 0 KB -