oj.uz

답안 #569758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569758 2022-05-27T18:02:33 Z sumit_kk10 자매 도시 (APIO20_swap) C++17
6 / 100
 125 ms 32392 KB 
#include "swap.h"
#include<bits/stdc++.h>
#include <vector>
#define pb push_back
using namespace std;
const int N = 1e6 + 5;
vector<pair<int, int> > g[N];
int mx, n, m;
bool sb2 = 1;

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	m = M;
	for(int i = 0; i < M; ++i){
		int u = U[i], v = V[i], w = W[i];
		if(u != 0 and v != 0)
			sb2 = false;
		g[u].pb({w, v});
		g[v].pb({w, u});
		mx = max(mx, w);
	}
	for(int i = 0; i < n; ++i)
		sort(g[i].begin(), g[i].end());
}
 
int getMinimumFuelCapacity(int X, int Y) {
	if(sb2 and m == n - 1){
		if(n <= 3) return -1;
		int x = g[X][0].second, xx = g[Y][0].second, mn;
		if(g[0][0].second != X and g[0][0].second != Y)
			mn = g[0][0].first;
		else if(g[0][1].second != X and g[0][1].second != Y)
			mn = g[0][1].first;
		else
			mn = g[0][2].first;
		return max({x, xx, mn});
	}
	if(m == n - 1)
		return -1;
	else
		return mx;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 14 ms 23664 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 13 ms 23716 KB Output is correct
8 Correct 14 ms 23792 KB Output is correct
9 Correct 52 ms 28024 KB Output is correct
10 Correct 55 ms 29012 KB Output is correct
11 Correct 57 ms 28960 KB Output is correct
12 Correct 61 ms 29268 KB Output is correct
13 Correct 65 ms 29192 KB Output is correct
14 Correct 68 ms 28100 KB Output is correct
15 Correct 106 ms 30808 KB Output is correct
16 Correct 107 ms 30772 KB Output is correct
17 Correct 116 ms 30940 KB Output is correct
18 Correct 120 ms 31012 KB Output is correct
19 Correct 62 ms 28108 KB Output is correct
20 Correct 125 ms 32028 KB Output is correct
21 Correct 112 ms 32132 KB Output is correct
22 Correct 115 ms 32392 KB Output is correct
23 Correct 115 ms 32348 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 14 ms 23664 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 13 ms 23716 KB Output is correct
8 Correct 14 ms 23792 KB Output is correct
9 Incorrect 14 ms 23764 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 14 ms 23664 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 13 ms 23716 KB Output is correct
8 Correct 14 ms 23792 KB Output is correct
9 Correct 52 ms 28024 KB Output is correct
10 Correct 55 ms 29012 KB Output is correct
11 Correct 57 ms 28960 KB Output is correct
12 Correct 61 ms 29268 KB Output is correct
13 Correct 65 ms 29192 KB Output is correct
14 Correct 68 ms 28100 KB Output is correct
15 Correct 106 ms 30808 KB Output is correct
16 Correct 107 ms 30772 KB Output is correct
17 Correct 116 ms 30940 KB Output is correct
18 Correct 120 ms 31012 KB Output is correct
19 Incorrect 109 ms 31736 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -