結果

問題 No.1473 おでぶなおばけさん
ユーザー LayCurseLayCurse
提出日時 2021-04-09 21:36:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 27 ms / 2,000 ms
コード長 7,183 bytes
コンパイル時間 2,911 ms
コンパイル使用メモリ 220,252 KB
実行使用メモリ 9,600 KB
最終ジャッジ日時 2024-06-25 04:31:59
合計ジャッジ時間 5,576 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 25 ms
9,088 KB
testcase_03 AC 19 ms
8,064 KB
testcase_04 AC 14 ms
7,040 KB
testcase_05 AC 6 ms
5,376 KB
testcase_06 AC 21 ms
8,064 KB
testcase_07 AC 24 ms
9,344 KB
testcase_08 AC 27 ms
9,600 KB
testcase_09 AC 25 ms
9,344 KB
testcase_10 AC 17 ms
7,040 KB
testcase_11 AC 17 ms
6,912 KB
testcase_12 AC 17 ms
6,912 KB
testcase_13 AC 11 ms
6,016 KB
testcase_14 AC 9 ms
5,504 KB
testcase_15 AC 15 ms
6,656 KB
testcase_16 AC 16 ms
6,912 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 16 ms
6,400 KB
testcase_20 AC 18 ms
7,808 KB
testcase_21 AC 21 ms
6,784 KB
testcase_22 AC 23 ms
8,320 KB
testcase_23 AC 20 ms
8,320 KB
testcase_24 AC 20 ms
7,808 KB
testcase_25 AC 23 ms
8,064 KB
testcase_26 AC 23 ms
8,064 KB
testcase_27 AC 11 ms
5,376 KB
testcase_28 AC 26 ms
9,344 KB
testcase_29 AC 19 ms
6,912 KB
testcase_30 AC 22 ms
7,168 KB
testcase_31 AC 19 ms
9,344 KB
testcase_32 AC 13 ms
8,320 KB
testcase_33 AC 13 ms
7,680 KB
testcase_34 AC 7 ms
5,632 KB
testcase_35 AC 8 ms
5,760 KB
testcase_36 AC 19 ms
6,784 KB
testcase_37 AC 18 ms
7,808 KB
testcase_38 AC 6 ms
5,376 KB
testcase_39 AC 16 ms
6,784 KB
testcase_40 AC 16 ms
6,784 KB
testcase_41 AC 15 ms
6,656 KB
testcase_42 AC 15 ms
6,912 KB
testcase_43 AC 12 ms
7,808 KB
testcase_44 AC 12 ms
7,552 KB
testcase_45 AC 13 ms
7,680 KB
testcase_46 AC 18 ms
7,680 KB
testcase_47 AC 22 ms
8,448 KB
testcase_48 AC 19 ms
8,192 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:366:16: warning: 'r1' may be used uninitialized [-Wmaybe-uninitialized]
  366 |   while(D[M-1] < r1){
      |         ~~~~~~~^~~~
main.cpp:344:7: note: 'r1' was declared here
  344 |   int r1;
      |       ^~

ソースコード

diff # 

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void*wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
template<class T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){
  walloc1d(arr, x2-x1, mem);
  (*arr) -= x1;
}
template<class T1, class T2> void sortA_L(int N, T1 a[], T2 b[], void *mem = wmem){
  int i;
  pair<T1, T2>*arr;
  walloc1d(&arr, N, &mem);
  for(i=(0);i<(N);i++){
    arr[i].first = a[i];
    arr[i].second = b[i];
  }
  sort(arr, arr+N);
  for(i=(0);i<(N);i++){
    a[i] = arr[i].first;
    b[i] = arr[i].second;
  }
}
template<class T1, class T2, class T3> void sortA_L(int N, T1 a[], T2 b[], T3 c[], void *mem = wmem){
  int i;
  pair<T1, pair<T2, T3> >*arr;
  walloc1d(&arr, N, &mem);
  for(i=(0);i<(N);i++){
    arr[i].first = a[i];
    arr[i].second.first = b[i];
    arr[i].second.second = c[i];
  }
  sort(arr, arr+N);
  for(i=(0);i<(N);i++){
    a[i] = arr[i].first;
    b[i] = arr[i].second.first;
    c[i] = arr[i].second.second;
  }
}
template<class T1, class T2> void rsortA_L(int N, T1 a[], T2 b[], void *mem = wmem){
  sortA_L(N, a, b, mem);
  reverse(a, a+N);
  reverse(b, b+N);
}
template<class T1, class T2, class T3> void rsortA_L(int N, T1 a[], T2 b[], T3 c[], void *mem = wmem){
  sortA_L(N, a, b, c, mem);
  reverse(a, a+N);
  reverse(b, b+N);
  reverse(c, c+N);
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
struct unionFind{
  int*d;
  int N;
  int M;
  inline void malloc(const int n){
    d = (int*)std::malloc(n*sizeof(int));
    M = n;
  }
  inline void malloc(const int n, const int fg){
    d = (int*)std::malloc(n*sizeof(int));
    M = n;
    if(fg){
      init(n);
    }
  }
  inline void free(void){
    std::free(d);
  }
  inline void walloc(const int n, void **mem=&wmem){
    walloc1d(&d, n, mem);
    M = n;
  }
  inline void walloc(const int n, const int fg, void **mem=&wmem){
    walloc1d(&d, n, mem);
    M = n;
    if(fg){
      init(n);
    }
  }
  inline void init(const int n){
    int i;
    N = n;
    for(i=(0);i<(n);i++){
      d[i] = -1;
    }
  }
  inline void init(void){
    init(M);
  }
  inline int get(int a){
    int t = a;
    int k;
    while(d[t]>=0){
      t=d[t];
    }
    while(d[a]>=0){
      k=d[a];
      d[a]=t;
      a=k;
    }
    return a;
  }
  inline int connect(int a, int b){
    if(d[a]>=0){
      a=get(a);
    }
    if(d[b]>=0){
      b=get(b);
    }
    if(a==b){
      return 0;
    }
    if(d[a] < d[b]){
      d[a] += d[b];
      d[b] = a;
    }
    else{
      d[b] += d[a];
      d[a] = b;
    }
    return 1;
  }
  inline int operator()(int a){
    return get(a);
  }
  inline int operator()(int a, int b){
    return connect(a,b);
  }
  inline int& operator[](const int a){
    return d[a];
  }
  inline int size(int a){
    a = get(a);
    return -d[a];
  }
  inline int sizeList(int res[]){
    int i;
    int sz=0;
    for(i=(0);i<(N);i++){
      if(d[i]<0){
        res[sz++] = -d[i];
      }
    }
    return sz;
  }
}
;
struct graph{
  int N;
  int*es;
  int**edge;
  void setEdge(int N__, int M, int A[], int B[], void **mem = &wmem){
    int i;
    N = N__;
    walloc1d(&es, N, mem);
    walloc1d(&edge, N, mem);
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      es[A[i]]++;
      es[B[i]]++;
    }
    for(i=(0);i<(N);i++){
      walloc1d(&edge[i], es[i], mem);
    }
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      edge[A[i]][es[A[i]]++] = B[i];
      edge[B[i]][es[B[i]]++] = A[i];
    }
  }
  void getDist(int root, int res[], void *mem = wmem){
    int i;
    int j;
    int k;
    int*q;
    int s;
    int z;
    walloc1d(&q, N, &mem);
    for(i=(0);i<(N);i++){
      res[i]=-1;
    }
    res[root]=0;
    s=0;
    z=1;
    q[0]=root;
    while(z){
      i=q[s++];
      z--;
      for(j=(0);j<(es[i]);j++){
        k=edge[i][j];
        if(res[k]>=0){
          continue;
        }
        res[k]=res[i]+1;
        q[s+z++]=k;
      }
    }
  }
  int getDist(int a, int b, void *mem = wmem){
    int i;
    int j;
    int k;
    int*q;
    int s;
    int z;
    int*d;
    if(a==b){
      return 0;
    }
    walloc1d(&d, N, &mem);
    walloc1d(&q, N, &mem);
    for(i=(0);i<(N);i++){
      d[i] = -1;
    }
    d[a] = 0;
    s = 0;
    z = 1;
    q[0] = a;
    while(z){
      i = q[s++];
      z--;
      for(j=(0);j<(es[i]);j++){
        k = edge[i][j];
        if(d[k] >= 0){
          continue;
        }
        d[k] = d[i] + 1;
        if(k==b){
          return d[k];
        }
        q[s+z++] = k;
      }
    }
    return -1;
  }
}
;
int N;
int M;
int A[100000];
int B[100000];
int D[100000];
graph g;
int main(){
  int i;
  wmem = memarr;
  int r1;
  int r2;
  unionFind uf;
  rd(N);
  rd(M);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(M);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);A[Lj4PdHRW] += (-1);
      rd(B[Lj4PdHRW]);B[Lj4PdHRW] += (-1);
      rd(D[Lj4PdHRW]);
    }
  }
  rsortA_L(M,D,A,B);
  uf.walloc(N,1);
  for(i=(0);i<(M);i++){
    uf(A[i], B[i]);
    if(uf(0) == uf(N-1)){
      r1 = D[i];
      break;
    }
  }
  while(D[M-1] < r1){
    M--;
  }
  g.setEdge(N,M,A,B);
  r2 = g.getDist(0, N-1);
  wt_L(r1);
  wt_L(' ');
  wt_L(r2);
  wt_L('\n');
  return 0;
}
// cLay version 20210405-1

// --- original code ---
// int N, M, A[1d5], B[], D[];
// graph g;
// {
//   int r1, r2;
//   unionFind uf;
//   rd(N,M,(A--,B--,D)(M));
//   rsortA(M,D,A,B);
//   uf.walloc(N,1);
//   rep(i,M){
//     uf(A[i], B[i]);
//     if(uf(0) == uf(N-1)) r1 = D[i], break;
//   }
//   while(D[M-1] < r1) M--;
//   g.setEdge(N,M,A,B);
//   r2 = g.getDist(0, N-1);
//   wt(r1, r2);
// }
0