oj.uz

답안 #394889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394889 2021-04-27T12:25:08 Z Sugardorj 자매 도시 (APIO20_swap) C++14
0 / 100
 2000 ms 6252 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
int  i,j,s,t;
int link[261523],size[234567],a[234567],l=12345678,r,tt,k,y,z,n,m,x;
pair<int,pair<int,int>>p[234567];
bool c[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]++;
        t=0;
        if (a[x]>2||a[y]>2){
            t=1;
        }
        x=find(x);
        y=find(y);
        if (x==y)
            c[x]=1;
        
        unite(x,y);
        
        if (find(u)==find(v)&&c[find(u)]==1){
            return p[i].first;
        }
    }
    
    
    return -1;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 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 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 51 ms 3324 KB Output is correct
10 Correct 69 ms 4064 KB Output is correct
11 Correct 65 ms 4000 KB Output is correct
12 Correct 72 ms 4188 KB Output is correct
13 Correct 73 ms 4196 KB Output is correct
14 Execution timed out 2085 ms 3516 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

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

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 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 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Incorrect 1 ms 332 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 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 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 51 ms 3324 KB Output is correct
11 Correct 69 ms 4064 KB Output is correct
12 Correct 65 ms 4000 KB Output is correct
13 Correct 72 ms 4188 KB Output is correct
14 Correct 73 ms 4196 KB Output is correct
15 Incorrect 1 ms 332 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 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 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 51 ms 3324 KB Output is correct
10 Correct 69 ms 4064 KB Output is correct
11 Correct 65 ms 4000 KB Output is correct
12 Correct 72 ms 4188 KB Output is correct
13 Correct 73 ms 4196 KB Output is correct
14 Execution timed out 2085 ms 3516 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 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 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 51 ms 3324 KB Output is correct
11 Correct 69 ms 4064 KB Output is correct
12 Correct 65 ms 4000 KB Output is correct
13 Correct 72 ms 4188 KB Output is correct
14 Correct 73 ms 4196 KB Output is correct
15 Execution timed out 2085 ms 3516 KB Time limit exceeded
16 Halted 0 ms 0 KB -