#include<bits/stdc++.h>
#include "swap.h"
using namespace std;
const int lim = 1e5 + 5;
bool is_sub2;
int n, m, u[lim << 1], v[lim << 1], w[lim << 1];
vector<int>g[lim];
namespace sub2{
vector<int>p;
void init(){
p.resize(n - 1);
iota(p.begin(), p.end(), 1);
sort(p.begin(), p.end(), [&] (int i, int j){
return w[g[i][0]] < w[g[j][0]];
});
}
}
void init(int N, int M, vector<int>U, vector<int>V, vector<int>W){
n = N;
m = M;
for(int i = 0; i < m; i++){
g[u[i] = U[i]].emplace_back(i);
g[v[i] = V[i]].emplace_back(i);
w[i] = W[i];
}
if(is_sub2 = (*max_element(u, u + m) == 0 && m == n - 1)){
sub2::init();
return;
}
}
int getMinimumFuelCapacity(int x, int y){
if(is_sub2){
if(x == 0){
return n < 4 ? -1 : max(w[g[y][0]], w[g[sub2::p[2]][0]]);
}
return n < 4 ? -1 : max({w[g[x][0]], w[g[y][0]], w[g[sub2::p[2]][0]]});
}
}
Compilation message (stderr)
swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:38:1: warning: control reaches end of non-void function [-Wreturn-type]
38 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |