oj.uz

답안 #412227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
412227 2021-05-26T15:51:49 Z Carmel_Ab1 자매 도시 (APIO20_swap) C++17
17 / 100
 2000 ms 15688 KB 
#include<bits/stdc++.h>
#include "swap.h"

//#include "grader.cpp"

using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


vector<vector<pi>> g;
vector<bool>vis;
int mx=-1;
void init(int n, int M,vi U,vi V,vi W){
    g.resize(n);
    vis.resize(n);
    mx=*max_element(all(W))+1;
    for(int i=0; i<M; i++){
        g[U[i]].pb({V[i],W[i]});
        g[V[i]].pb({U[i],W[i]});
    }
}

bool ans;
void dfs(int src,int par,int w){
    vis[src]=1;
    int cnt=0;
    for(pi nbr:g[src])
        if(nbr.second<=w)
            cnt++;
    if(cnt>2)
        ans=1;
    for(pi nbr:g[src]) {
        if(nbr.first==par || nbr.second>w)continue;
        if(vis[nbr.first])ans=1;
        else dfs(nbr.first,src,w);
    }
}
bool ok(int x,int y,int w){
    int n=g.size();
    vis.assign(n,0);
    ans=0;
    dfs(x,-1,w);
    if(!vis[y])return 0;
    return ans;

}

int getMinimumFuelCapacity(int X, int Y){
    ll l=1,r=mx,ans=-1;
    if(!ok(X,Y,mx))
        return -1;
    while(l<=r){
        ll m=(l+r)/2;
        if(ok(X,Y,m))
            ans=m,r=m-1;
        else
            l=m+1;
    }
    return ans;
}

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 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 68 ms 10276 KB Output is correct
10 Correct 106 ms 12068 KB Output is correct
11 Correct 101 ms 12136 KB Output is correct
12 Correct 107 ms 12196 KB Output is correct
13 Correct 119 ms 12840 KB Output is correct
14 Execution timed out 2078 ms 10704 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 2082 ms 9912 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.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 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 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 3 ms 332 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 7 ms 460 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 5 ms 460 KB Output is correct

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 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 68 ms 10276 KB Output is correct
11 Correct 106 ms 12068 KB Output is correct
12 Correct 101 ms 12136 KB Output is correct
13 Correct 107 ms 12196 KB Output is correct
14 Correct 119 ms 12840 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 4 ms 332 KB Output is correct
28 Correct 3 ms 332 KB Output is correct
29 Correct 4 ms 460 KB Output is correct
30 Correct 4 ms 332 KB Output is correct
31 Correct 7 ms 460 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 5 ms 460 KB Output is correct
34 Correct 17 ms 1384 KB Output is correct
35 Correct 235 ms 11640 KB Output is correct
36 Correct 186 ms 9644 KB Output is correct
37 Correct 206 ms 8128 KB Output is correct
38 Correct 330 ms 8004 KB Output is correct
39 Correct 229 ms 7976 KB Output is correct
40 Correct 293 ms 7484 KB Output is correct
41 Correct 700 ms 10272 KB Output is correct
42 Correct 277 ms 10844 KB Output is correct
43 Correct 449 ms 12696 KB Output is correct
44 Correct 451 ms 8640 KB Output is correct
45 Correct 907 ms 11524 KB Output is correct
46 Correct 415 ms 11208 KB Output is correct
47 Correct 477 ms 8008 KB Output is correct
48 Correct 504 ms 8648 KB Output is correct
49 Correct 143 ms 8900 KB Output is correct
50 Correct 157 ms 6572 KB Output is correct
51 Correct 489 ms 9908 KB Output is correct
52 Correct 910 ms 13768 KB Output is correct
53 Correct 631 ms 13504 KB Output is correct
54 Execution timed out 2031 ms 15688 KB Time limit exceeded
55 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 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 68 ms 10276 KB Output is correct
10 Correct 106 ms 12068 KB Output is correct
11 Correct 101 ms 12136 KB Output is correct
12 Correct 107 ms 12196 KB Output is correct
13 Correct 119 ms 12840 KB Output is correct
14 Execution timed out 2078 ms 10704 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 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 68 ms 10276 KB Output is correct
11 Correct 106 ms 12068 KB Output is correct
12 Correct 101 ms 12136 KB Output is correct
13 Correct 107 ms 12196 KB Output is correct
14 Correct 119 ms 12840 KB Output is correct
15 Execution timed out 2078 ms 10704 KB Time limit exceeded
16 Halted 0 ms 0 KB -