제출 #330238

#제출 시각아이디문제언어결과실행 시간메모리
330238egas자매 도시 (APIO20_swap)C++14
0 / 100
480 ms38152 KiB
#include <bits/stdc++.h>
using namespace std;



map<int,set<int>> adj;
map<pair<int,int>,int> edwt;
int SUBTASK1=0;
bool isCyc=0;
bool isCycle(){
	for(auto x:adj){
		if(x.second.size()<=1)return false;
	}
}
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++){
		int x=U[i];
		int y=V[i];
		int z=W[i];
		SUBTASK1=max(SUBTASK1,(W[i]));
		adj[x].insert(y);
		adj[y].insert(x);
		edwt[{x,y}]=z;
		edwt[{y,x}]=z;
	}
	isCyc=isCycle();
}

int getMinimumFuelCapacity(int X, int Y) {
	if(isCyc){
		return SUBTASK1;
	}else
		return -1;
}

컴파일 시 표준 에러 (stderr) 메시지

swap.cpp: In function 'bool isCycle()':
swap.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^
#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...