結果

問題 No.1868 Teleporting Cyanmond
ユーザー popofypopofy
提出日時 2022-03-11 21:42:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 21 ms / 2,000 ms
コード長 5,409 bytes
コンパイル時間 2,170 ms
コンパイル使用メモリ 206,940 KB
実行使用メモリ 9,792 KB
最終ジャッジ日時 2023-10-14 06:43:10
合計ジャッジ時間 3,752 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,352 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 1 ms
4,352 KB
testcase_03 AC 17 ms
9,060 KB
testcase_04 AC 13 ms
7,292 KB
testcase_05 AC 3 ms
4,348 KB
testcase_06 AC 4 ms
4,348 KB
testcase_07 AC 9 ms
5,960 KB
testcase_08 AC 7 ms
4,976 KB
testcase_09 AC 8 ms
5,556 KB
testcase_10 AC 15 ms
8,088 KB
testcase_11 AC 2 ms
4,348 KB
testcase_12 AC 5 ms
4,564 KB
testcase_13 AC 10 ms
6,044 KB
testcase_14 AC 18 ms
9,268 KB
testcase_15 AC 12 ms
6,980 KB
testcase_16 AC 4 ms
4,348 KB
testcase_17 AC 5 ms
4,512 KB
testcase_18 AC 21 ms
9,628 KB
testcase_19 AC 21 ms
9,580 KB
testcase_20 AC 20 ms
9,648 KB
testcase_21 AC 21 ms
9,572 KB
testcase_22 AC 20 ms
9,792 KB
testcase_23 AC 20 ms
9,604 KB
testcase_24 AC 19 ms
9,580 KB
testcase_25 AC 19 ms
9,556 KB
testcase_26 AC 20 ms
9,652 KB
testcase_27 AC 20 ms
9,652 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
//#define __INCLUDE_ATCODER_LIB
//#define __INTERPRETER
#ifdef __INCLUDE_ATCODER_LIB
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
#define overload4(a, b, c, d, e, ...) e
#define rep1(a)          for(decltype(a) i = 0, i##_len = (a); i < i##_len; ++i)
#define rep2(i, a)       for(decltype(a) i = 0, i##_len = (a); i < i##_len; ++i)
#define rep3(i, a, b)    for(decltype(b) i = (a), i##_len = (b); i < i##_len; ++i)
#define rep4(i, a, b, c) for(decltype(b) i = (a), i##_len = (b); i < i##_len; i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a)          for(decltype(a) i = (a); i--;)
#define rrep2(i, a)       for(decltype(a) i = (a); i--;)
#define rrep3(i, a, b)    for(decltype(a) i = (b), i##_len = (a); i-- > i##_len;)
#define rrep4(i, a, b, c) for(decltype(a) i = (a)+((b)-(a)-1)/(c)*(c), i##_len = (a); i >= i##_len; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define yes(s) cout << ((s)?"Yes":"No") << "\n";
#define bit(n) (1LL << ((int)(n)))
#define get1bit(x,n) (((x) >> (int)(n)) & 1)
#define INF ((1 << 30) - 1)
#define INFL (1LL << 60)
#define PRECISION std::setprecision(16)
#ifdef __INTERPRETER
#define NO_SYNC_STD
#define ENDL std::endl
#else
#define NO_SYNC_STD std::cin.tie(nullptr);ios::sync_with_stdio(false)
#define ENDL "\n"
#endif
#ifdef __LOCAL
#include <dump.hpp>
#define dump(...) DUMPOUT << "  " << string(#__VA_ARGS__) << ": " << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl << "    ", dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
using ll=long long;using ld=long double;template<class T> using V=vector<T>;template<class T> using VV=vector<vector<T>>;template<class T> using PQ=priority_queue<T,V<T>,greater<T>>;
template<class T> istream &operator>>(istream &is,complex<T> &v){T x,y; is >> x >> y;v.real(x);v.imag(y);return is;}
template<class T> istream &operator>>(istream &is,V<T> &v){for(auto&& e:v)is >> e;return is;}
template<class T,class U> istream &operator>>(istream &is,pair<T,U> &v){is >> v.first >> v.second;return is;}
template<class T,size_t n> istream &operator>>(istream &is,array<T,n> &v){for(auto&& e:v)is >> e;return is;}
template<class... A> void print_rest(){cout << ENDL;}
template<class T,class... A> void print_rest(const T& first,const A&... rest){cout << " " << first;print_rest(rest...);}
template<class T,class... A> void print(const T& first,const A&... rest){cout << fixed << PRECISION << first;print_rest(rest...);}
template<class T,class... A> void printx(const T& first,const A&... rest){cout << fixed << PRECISION << first;print_rest(rest...);exit(0);}
template<class T> inline string join(const T& v,string sep=" "){if(v.size() == 0)return "";stringstream ss;for(auto&& e:v)ss << sep << e;return ss.str().substr(sz(sep));}
template<class T> inline string padding(const T& v,int length,char pad=' ',bool left=false){stringstream ss;ss << (left?std::left:std::right) << setw(length) << setfill(pad) << v;return ss.str();}
template<class T> V<T> make_vec(size_t n,T a){return V<T>(n,a);}
template<class... Ts> auto make_vec(size_t n,Ts... ts){return V<decltype(make_vec(ts...))>(n,make_vec(ts...));}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template<class T> inline int lower_index(V<T>&a,T x){return distance(a.begin(),lower_bound(all(a),x));}
template<class T> inline int upper_index(V<T>&a,T x){return distance(a.begin(),upper_bound(all(a),x));}
template<class T,class F> pair<T,T> binarysearch(T ng,T ok,T eps,F f,bool sign=false){while(abs(ng-ok)>eps){auto mid=ng+(ok-ng)/2;if(sign^f(mid)){ok=mid;}else{ng=mid;}}return{ng,ok};}
template<class T> constexpr T cdiv(T x,T y){return (x+y-1)/y;}
template<class T> constexpr bool between(T a,T x,T b){return(a<=x&&x<b);}
template<class T> constexpr T pos1d(T y,T x,T h,T w){assert(between(T(0),y,h));assert(between(T(0),x,w));return y*w+x;}
template<class T> constexpr pair<T,T> pos2d(T p,T h,T w){T y=p/w,x=p-y*w;assert(between(T(0),y,h));assert(between(T(0),x,w));return{y,x};}
constexpr ll modpow(ll x,ll n,ll m=1152921504606846976LL){ll ret=1;for(;n>0;x=(__int128)x*x%m,n>>=1)if(n&1)ret=(__int128)ret*x%m;return ret;}
constexpr ll keta(ll n, ll base = 10LL) {ll ret = 0; while(n > 0) {n /= base, ret++;} return ret;}
constexpr int pcnt(ll x) {return __builtin_popcountll(x);}
constexpr int flog(ll x) {return 63 - __builtin_clzll(x);}
constexpr int clog(ll x) {return (x==1LL)?0:(64-__builtin_clzll(x-1LL));}


struct Solver {
  void solve() {
    int n; cin >> n;
    V<int> r(n+1);
    int maxr = 0;
    V<int> mr(n+1);
    rep(i,1,n) {
      cin >> r[i];
      chmax(maxr, r[i]);
      mr[i] = maxr;
    }
    dump(mr);
    VV<int> G(n+1);
    rep(i,1,n) {
      G[i].push_back(mr[i]);
    }
    // bfs
    queue<int> que;
    V<int> dist(n+1, INF);
    dist[1] = 0;
    que.push(1);
    while(!que.empty()) {
      int u = que.front(); que.pop();
      for(auto v: G[u]) {
        if (dist[v] != INF) continue;
        dist[v] = dist[u] + 1;
        que.push(v);
      }
    }
    print(dist[n]);
  }
} solver;
signed main(void){NO_SYNC_STD;dump("");solver.solve();return 0;}
0