oj.uz

답안 #347789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347789 2021-01-13T13:33:20 Z ACmachine 007 (CEOI14_007) C++17
100 / 100
 289 ms 24300 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m;
    cin >> n >> m;
    int s, d, a, b;
    cin >> s >> d >> a >> b;
    s--; d--; a--; b--;
    vector<vi> adj(n);
    REP(i, m){
        int u, v;
        cin >> u >> v;
        v--; u--;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    auto bfs = [&](int st){
        vector<int> dist(n, -1);
        dist[st] = 0;
        queue<int> q;
        q.push(st);
        while(!q.empty()){
            int v = q.front();
            q.pop();
            for(int x : adj[v]){
                if(dist[x] == -1){
                    dist[x] = dist[v] + 1;
                    q.push(x);
                }
            }
        }
        return dist;
    };
    vi dist_s = bfs(s);
    vi dist_d = bfs(d);
    vi dist_a = bfs(a);
    vi dist_b = bfs(b);
    int w1 = dist_d[a] - dist_s[a];
    int w2 = dist_d[b] - dist_s[b];
    if(w1 < 0 || w2 < 0){
        cout << -1 << "\n";
        return 0;
    }
    if(abs(w1 - w2) > 0){
        cout << min(w1, w2) << "\n";
        return 0;
    }
    int max_steps_s = -INF;
    int max_steps_d = -INF;
    REP(i, n){
        if(dist_s[i] + dist_a[i] == dist_s[a] && dist_s[i] + dist_b[i] == dist_s[b]){
            max_steps_s = max(max_steps_s, dist_s[i]);
        }
        if(dist_d[i] + dist_a[i] == dist_d[a] && dist_d[i] + dist_b[i] == dist_d[b]){
            max_steps_d = max(max_steps_d, dist_d[i]);
        }
    }
    if(w1 + max_steps_s >= max_steps_d){
        cout << w1 << "\n";
    }
    else{
        cout << w1 - 1 << "\n";
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 384 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 3692 KB Output is correct
2 Correct 33 ms 5228 KB Output is correct
3 Correct 24 ms 3948 KB Output is correct
4 Correct 34 ms 5356 KB Output is correct
5 Correct 23 ms 3512 KB Output is correct
6 Correct 23 ms 3948 KB Output is correct
7 Correct 28 ms 4336 KB Output is correct
8 Correct 29 ms 4332 KB Output is correct
9 Correct 44 ms 5228 KB Output is correct
10 Correct 156 ms 14188 KB Output is correct
11 Correct 66 ms 7916 KB Output is correct
12 Correct 95 ms 9856 KB Output is correct
13 Correct 72 ms 8428 KB Output is correct
14 Correct 49 ms 7148 KB Output is correct
15 Correct 85 ms 9836 KB Output is correct
16 Correct 85 ms 10476 KB Output is correct
17 Correct 78 ms 9324 KB Output is correct
18 Correct 81 ms 9344 KB Output is correct
19 Correct 109 ms 11768 KB Output is correct
20 Correct 191 ms 17772 KB Output is correct
21 Correct 126 ms 13676 KB Output is correct
22 Correct 117 ms 11884 KB Output is correct
23 Correct 121 ms 13420 KB Output is correct
24 Correct 116 ms 13440 KB Output is correct
25 Correct 130 ms 12652 KB Output is correct
26 Correct 119 ms 12012 KB Output is correct
27 Correct 166 ms 13548 KB Output is correct
28 Correct 146 ms 13824 KB Output is correct
29 Correct 151 ms 14956 KB Output is correct
30 Correct 223 ms 19180 KB Output is correct
31 Correct 146 ms 15800 KB Output is correct
32 Correct 153 ms 13548 KB Output is correct
33 Correct 146 ms 13932 KB Output is correct
34 Correct 164 ms 14700 KB Output is correct
35 Correct 139 ms 14060 KB Output is correct
36 Correct 144 ms 14572 KB Output is correct
37 Correct 183 ms 16620 KB Output is correct
38 Correct 153 ms 16236 KB Output is correct
39 Correct 203 ms 16108 KB Output is correct
40 Correct 221 ms 19564 KB Output is correct
41 Correct 289 ms 24300 KB Output is correct