제출 #948244

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
948244		Lib	경주 (Race) (IOI11_race)	C++14	0 / 100	1 ms	4444 KiB

race

#include <bits/stdc++.h>
#include "race.h";
using namespace std;
vector <vector <pair <int,int> > > adj;
vector <pair <int,int> > TVector;
int SubtreeSize[300003];
long long ans=999999;
void Solve(){
	
}
int best_path(int N, int K, int H[][2], int L[]){
	for(int i=0;i<=N+1;i++){
		adj.push_back(TVector);
	}
	for(int i=1;i<=N-1;i++){
		adj[H[i-1][0]].push_back({H[i-1][1],L[i-1]});
		adj[H[i-1][1]].push_back({H[i-1][0],L[i-1]});
	}
	Solve;
	if(ans==999999){
		return -1;
	}else{
		return ans;
	}
}

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

race.cpp:2:18: warning: extra tokens at end of #include directive
    2 | #include "race.h";
      |                  ^
race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:19:2: warning: statement is a reference, not call, to function 'Solve' [-Waddress]
   19 |  Solve;
      |  ^~~~~
race.cpp:19:2: warning: statement has no effect [-Wunused-value]

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57