oj.uz

Submission #319453

# Submission time Handle Problem Language Result Execution time Memory
319453 2020-11-05T10:38:47 Z Vimmer Swapping Cities (APIO20_swap) C++14
6 / 100
 107 ms 8652 KB 
#include <bits/stdc++.h>
//#include "paint.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define N 100100
#define F first
#define S second
#define M ll(1e9 + 7)
#define endl '\n'
#define all(x) x.begin(), x.end()
#define PB push_back
#define sz(x) ll(x.size())
#define pw(x) (1ll << x)
#define pwr(x) ((1ll << x) - 1)
#define _ << " " <<
#define pri(s) cout << s << endl

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef short int si;
typedef unsigned long long ull;

//typedef tree<int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

vector <pair <int, int> > g[N];

int mx = -1;

void init(int n, int m, vector<int> u, vector<int> v, vector<int> w)
{
    if (n == m)
        for (int i = 0; i < m; i++) mx = max(mx, w[i]);
}

int getMinimumFuelCapacity(int x, int y) {return mx;}

//int main()
//{
//    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2700 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2796 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 3 ms 2668 KB Output is correct
9 Correct 30 ms 4844 KB Output is correct
10 Correct 35 ms 5348 KB Output is correct
11 Correct 38 ms 5348 KB Output is correct
12 Correct 37 ms 5348 KB Output is correct
13 Correct 37 ms 5476 KB Output is correct
14 Correct 38 ms 5092 KB Output is correct
15 Correct 100 ms 7280 KB Output is correct
16 Correct 99 ms 7188 KB Output is correct
17 Correct 101 ms 7372 KB Output is correct
18 Correct 107 ms 7244 KB Output is correct
19 Correct 62 ms 6848 KB Output is correct
20 Correct 102 ms 8304 KB Output is correct
21 Correct 103 ms 8480 KB Output is correct
22 Correct 107 ms 8652 KB Output is correct
23 Correct 106 ms 8652 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2700 KB Output is correct
3 Incorrect 95 ms 7040 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2700 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2796 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 3 ms 2668 KB Output is correct
9 Correct 30 ms 4844 KB Output is correct
10 Correct 35 ms 5348 KB Output is correct
11 Correct 38 ms 5348 KB Output is correct
12 Correct 37 ms 5348 KB Output is correct
13 Correct 37 ms 5476 KB Output is correct
14 Correct 38 ms 5092 KB Output is correct
15 Correct 100 ms 7280 KB Output is correct
16 Correct 99 ms 7188 KB Output is correct
17 Correct 101 ms 7372 KB Output is correct
18 Correct 107 ms 7244 KB Output is correct
19 Incorrect 95 ms 7040 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

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