oj.uz

Submission #397817

# Submission time Handle Problem Language Result Execution time Memory
397817 2021-05-03T07:58:01 Z yuto1115 Swapping Cities (APIO20_swap) C++17
0 / 100
 137 ms 14392 KB 
#include "swap.h"
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int inf = 1001001001;

namespace {
    int n;
    vvp G;
}

void init(int _n, int m, vi u, vi v, vi w) {
    n = _n;
    G.resize(n);
    rep(i, m) {
        G[u[i]].eb(v[i], w[i]);
        G[v[i]].eb(u[i], w[i]);
    }
}

int getMinimumFuelCapacity(int x, int y) {
    return -1;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 8088 KB Output is correct
10 Correct 52 ms 9736 KB Output is correct
11 Correct 53 ms 9664 KB Output is correct
12 Correct 69 ms 10160 KB Output is correct
13 Correct 53 ms 10180 KB Output is correct
14 Correct 47 ms 8404 KB Output is correct
15 Correct 114 ms 13980 KB Output is correct
16 Correct 113 ms 13684 KB Output is correct
17 Correct 137 ms 14260 KB Output is correct
18 Correct 116 ms 14392 KB Output is correct
19 Incorrect 58 ms 5820 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Incorrect 136 ms 13884 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 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Incorrect 1 ms 204 KB Output isn't correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 48 ms 8088 KB Output is correct
10 Correct 52 ms 9736 KB Output is correct
11 Correct 53 ms 9664 KB Output is correct
12 Correct 69 ms 10160 KB Output is correct
13 Correct 53 ms 10180 KB Output is correct
14 Correct 47 ms 8404 KB Output is correct
15 Correct 114 ms 13980 KB Output is correct
16 Correct 113 ms 13684 KB Output is correct
17 Correct 137 ms 14260 KB Output is correct
18 Correct 116 ms 14392 KB Output is correct
19 Incorrect 136 ms 13884 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 204 KB Output isn't correct