oj.uz

Submission #395182

# Submission time Handle Problem Language Result Execution time Memory
395182 2021-04-28T01:04:33 Z abc864197532 Swapping Cities (APIO20_swap) C++17
6 / 100
 155 ms 15692 KB 
#include <bits/stdc++.h>
// #include "grader_swap.cpp"
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define test(x) cout << "Line(" << __LINE__ << ") " #x << ' ' << x << endl
#define printv(x) {\
	for (auto i : x) cout << i << ' ';\
	cout << endl;\
}
#define pii pair <int, int>
#define pll pair <lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename A, typename B>
ostream& operator << (ostream& o, pair<A, B> a){
    return o << a.X << ' ' << a.Y;
}
template<typename A, typename B>
istream& operator >> (istream& o, pair<A, B> &a){
    return o >> a.X >> a.Y;
}
const int mod = 1e9 + 7, abc = 864197532, Doludu = 123, N = 100001, logN = 18, K = 40;

vector <pii> adj[N];
int n, m, mx;

void init(int _n, int _m, vector <int> u, vector <int> v, vector <int> w) {
    n = _n, m = _m, mx = 0;
    for (int i = 0; i < n; ++i) adj[i].clear();
    for (int i = 0; i < m; ++i) {
        adj[u[i]].eb(v[i], w[i]);
        adj[v[i]].eb(u[i], w[i]);
        mx = max(mx, w[i]);
    }
}

int getMinimumFuelCapacity(int u, int v) {
    if (n == m) return mx;
    return -1;
}
/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
2 3 3
1 4 10
3
1 2
2 4
0 1
 */

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 48 ms 6896 KB Output is correct
10 Correct 50 ms 7860 KB Output is correct
11 Correct 69 ms 7724 KB Output is correct
12 Correct 54 ms 8044 KB Output is correct
13 Correct 54 ms 8052 KB Output is correct
14 Correct 48 ms 7032 KB Output is correct
15 Correct 122 ms 9680 KB Output is correct
16 Correct 119 ms 9588 KB Output is correct
17 Correct 117 ms 9832 KB Output is correct
18 Correct 122 ms 9812 KB Output is correct
19 Correct 83 ms 6896 KB Output is correct
20 Correct 132 ms 15048 KB Output is correct
21 Correct 121 ms 15260 KB Output is correct
22 Correct 155 ms 15656 KB Output is correct
23 Correct 124 ms 15692 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 48 ms 6896 KB Output is correct
10 Correct 50 ms 7860 KB Output is correct
11 Correct 69 ms 7724 KB Output is correct
12 Correct 54 ms 8044 KB Output is correct
13 Correct 54 ms 8052 KB Output is correct
14 Correct 48 ms 7032 KB Output is correct
15 Correct 122 ms 9680 KB Output is correct
16 Correct 119 ms 9588 KB Output is correct
17 Correct 117 ms 9832 KB Output is correct
18 Correct 122 ms 9812 KB Output is correct
19 Incorrect 115 ms 10260 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct