oj.uz

답안 #395243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
395243 2021-04-28T03:51:24 Z irmuun 자매 도시 (APIO20_swap) C++17
37 / 100
 2000 ms 8744 KB 
#include "swap.h"
#include<bits/stdc++.h>
using namespace std;
int a,b,i,n,m,link[200000],edge[200000],sz[200000],x,y,ans[200000],edgeNum[200000],h[200000],d,e;
pair<int, pair<int,int> >p[200000];
int find(int x){
  if(link[x]==x){
    return x;
  }
  return link[x]=find(link[x]);
}
bool same(int a,int b){
  if(find(a)==find(b)){
    return true;
  }
  else{
    return false;
  }
}
void unite(int a,int b){
  a=find(a);
  b=find(b);
  if(sz[a]<sz[b]){
    swap(a,b);
  }
  if(ans[b]==1){
    ans[a]=1;
  }
  link[b]=a;
  sz[a]+=sz[b];
}
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  m=M;
  n=N;
  for(i=0;i<n;i++){
    edgeNum[i]=0;
  }
  for(i=0;i<m;i++){
    p[i].first=W[i];
    p[i].second.first=U[i];
    p[i].second.second=V[i];
    edgeNum[U[i]]++;
    edgeNum[V[i]]++;
    h[i+1]=0;
  }
  sort(p,p+m);
  for(i=0;i<n;i++){
    h[edgeNum[i]]++;
  }
}
int getMinimumFuelCapacity(int X, int Y) {
  for(i=0;i<n;i++){
    link[i]=i;
    sz[i]=1;
    edge[i]=0;
    ans[i]=0;
  }
  for(i=0;i<m;i++){
    x=p[i].second.first;
    y=p[i].second.second;
    edge[x]++;
    edge[y]++;
    if(find(x)==find(y)||edge[x]>2||edge[y]>2){
      ans[find(x)]=1;
      ans[find(y)]=1;
    }
    unite(x,y);
    if(find(X)==find(Y)&&ans[find(X)]==1){
      return p[i].first;
    }
  }
  return -1;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 44 ms 4232 KB Output is correct
10 Correct 64 ms 5132 KB Output is correct
11 Correct 66 ms 5008 KB Output is correct
12 Correct 72 ms 5344 KB Output is correct
13 Correct 70 ms 5300 KB Output is correct
14 Execution timed out 2081 ms 4500 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Execution timed out 2064 ms 7276 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 2 ms 460 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 44 ms 4232 KB Output is correct
11 Correct 64 ms 5132 KB Output is correct
12 Correct 66 ms 5008 KB Output is correct
13 Correct 72 ms 5344 KB Output is correct
14 Correct 70 ms 5300 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 316 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 8 ms 1304 KB Output is correct
35 Correct 71 ms 5244 KB Output is correct
36 Correct 68 ms 5132 KB Output is correct
37 Correct 70 ms 5164 KB Output is correct
38 Correct 83 ms 5120 KB Output is correct
39 Correct 68 ms 5156 KB Output is correct
40 Correct 63 ms 4748 KB Output is correct
41 Correct 72 ms 5116 KB Output is correct
42 Correct 69 ms 5124 KB Output is correct
43 Correct 56 ms 5196 KB Output is correct
44 Correct 74 ms 5192 KB Output is correct
45 Correct 103 ms 6472 KB Output is correct
46 Correct 69 ms 5128 KB Output is correct
47 Correct 70 ms 5128 KB Output is correct
48 Correct 73 ms 5384 KB Output is correct
49 Correct 69 ms 6596 KB Output is correct
50 Correct 54 ms 5188 KB Output is correct
51 Correct 76 ms 5740 KB Output is correct
52 Correct 102 ms 7140 KB Output is correct
53 Correct 103 ms 7876 KB Output is correct
54 Correct 119 ms 8744 KB Output is correct
55 Correct 59 ms 5128 KB Output is correct
56 Correct 122 ms 7528 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 44 ms 4232 KB Output is correct
10 Correct 64 ms 5132 KB Output is correct
11 Correct 66 ms 5008 KB Output is correct
12 Correct 72 ms 5344 KB Output is correct
13 Correct 70 ms 5300 KB Output is correct
14 Execution timed out 2081 ms 4500 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 44 ms 4232 KB Output is correct
11 Correct 64 ms 5132 KB Output is correct
12 Correct 66 ms 5008 KB Output is correct
13 Correct 72 ms 5344 KB Output is correct
14 Correct 70 ms 5300 KB Output is correct
15 Execution timed out 2081 ms 4500 KB Time limit exceeded
16 Halted 0 ms 0 KB -