Submission #157077

#	Time	Username	Problem	Language	Result	Execution time	Memory
157077		AKaan37	전선 연결 (IOI17_wiring)	C++17	0 / 100	2 ms	504 KiB

wiring

//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include "wiring.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
 
using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,mx;
int cev;
queue<int> q;
string s;
vector<PII> v;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	for(int i=0;i<(int)r.size();i++){v.pb(mp(r[i],1));}
	for(int i=0;i<(int)b.size();i++){v.pb(mp(b[i],2));}
	sort(v.begin(),v.end());
	FOR{
		if(v[i].se==1)q.push(v[i].fi);
		else{
			if(q.size()){
				cev+=abs(v[i].fi-q.front());
				mx=max(mx,q.front());
				q.pop();
			}
			else cev+=abs(v[i].fi-mx);
		}
	}
	return cev;
}

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