제출 #409848

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
409848		fadi57	Swapping Cities (APIO20_swap)	C++14	6 / 100	161 ms	15028 KiB

swap

#include "swap.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
const int mx=2e5+10;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
vector<int>adj[mx];
int ans=-1;
void init(int n, int M,std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    for(int i=0;i<M;i++){
        adj[U[i]].push_back(V[i]);
          adj[V[i]].push_back(U[i]);
    }
for(auto it:W){
    ans=max(ans,it);
}
  for(int i=0;i<n;i++){
       if(adj[i].size()!=2){
        ans=-1;
       }
    }
}

int getMinimumFuelCapacity(int X, int Y) {
  return ans;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27