oj.uz

Submission #395245

# Submission time Handle Problem Language Result Execution time Memory
395245 2021-04-28T03:55:09 Z irmuun Swapping Cities (APIO20_swap) C++17
37 / 100
 2000 ms 7756 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],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]]++;
  }
  sort(p,p+m);
  sort(edgeNum,edgeNum+n);
}
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;
    }
  }
  if(edgeNum[0]==edgeNum[n-1]&&edgeNum[0]==2){
    return p[m-1].first;
  }
  else{
    return -1;
  }
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 456 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 45 ms 3632 KB Output is correct
10 Correct 65 ms 4444 KB Output is correct
11 Correct 67 ms 4284 KB Output is correct
12 Correct 72 ms 4584 KB Output is correct
13 Correct 71 ms 4520 KB Output is correct
14 Execution timed out 2075 ms 3884 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Execution timed out 2086 ms 6576 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 456 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 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 1 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 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 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 2 ms 332 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 45 ms 3632 KB Output is correct
11 Correct 65 ms 4444 KB Output is correct
12 Correct 67 ms 4284 KB Output is correct
13 Correct 72 ms 4584 KB Output is correct
14 Correct 71 ms 4520 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 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 1 ms 332 KB Output is correct
25 Correct 1 ms 332 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 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 7 ms 940 KB Output is correct
35 Correct 70 ms 4648 KB Output is correct
36 Correct 70 ms 4648 KB Output is correct
37 Correct 72 ms 4520 KB Output is correct
38 Correct 77 ms 4536 KB Output is correct
39 Correct 70 ms 4532 KB Output is correct
40 Correct 67 ms 4132 KB Output is correct
41 Correct 72 ms 4540 KB Output is correct
42 Correct 69 ms 4532 KB Output is correct
43 Correct 57 ms 4536 KB Output is correct
44 Correct 77 ms 4568 KB Output is correct
45 Correct 95 ms 5740 KB Output is correct
46 Correct 68 ms 4524 KB Output is correct
47 Correct 70 ms 4540 KB Output is correct
48 Correct 74 ms 4836 KB Output is correct
49 Correct 76 ms 5884 KB Output is correct
50 Correct 53 ms 4548 KB Output is correct
51 Correct 79 ms 5084 KB Output is correct
52 Correct 107 ms 6300 KB Output is correct
53 Correct 104 ms 6896 KB Output is correct
54 Correct 123 ms 7756 KB Output is correct
55 Correct 60 ms 4604 KB Output is correct
56 Correct 124 ms 6676 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 456 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 45 ms 3632 KB Output is correct
10 Correct 65 ms 4444 KB Output is correct
11 Correct 67 ms 4284 KB Output is correct
12 Correct 72 ms 4584 KB Output is correct
13 Correct 71 ms 4520 KB Output is correct
14 Execution timed out 2075 ms 3884 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 45 ms 3632 KB Output is correct
11 Correct 65 ms 4444 KB Output is correct
12 Correct 67 ms 4284 KB Output is correct
13 Correct 72 ms 4584 KB Output is correct
14 Correct 71 ms 4520 KB Output is correct
15 Execution timed out 2075 ms 3884 KB Time limit exceeded
16 Halted 0 ms 0 KB -