Submission #965714

#TimeUsernameProblemLanguageResultExecution timeMemory
965714pcc자매 도시 (APIO20_swap)C++17
0 / 100
90 ms6708 KiB
#include "swap.h" #include <vector> #include <bits/stdc++.h> using namespace std; #define pii pair<int,int> #define fs first #define sc second const int mxn = 1e5+10; int ans = 0; vector<int> v; int arr[mxn]; int N,M; void init(int NN, int MM, std::vector<int> U, std::vector<int> V, std::vector<int> W) { N = NN,M = MM; for(int i = 0;i<M;i++){ arr[V[i]] = W[i]; v.push_back(W[i]); } sort(v.begin(),v.end()); return; } int getMinimumFuelCapacity(int X, int Y) { if(N<=2)return -1; if(!X){ if(arr[Y] == v[0])return v[1]; else return arr[Y]; } if(N<=3)return -1; vector<int> tmp = {arr[X],arr[Y]}; sort(tmp.begin(),tmp.end()); if(tmp[0] == v[0]&&tmp[1] == v[1])return v[2]; else return tmp[1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...