제출 #282463

#제출 시각아이디문제언어결과실행 시간메모리
282463MohamedAhmed04전선 연결 (IOI17_wiring)C++14
13 / 100
47 ms4600 KiB
#include <bits/stdc++.h>
#include "wiring.h"
//#include "grader.cpp" 

using namespace std ;

const int MAX = 2e5 + 10 ;

int n , m ;
vector<int>A , B ;

long long min_total_length(std::vector<int> r, std::vector<int> b) 
{
	A = r , B = b ;
	n = A.size() , m = B.size() ;
	long long sum = 0 ;
	for(int i = 0 ; i < n ; ++i)
		sum += B[0] - A[i] ;
	if(m > n)
		sum += (B[0] - A.back()) * 1ll * (m - n) ;
	for(int i = 0 ; i < m ; ++i)
		sum += B[i] - B[0] ;
	return sum ;
}
#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...