제출 #794319

#제출 시각아이디문제언어결과실행 시간메모리
794319firewater전선 연결 (IOI17_wiring)C++14
13 / 100
24 ms1876 KiB
#include "wiring.h" #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include <cassert> #define ll long long #define mp make_pair #define fs first #define sn second #define MX 202300 using namespace std; ll n,m1,m2,sum[MX]; pair<ll,ll>a[MX]; long long min_total_length(std::vector<int> r, std::vector<int> b) { m1=r.size(); m2=b.size(); ll sum1=0,sum2=0; for(ll i=0;i<m1;++i) sum1+=r[i]; for(ll i=0;i<m2;++i) sum2+=b[i]; return ((sum2-b[0]*m2)+(r[m1-1]*m1-sum1)+(b[0]-r[m1-1])*max(m1,m2)); // for(ll i=1;i<=m1;++i) // a[i]=mp(r[i-1],1); // for(ll i=1;i<=m2;++i) // a[i+m1]=mp(b[i-1],2); // n=m1+m2; // sort(a+1,a+1+n); // for(ll i=1;i<=n;++i) // sum[i]=a[i].fs+sum[i-1]; // return ((a[m1+1].fs*m1-sum[m1])+((sum[n]-sum[m1])-a[m1].fs*m2)-(a[m1+1].fs-a[m1].fs)*((m1>1&&m2>1)?2: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...