oj.uz

답안 #101777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
101777 2019-03-20T06:21:17 Z daniel920712 전선 연결 (IOI17_wiring) C++14
0 / 100
 3 ms 384 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <utility>
#include <vector>
#include <algorithm>
#include "wiring.h"

using namespace std;
pair < long long , pair < int , int > > all[1000005];
bool F(pair < long long , pair < int , int > > a,pair < long long , pair < int , int > > b)
{
    return a<b;
}
int father[200005];
int Find(int here)
{
    if(father[here]==here) return here;
    else
    {
        father[here]=Find(father[here]);
        return father[here];
    }
}

long long min_total_length(vector < int > r, vector < int > b)
{
    int N=r.size();
    int M=b.size();
    int i,j,now=0;
    long long ans=0;
    for(i=0;i<N;i++) for(j=0;j<M;j++) all[now++]=make_pair(abs(r[i]-b[j]),make_pair(i,j+N));
    for(i=0;i<N+M;i++) father[i]=i;
    sort(all,all+now,F);
    for(i=0;i<now;i++)
    {

        if(Find(all[i].second.first)!=Find(all[i].second.second))
        {
            ans+=all[i].first;
            father[Find(all[i].second.first)]=Find(all[i].second.second);
        }
    }

    return ans;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB 3rd lines differ - on the 1st token, expected: '25859', found: '43674'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB 3rd lines differ - on the 1st token, expected: '904', found: '946'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB 3rd lines differ - on the 1st token, expected: '316', found: '356'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 384 KB 3rd lines differ - on the 1st token, expected: '27', found: '40'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB 3rd lines differ - on the 1st token, expected: '25859', found: '43674'
2 Halted 0 ms 0 KB -