oj.uz

Submission #535243

# Submission time Handle Problem Language Result Execution time Memory
535243 2022-03-09T18:14:22 Z NaimSS 007 (CEOI14_007) C++14
0 / 100
 237 ms 16256 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);
  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{
      int v1,v2;
      cout << max(A - (A + getcommon(s) < getcommon(d)),-1) << endl;
    }
    // math -> gcd it all
    // Did u check N=1? Did you switch N,M?
}

Compilation message

007.cpp: In function 'int32_t main()':
007.cpp:112:11: warning: unused variable 'v1' [-Wunused-variable]
  112 |       int v1,v2;
      |           ^~
007.cpp:112:14: warning: unused variable 'v2' [-Wunused-variable]
  112 |       int v1,v2;
      |              ^~

Subtask #1
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Partially correct 3 ms 4940 KB Partially correct
3 Correct 3 ms 4940 KB Output is correct
4 Incorrect 3 ms 4940 KB Output isn't correct
5 Incorrect 3 ms 5020 KB Output isn't correct
6 Correct 3 ms 4936 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Incorrect 3 ms 5004 KB Output isn't correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Incorrect 3 ms 4940 KB Output isn't correct
13 Correct 4 ms 4940 KB Output is correct
14 Incorrect 3 ms 4940 KB Output isn't correct
15 Correct 3 ms 5000 KB Output is correct
16 Incorrect 3 ms 4940 KB Output isn't correct
17 Incorrect 4 ms 5028 KB Output isn't correct
18 Incorrect 3 ms 5024 KB Output isn't correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Incorrect 3 ms 5016 KB Output isn't correct
22 Correct 3 ms 5032 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Incorrect 3 ms 5068 KB Output isn't correct

Subtask #2
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 6684 KB Output is correct
2 Incorrect 29 ms 7432 KB Output isn't correct
3 Correct 24 ms 6752 KB Output is correct
4 Incorrect 28 ms 7432 KB Output isn't correct
5 Correct 23 ms 6560 KB Output is correct
6 Correct 20 ms 6828 KB Output is correct
7 Correct 32 ms 7036 KB Output is correct
8 Correct 25 ms 6964 KB Output is correct
9 Incorrect 35 ms 7432 KB Output isn't correct
10 Correct 114 ms 11812 KB Output is correct
11 Incorrect 49 ms 8644 KB Output isn't correct
12 Correct 78 ms 9672 KB Output is correct
13 Incorrect 53 ms 8928 KB Output isn't correct
14 Correct 47 ms 8388 KB Output is correct
15 Correct 63 ms 9804 KB Output is correct
16 Correct 70 ms 9924 KB Output is correct
17 Correct 57 ms 9444 KB Output is correct
18 Incorrect 60 ms 9536 KB Output isn't correct
19 Correct 96 ms 10528 KB Output is correct
20 Incorrect 149 ms 13412 KB Output isn't correct
21 Incorrect 83 ms 11356 KB Output isn't correct
22 Correct 79 ms 10564 KB Output is correct
23 Correct 81 ms 11320 KB Output is correct
24 Correct 75 ms 11244 KB Output is correct
25 Incorrect 89 ms 10856 KB Output isn't correct
26 Correct 81 ms 10644 KB Output is correct
27 Correct 91 ms 11332 KB Output is correct
28 Correct 103 ms 11596 KB Output is correct
29 Correct 114 ms 12040 KB Output is correct
30 Incorrect 161 ms 14060 KB Output isn't correct
31 Incorrect 96 ms 12300 KB Output isn't correct
32 Correct 98 ms 11404 KB Output is correct
33 Partially correct 110 ms 11596 KB Partially correct
34 Incorrect 108 ms 11820 KB Output isn't correct
35 Incorrect 84 ms 11624 KB Output isn't correct
36 Incorrect 94 ms 11888 KB Output isn't correct
37 Correct 115 ms 12784 KB Output is correct
38 Correct 117 ms 12544 KB Output is correct
39 Correct 122 ms 12564 KB Output is correct
40 Incorrect 168 ms 14132 KB Output isn't correct
41 Correct 237 ms 16256 KB Output is correct