提出 #38673314


ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<(int)n;i++)
int read(){int r;scanf("%d",&r);return r;}
int s[10010];
int t[10010];
int ans[10010];
bitset<2010> d[2010]; // d[i] 能到的点
int main() {
  int n=read();
  int m=read();
  rep(i,0,m){
    int u=read();
    int v=read();
    d[u][v]=1;
  }
  int q=read();
  rep(i,0,q){
    s[i]=read();
    t[i]=read();
    ans[i]=-1;
  }
  rep(i,1,n+1){
    rep(j,1,n+1) if(d[j][i]) d[j]|=d[i];
    rep(j,0,q) if(ans[j]==-1 and d[s[j]][t[j]]) ans[j]=max({s[j],t[j],i});
  }
  rep(i,0,q) printf("%d\n",ans[i]);
  return 0;
}

提出情報

提出日時
問題 Ex - Directed Graph and Query
ユーザ cromarmot
言語 C++ (GCC 9.2.1)
得点 600
コード長 605 Byte
結果 AC
実行時間 620 ms
メモリ 4356 KiB

コンパイルエラー

./Main.cpp: In function ‘int read()’:
./Main.cpp:4:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    4 | int read(){int r;scanf("%d",&r);return r;}
      |                  ~~~~~^~~~~~~~~

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 600 / 600
結果
AC × 1
AC × 51
セット名 テストケース
Sample 00_sample_00.txt
All 00_sample_00.txt, 01_srnd_00.txt, 01_srnd_01.txt, 01_srnd_02.txt, 01_srnd_03.txt, 01_srnd_04.txt, 01_srnd_05.txt, 01_srnd_06.txt, 01_srnd_07.txt, 02_rnd_00.txt, 02_rnd_01.txt, 02_rnd_02.txt, 02_rnd_03.txt, 02_rnd_04.txt, 02_rnd_05.txt, 02_rnd_06.txt, 02_rnd_07.txt, 03_smallM_00.txt, 03_smallM_01.txt, 03_smallM_02.txt, 03_smallM_03.txt, 03_smallM_04.txt, 04_midM_00.txt, 04_midM_01.txt, 04_midM_02.txt, 04_midM_03.txt, 04_midM_04.txt, 05_largeM_00.txt, 05_largeM_01.txt, 05_largeM_02.txt, 05_largeM_03.txt, 05_largeM_04.txt, 06_hand_00.txt, 06_hand_01.txt, 06_hand_02.txt, 06_hand_03.txt, 06_hand_04.txt, 07_dag_00.txt, 07_dag_01.txt, 07_dag_02.txt, 07_dag_03.txt, 07_dag_04.txt, 07_dag_05.txt, 07_dag_06.txt, 07_dag_07.txt, 07_dag_08.txt, 07_dag_09.txt, 08_path_00.txt, 08_path_01.txt, 08_path_02.txt, 08_path_03.txt
ケース名 結果 実行時間 メモリ
00_sample_00.txt AC 16 ms 3608 KiB
01_srnd_00.txt AC 3 ms 3600 KiB
01_srnd_01.txt AC 1 ms 3632 KiB
01_srnd_02.txt AC 2 ms 3580 KiB
01_srnd_03.txt AC 3 ms 3728 KiB
01_srnd_04.txt AC 2 ms 3648 KiB
01_srnd_05.txt AC 2 ms 3636 KiB
01_srnd_06.txt AC 2 ms 3572 KiB
01_srnd_07.txt AC 2 ms 3600 KiB
02_rnd_00.txt AC 81 ms 4296 KiB
02_rnd_01.txt AC 87 ms 4288 KiB
02_rnd_02.txt AC 90 ms 4268 KiB
02_rnd_03.txt AC 78 ms 4240 KiB
02_rnd_04.txt AC 90 ms 4332 KiB
02_rnd_05.txt AC 94 ms 4216 KiB
02_rnd_06.txt AC 106 ms 4336 KiB
02_rnd_07.txt AC 102 ms 4208 KiB
03_smallM_00.txt AC 46 ms 4000 KiB
03_smallM_01.txt AC 45 ms 3928 KiB
03_smallM_02.txt AC 47 ms 3956 KiB
03_smallM_03.txt AC 45 ms 3908 KiB
03_smallM_04.txt AC 45 ms 3828 KiB
04_midM_00.txt AC 57 ms 4188 KiB
04_midM_01.txt AC 85 ms 4332 KiB
04_midM_02.txt AC 85 ms 4216 KiB
04_midM_03.txt AC 85 ms 4220 KiB
04_midM_04.txt AC 88 ms 4216 KiB
05_largeM_00.txt AC 619 ms 4216 KiB
05_largeM_01.txt AC 617 ms 4280 KiB
05_largeM_02.txt AC 619 ms 4276 KiB
05_largeM_03.txt AC 620 ms 4216 KiB
05_largeM_04.txt AC 619 ms 4356 KiB
06_hand_00.txt AC 45 ms 3744 KiB
06_hand_01.txt AC 617 ms 4264 KiB
06_hand_02.txt AC 384 ms 4212 KiB
06_hand_03.txt AC 332 ms 4180 KiB
06_hand_04.txt AC 331 ms 4212 KiB
07_dag_00.txt AC 49 ms 4188 KiB
07_dag_01.txt AC 50 ms 4232 KiB
07_dag_02.txt AC 62 ms 4212 KiB
07_dag_03.txt AC 211 ms 4280 KiB
07_dag_04.txt AC 315 ms 4180 KiB
07_dag_05.txt AC 49 ms 4268 KiB
07_dag_06.txt AC 51 ms 4232 KiB
07_dag_07.txt AC 57 ms 4232 KiB
07_dag_08.txt AC 202 ms 4168 KiB
07_dag_09.txt AC 331 ms 4232 KiB
08_path_00.txt AC 95 ms 4248 KiB
08_path_01.txt AC 77 ms 4236 KiB
08_path_02.txt AC 51 ms 4180 KiB
08_path_03.txt AC 47 ms 4272 KiB