oj.uz

답안 #395181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
395181 2021-04-28T01:02:52 Z abc864197532 자매 도시 (APIO20_swap) C++17
0 / 100
 124 ms 14300 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;

void init(int _n, int m, vector <int> u, vector <int> v, vector <int> w) {
    n = _n;
    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]);
    }
}

int getMinimumFuelCapacity(int u, int v) {
    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
0 / 6.0

# 결과 실행 시간 메모리 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 3 ms 2636 KB Output is correct
7 Correct 3 ms 2716 KB Output is correct
8 Correct 3 ms 2660 KB Output is correct
9 Correct 43 ms 8548 KB Output is correct
10 Correct 61 ms 9904 KB Output is correct
11 Correct 52 ms 9756 KB Output is correct
12 Correct 55 ms 10200 KB Output is correct
13 Correct 53 ms 10180 KB Output is correct
14 Correct 53 ms 8872 KB Output is correct
15 Correct 120 ms 14028 KB Output is correct
16 Correct 116 ms 13904 KB Output is correct
17 Correct 124 ms 14272 KB Output is correct
18 Correct 124 ms 14300 KB Output is correct
19 Incorrect 61 ms 7788 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Incorrect 105 ms 14088 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 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 3 ms 2636 KB Output is correct
7 Correct 3 ms 2716 KB Output is correct
8 Correct 3 ms 2660 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 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 3 ms 2636 KB Output is correct
7 Correct 3 ms 2716 KB Output is correct
8 Correct 3 ms 2660 KB Output is correct
9 Correct 43 ms 8548 KB Output is correct
10 Correct 61 ms 9904 KB Output is correct
11 Correct 52 ms 9756 KB Output is correct
12 Correct 55 ms 10200 KB Output is correct
13 Correct 53 ms 10180 KB Output is correct
14 Correct 53 ms 8872 KB Output is correct
15 Correct 120 ms 14028 KB Output is correct
16 Correct 116 ms 13904 KB Output is correct
17 Correct 124 ms 14272 KB Output is correct
18 Correct 124 ms 14300 KB Output is correct
19 Incorrect 105 ms 14088 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct