Submission #609425

#	Time	Username	Problem	Language	Result	Execution time	Memory
609425		HediChehaidar	Wiring (IOI17_wiring)	C++17	0 / 100	1 ms	468 KiB

wiring

//#include "wiring.h"
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define dte  tuple<double , double , double>
using namespace std;
const int INF = 1000*1000*1000; // 1 e 9
const int MOD = 1e9 + 7;//998244353 ;
const double EPS = 0.000000001; // 1 e -9
const ll inf = (ll)1e18;

vl r , b;
int n , m;
ll min_total_length(vi R, vi B){
    n = R.size(); m = B.size();
    r.clear(); b.clear();
    for(int i = 0 ; i < n ; i++) r.pb(R[i]);
    for(int i = 0 ; i < m ; i++) b.pb(B[i]);
    sort(all(r)); sort(all(b));
    assert(r.back() < b[0]);
    assert(n == m);
    int i = n - 1 , j = 0;
    ll ans = 0;
    if(n > m){
        for(int k = 0 ; k < n - m  ; k++){
            ans += b[0] - r[i]; i--;
        }
    }
    if(m > n){
        for(int k = 0 ; k < m - n  ; k++){
            ans += b[j] - r[0]; j++;
        }
    }
    for(int k = 0 ; k < min(n , m) ; k++){
        ans += b[j] - r[i]; i--; j++;
    }
    assert(i == -1 && j == m );
    return ans;
}

/*int main(){
    //ifstream fin ("testing.txt");
    //ofstream fout ("output.txt");
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    return 0;
}
*/
/*
    Think of : BS / DFS / BFS / SSSP / SCC / MSP / MAX FLOW / TOPSORT / LCA / MATRIX / DP(bitmask) / 2 POINTERS / SEG TREE / MATH / UN FIND / MO / HLD
    Read the statement CAREFULLY !!
    Make a GREADY APPROACH !!!! (start from highest / lowest)
    Make your own TESTS !!
    Be careful from CORNER CASES !
*/

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