# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59167 | TadijaSebez | Wiring (IOI17_wiring) | C++11 | 95 ms | 102528 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
const int N=200050;
const ll inf=1e18;
pair<int,int> a[N];
ll dp[N],f[N];
int last[2],cnt[N];
ll max(ll a, ll b){ return a>b?a:b;}
ll min(ll a, ll b){ return a>b?b:a;}
ll min_total_length(vector<int> r, vector<int> b)
{
int i,j,n;n=r.size()+b.size();
for(i=0;i<r.size();i++) a[i+1]=mp(r[i],0);
for(i=0;i<b.size();i++) a[i+1+r.size()]=mp(b[i],1);
sort(a+1,a+1+n);a[0].second=2;
bool ok;ll sum=0;last[0]=last[1]=0;
for(i=1;i<=n;i++)
{
dp[i]=inf;
if(!last[a[i].second^1]){ last[a[i].second]=i;continue;}
//printf("%i %i %i\n",i,last[0],last[1]);
if(a[i].second!=a[i-1].second)
{
//printf("->%i<-\n",i);
ll cost=0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |