oj.uz

Submission #394890

# Submission time Handle Problem Language Result Execution time Memory
394890 2021-04-27T12:27:04 Z Sugardorj Swapping Cities (APIO20_swap) C++14
37 / 100
 2000 ms 7388 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
int  i,j,s,t;
int link[261523],size[234567],c[234567],a[234567],l=12345678,r,tt,k,y,z,n,m,x;
pair<int,pair<int,int>>p[234567];
 
void init(int N, int M, vector <int> U, vector <int> V, vector <int> W) {
    n = N;
    m = M;
    for (i = 0; i <m; i ++){
        p[i].first=W[i];
        p[i].second.first=U[i];
        p[i].second.second=V[i];
    }
    sort (p,p+m);
}
int find(int x) {
    if(x==link[x])return x;
  else return link[x]=find(link[x]);
}
bool same(int x, int y) {
    return find(x) == find(y);
}
void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (size[x] < size[y]) 
        swap(x,y);
    size[x] += size[y];
    if (c[y]==1)
        c[x]=1;
    link[y] = x;
}
int getMinimumFuelCapacity(int u, int v) {
    for (i = 0; i<n; i ++){
        link[i]=i;
        size[i]=1;
        c[i]=0;
        a[i]=0;
    }
    for (i = 0; i <m; i ++){
        x=p[i].second.first;
        y=p[i].second.second;
        a[x]++;
        a[y]++;
        if (find(x)==find(y)||a[x]>2||a[y]>2){
            c[find(x)]=1;
            c[find(y)]=1;
        }
        unite(x,y);
        
        
        if (find(u)==find(v)&&c[find(u)]==1){
            return p[i].first;
        }
    }
    
    
    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 336 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 43 ms 3368 KB Output is correct
10 Correct 65 ms 4188 KB Output is correct
11 Correct 67 ms 4140 KB Output is correct
12 Correct 88 ms 4140 KB Output is correct
13 Correct 81 ms 4144 KB Output is correct
14 Execution timed out 2077 ms 3500 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 2069 ms 6272 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 336 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 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 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 264 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 3 ms 436 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 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 336 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 43 ms 3368 KB Output is correct
11 Correct 65 ms 4188 KB Output is correct
12 Correct 67 ms 4140 KB Output is correct
13 Correct 88 ms 4140 KB Output is correct
14 Correct 81 ms 4144 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 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 264 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 1 ms 332 KB Output is correct
30 Correct 3 ms 436 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 9 ms 1032 KB Output is correct
35 Correct 68 ms 4372 KB Output is correct
36 Correct 68 ms 4260 KB Output is correct
37 Correct 69 ms 4256 KB Output is correct
38 Correct 71 ms 4312 KB Output is correct
39 Correct 68 ms 4204 KB Output is correct
40 Correct 78 ms 3880 KB Output is correct
41 Correct 71 ms 4252 KB Output is correct
42 Correct 68 ms 4352 KB Output is correct
43 Correct 62 ms 4252 KB Output is correct
44 Correct 74 ms 4264 KB Output is correct
45 Correct 94 ms 5580 KB Output is correct
46 Correct 68 ms 4272 KB Output is correct
47 Correct 69 ms 4344 KB Output is correct
48 Correct 72 ms 4516 KB Output is correct
49 Correct 67 ms 5992 KB Output is correct
50 Correct 54 ms 4664 KB Output is correct
51 Correct 75 ms 4892 KB Output is correct
52 Correct 98 ms 6028 KB Output is correct
53 Correct 99 ms 6632 KB Output is correct
54 Correct 122 ms 7388 KB Output is correct
55 Correct 59 ms 4376 KB Output is correct
56 Correct 121 ms 6408 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 336 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 43 ms 3368 KB Output is correct
10 Correct 65 ms 4188 KB Output is correct
11 Correct 67 ms 4140 KB Output is correct
12 Correct 88 ms 4140 KB Output is correct
13 Correct 81 ms 4144 KB Output is correct
14 Execution timed out 2077 ms 3500 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 336 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 43 ms 3368 KB Output is correct
11 Correct 65 ms 4188 KB Output is correct
12 Correct 67 ms 4140 KB Output is correct
13 Correct 88 ms 4140 KB Output is correct
14 Correct 81 ms 4144 KB Output is correct
15 Execution timed out 2077 ms 3500 KB Time limit exceeded
16 Halted 0 ms 0 KB -