oj.uz

Submission #569762

# Submission time Handle Problem Language Result Execution time Memory
569762 2022-05-27T18:09:53 Z sumit_kk10 Swapping Cities (APIO20_swap) C++17
6 / 100
 152 ms 32388 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;
		if(X == 0){
			int x = g[Y][0].second, xx, dest, mn;
			if(g[0][0].second != Y){
				xx = g[0][0].first;
				dest = g[0][0].second;
			}else{
				xx = g[0][1].first;
				dest = g[0][1].second;
			}
			if(g[0][1].second != Y and g[0][1].second != dest)
				mn = g[0][1].first;
			else
				mn = g[0][2].first;
			return max({x, xx, mn});
		}
		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

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23736 KB Output is correct
4 Correct 12 ms 23804 KB Output is correct
5 Correct 13 ms 23828 KB Output is correct
6 Correct 15 ms 23744 KB Output is correct
7 Correct 15 ms 23840 KB Output is correct
8 Correct 15 ms 23752 KB Output is correct
9 Correct 60 ms 28036 KB Output is correct
10 Correct 59 ms 28916 KB Output is correct
11 Correct 58 ms 28872 KB Output is correct
12 Correct 64 ms 29132 KB Output is correct
13 Correct 84 ms 29252 KB Output is correct
14 Correct 62 ms 28164 KB Output is correct
15 Correct 114 ms 30820 KB Output is correct
16 Correct 107 ms 30716 KB Output is correct
17 Correct 152 ms 30948 KB Output is correct
18 Correct 140 ms 30980 KB Output is correct
19 Correct 69 ms 28108 KB Output is correct
20 Correct 110 ms 31984 KB Output is correct
21 Correct 125 ms 32132 KB Output is correct
22 Correct 138 ms 32368 KB Output is correct
23 Correct 111 ms 32388 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Incorrect 118 ms 31704 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23736 KB Output is correct
4 Correct 12 ms 23804 KB Output is correct
5 Correct 13 ms 23828 KB Output is correct
6 Correct 15 ms 23744 KB Output is correct
7 Correct 15 ms 23840 KB Output is correct
8 Correct 15 ms 23752 KB Output is correct
9 Incorrect 13 ms 23732 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23736 KB Output is correct
4 Correct 12 ms 23804 KB Output is correct
5 Correct 13 ms 23828 KB Output is correct
6 Correct 15 ms 23744 KB Output is correct
7 Correct 15 ms 23840 KB Output is correct
8 Correct 15 ms 23752 KB Output is correct
9 Correct 60 ms 28036 KB Output is correct
10 Correct 59 ms 28916 KB Output is correct
11 Correct 58 ms 28872 KB Output is correct
12 Correct 64 ms 29132 KB Output is correct
13 Correct 84 ms 29252 KB Output is correct
14 Correct 62 ms 28164 KB Output is correct
15 Correct 114 ms 30820 KB Output is correct
16 Correct 107 ms 30716 KB Output is correct
17 Correct 152 ms 30948 KB Output is correct
18 Correct 140 ms 30980 KB Output is correct
19 Incorrect 118 ms 31704 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 23732 KB Output isn't correct
2 Halted 0 ms 0 KB -