oj.uz

Submission #554875

# Submission time Handle Problem Language Result Execution time Memory
554875 2022-04-29T14:14:28 Z Zhora_004 Swapping Cities (APIO20_swap) C++17
0 / 100
 2000 ms 10016 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;
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;

}

int getMinimumFuelCapacity(int X, int Y) {
	if (m == n - 1) return -1;
	int mx = 0;
	for (int& i : c) mx = max(mx, i);
	return mx;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 26 ms 4684 KB Output is correct
10 Correct 30 ms 5632 KB Output is correct
11 Correct 29 ms 5624 KB Output is correct
12 Correct 46 ms 5932 KB Output is correct
13 Correct 49 ms 5936 KB Output is correct
14 Correct 32 ms 5068 KB Output is correct
15 Correct 86 ms 9776 KB Output is correct
16 Correct 86 ms 9664 KB Output is correct
17 Correct 95 ms 10016 KB Output is correct
18 Correct 127 ms 10016 KB Output is correct
19 Execution timed out 2066 ms 4684 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 300 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 26 ms 4684 KB Output is correct
10 Correct 30 ms 5632 KB Output is correct
11 Correct 29 ms 5624 KB Output is correct
12 Correct 46 ms 5932 KB Output is correct
13 Correct 49 ms 5936 KB Output is correct
14 Correct 32 ms 5068 KB Output is correct
15 Correct 86 ms 9776 KB Output is correct
16 Correct 86 ms 9664 KB Output is correct
17 Correct 95 ms 10016 KB Output is correct
18 Correct 127 ms 10016 KB Output is correct
19 Incorrect 83 ms 9120 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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