제출 #1062635

#제출 시각아이디문제언어결과실행 시간메모리
1062635Malix전선 연결 (IOI17_wiring)C++14
0 / 100
1 ms392 KiB
#include "wiring.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<int,int,int> tii; typedef vector<ll> li; typedef vector<li> lii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define MP make_pair #define LSOne(s) ((s)&(-s)) ll INF=1e18+10; int inf=1e9+10; ll M=1e9+7; long long min_total_length(std::vector<int> r, std::vector<int> b) { stack<int> ar,br; int n=r.size(); int m=b.size(); REP(i,0,n)ar.push(r[i]); REP(i,0,m)br.push(b[i]); ll ans=0; int x=r.back(),y=b.back(); while(!ar.empty()||!br.empty()){ int l=x,r=y; if(!ar.empty()){ l=ar.top(); ar.pop(); } if(!br.empty()){ r=br.top(); br.pop(); } ans+=(ll)r-l; } return ans; }
#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...