Submission #1329195

#TimeUsernameProblemLanguageResultExecution timeMemory
1329195DanielPr8전선 연결 (IOI17_wiring)C++20
13 / 100
14 ms2216 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvl = vector<vll>;
using pll = pair<ll,ll>;
using vpl = vector<pll>;
using vvp = vector<vpl>;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(),v.end()


long long min_total_length(std::vector<int> r, std::vector<int> b) {
    ll ans=0;
    while(r.size()<b.size()){r.pb(r.back());}
    reverse(all(b));
    while(b.size()<r.size()){b.pb(b.back());}
    reverse(all(b));
    for(ll i = 0; i < max(r.size(),b.size());++i){
        ans += abs(b[i]-r[i]);
    }
    return ans;
}


// int main() {
// 	int n, m;
// 	assert(2 == scanf("%d %d", &n, &m));

// 	vector<int> r(n), b(m);
// 	for(int i = 0; i < n; i++)
// 		assert(1 == scanf("%d", &r[i]));
// 	for(int i = 0; i < m; i++)
// 		assert(1 == scanf("%d", &b[i]));

// 	long long res = min_total_length(r, b);
// 	printf("%lld\n", res);

// 	return 0;
// }

#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...