# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409868 | soba | Swapping Cities (APIO20_swap) | C++14 | 108 ms | 6968 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "swap.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int ans;
vector<pair<int,int> >vp;
int fromzerotoX[100001];
int n , m;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
n=N;
m=M;
for(int i = 0 ; i < V.size() ; i++)
{
fromzerotoX[V[i]]=W[i];
vp.push_back({W[i], V[i]});
}
ans=*max_element(W.begin() , W.end());
sort(vp.begin() , vp.end());
}
int getMinimumFuelCapacity(int X, int Y){
if(m!=n-1)
return ans;
if(n<4)return -1;
int x=X , y=Y , out=0;
if(x>y)
{
swap(x,y);
}
if(x==0)
{
int c=0;
out=max(out , fromzerotoX[y]);
for(auto u :vp )
{
if(u.second!=y)
{
out=max(out , u.first);
c++;
}
if(c==2)
break;
}
return out;
}
out=max( fromzerotoX[x] , fromzerotoX[y]);
for(auto u :vp )
{
if(u.second!=y&&u.second!=x)
{
out=max(out , u.first);
break;
}
}
return out;
}
Compilation message (stderr)
# | 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... |