oj.uz

답안 #535245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535245 2022-03-09T18:16:13 Z NaimSS 007 (CEOI14_007) C++14
66.6667 / 100
 220 ms 16876 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
  b%=m;
  ll ans = 1;
  for (; e; b = b * b % m, e /= 2)
      if (e & 1) ans = ans * b % m;
  return ans;
}

// debug:
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ 
  cerr << ' ' << H; 
  dbg_out(T...); 
}
#ifdef LOCAL
#define dbg(...) cerr<<"(" << #__VA_ARGS__<<"):" , dbg_out(__VA_ARGS__) , cerr << endl
#else
#define dbg(...) 42
#endif
//

const int N = 200100;
    int n,m;

vi g[N];

vi dista(int a){
  vector<int> d(n+2);
  rep(i,1,n+1)d[i] = 1e9;
  d[a] = 0;
  priority_queue<pii,vector<pii>,greater<pii>> pq;
  pq.push(pii(d[a],a));
  while(!pq.empty()){
    auto t = pq.top();pq.pop();
    if(t.ff != d[t.ss])continue;
    int v = t.ss;
    for(auto to : g[v])if(d[to] > d[v] + 1){
      d[to] = d[v] + 1;
      pq.push(pii(d[to],to));
    }
  }
  return d;
}

int s,d,a,b;
vi d1,d2;
int vis[N];
int getcommon(int ini){
  queue<int> q;
  q.push(ini);
  vis[ini] = 1;
  int res=0;
  while(!q.empty()){
    int v = q.front();
    q.pop();
    res=max(res,d1[ini] - d1[v]);
    for(auto to : g[v])
    if(!vis[to] && d1[to] == d1[v] - 1 && d2[to] == d2[v] - 1){
      vis[to]=1;q.push(to);
    }
  }
  return res;
}

int32_t main(){
    fastio;
    cin >> n >> m;
    cin >> s >> d >> a >> b;
    assert(a!=b);
    while(m--){
      int u,v;
      cin >> u >> v;
      g[u].pb(v);
      g[v].pb(u);
    }
    d1 = dista(a),d2=dista(b);
    int A = d1[d] - d1[s];
    int B = d2[d] - d1[s];
    if(A!=B){
      cout << max(min(A,B),-1) << endl;
    }else{
      cout << max(A - (A + getcommon(s) < getcommon(d)),-1) << endl;
    }
    // math -> gcd it all
    // Did u check N=1? Did you switch N,M?
}

Subtask #1
13.0 / 30.0

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

Subtask #2
53.666667 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 6752 KB Output is correct
2 Correct 25 ms 7500 KB Output is correct
3 Correct 23 ms 6864 KB Output is correct
4 Correct 39 ms 7580 KB Output is correct
5 Correct 31 ms 6596 KB Output is correct
6 Correct 27 ms 6732 KB Output is correct
7 Correct 27 ms 7000 KB Output is correct
8 Correct 29 ms 7036 KB Output is correct
9 Correct 33 ms 7488 KB Output is correct
10 Correct 113 ms 11844 KB Output is correct
11 Correct 49 ms 8900 KB Output is correct
12 Correct 91 ms 9932 KB Output is correct
13 Correct 52 ms 9236 KB Output is correct
14 Correct 40 ms 8560 KB Output is correct
15 Correct 67 ms 10000 KB Output is correct
16 Correct 72 ms 9716 KB Output is correct
17 Correct 90 ms 9244 KB Output is correct
18 Correct 73 ms 9412 KB Output is correct
19 Correct 86 ms 10844 KB Output is correct
20 Correct 149 ms 13700 KB Output is correct
21 Correct 78 ms 11908 KB Output is correct
22 Correct 79 ms 10928 KB Output is correct
23 Correct 84 ms 11104 KB Output is correct
24 Correct 89 ms 11724 KB Output is correct
25 Correct 83 ms 11332 KB Output is correct
26 Correct 80 ms 10496 KB Output is correct
27 Correct 85 ms 11264 KB Output is correct
28 Correct 94 ms 11332 KB Output is correct
29 Correct 133 ms 12388 KB Output is correct
30 Correct 199 ms 14468 KB Output is correct
31 Correct 101 ms 12912 KB Output is correct
32 Correct 95 ms 11744 KB Output is correct
33 Partially correct 92 ms 11388 KB Partially correct
34 Correct 115 ms 12392 KB Output is correct
35 Correct 109 ms 12144 KB Output is correct
36 Correct 121 ms 12372 KB Output is correct
37 Correct 110 ms 12608 KB Output is correct
38 Correct 124 ms 12460 KB Output is correct
39 Correct 132 ms 12404 KB Output is correct
40 Correct 195 ms 14768 KB Output is correct
41 Correct 220 ms 16876 KB Output is correct