제출 #1230048

#제출 시각아이디문제언어결과실행 시간메모리
1230048Jer자매 도시 (APIO20_swap)C++20
0 / 100
47 ms4524 KiB
#include "swap.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

typedef long long ll;

ll total = 0;
bool pos = false;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
	if (N == M)
	{
		pos = true;
		for (int i = 0; i < N; i++)
			total += (ll)W[i];
	}
}

int getMinimumFuelCapacity(int X, int Y)
{
	return (pos) ? total : -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...