제출 #296111

#제출 시각아이디문제언어결과실행 시간메모리
296111Muhammetali전선 연결 (IOI17_wiring)C++11
13 / 100
40 ms3196 KiB
#include "wiring.h" #include <bits/stdc++.h> #define mp make_pair #define f first #define s second #define sz(x) (int)(x).size() #define rsz resize #define ins insert #define ft front() #define bk back() #define pf push_front #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound using namespace std; typedef long long ll; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pl; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; ll min_total_length(std::vector<int> r, std::vector<int> b) { ll res=0; queue<int> q1,q2; for (int i=0;i<sz(r);i++)q1.push(r[i]); for (int i=0;i<sz(b);i++)q2.push(b[i]); while(sz(q1) && sz(q2)) { res+=abs(q1.ft-q2.ft); q1.pop(); q2.pop(); } while(sz(q1)) { res+=abs(q1.ft-b[0]); q1.pop(); } while(sz(q2)) { res+=abs(q2.ft-r[sz(r)-1]); q2.pop(); } return res; }
#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...