제출 #295985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
295985		Trickster	전선 연결 (IOI17_wiring)	C++14	0 / 100	1 ms	256 KiB

wiring

#include "wiring.h"
#include <algorithm>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
#include <map>

using namespace std;

#define N 100010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mod 1000000007
#define pii pair <int, int>
#define sz(a) int(a.size())
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
ll bigmod(ll a,ll e) {if(e==0)return 1;ll x=bigmod(a*a%mod,e>>1);return e&1?x*a%mod:x;}

ll min_total_length(vector <int> r, vector <int> b) {
	int n = sz(r);
	int m = sz(b);

	ll ans = 0;
	if(n <= m) {
		for(int i = 0; i < n-1; i++) {
			ans += b[i] - r[i];
		}
		for(int i = n; i < m; i++) {
			ans += b[i] - r[n-1];
		}		

		return ans;
	} else {
		for(int i = 1; i < m; i++) {
		ans += b[i] - r[i-1];
		}
		for(int i = m; i < n; i++) {
			ans += b[0] - r[i];
		}

		return ans;
	}
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45