/ WHOJ /

记录详情

Wrong Answer

foo.cc: In function 'void build(int, int, int)':
foo.cc:46:22: warning: array subscript 2 is above array bounds of 'int [2][200000]' [-Warray-bounds]
   46 |     son[1][now]=son[2][now]=0;
      |                 ~~~~~^
foo.cc:8:5: note: while referencing 'son'
    8 | int son[2][N];
      |     ^~~
foo.cc:48:26: warning: array subscript 2 is above array bounds of 'int [2][200000]' [-Warray-bounds]
   48 |     if(sit[now]!=R) son[2][now]=Query(sit[now]+1,R);
      |                     ~~~~~^
foo.cc:8:5: note: while referencing 'son'
    8 | int son[2][N];
      |     ^~~
foo.cc:50:13: warning: array subscript 2 is above array bounds of 'int [2][200000]' [-Warray-bounds]
   50 |     if(son[2][now]) build(son[2][now],sit[now]+1,R);
      |        ~~~~~^
foo.cc:8:5: note: while referencing 'son'
    8 | int son[2][N];
      |     ^~~
foo.cc: In function 'void dfs(int)':
foo.cc:55:13: warning: array subscript 2 is above array bounds of 'int [2][200000]' [-Warray-bounds]
   55 |     if(son[2][u]) dfs(son[2][u]);
      |        ~~~~~^
foo.cc:8:5: note: while referencing 'son'
    8 | int son[2][N];
      |     ^~~
foo.cc:61:47: warning: array subscript 2 is above array bounds of 'int [2][200000]' [-Warray-bounds]
   61 |         dp[0][u]=(dp[0][son[1][u]]*dp[1][son[2][u]]%mod+dp[1][son[1][u]]*dp[0][son[2][u]]%mod+dp[0][son[1][u]]*dp[0][son[2][u]]%mod)%mod;
      |                                          ~~~~~^
foo.cc:8:5: note: while referencing 'son'
    8 | int son[2][N];
      |     ^~~
foo.cc:57:47: warning: array subscript 2 is above array bounds of 'int [2][200000]' [-Warray-bounds]
   57 |         dp[0][u]=(dp[0][son[1][u]]*dp[0][son[2][u]])%mod;
      |                                          ~~~~~^
foo.cc:8:5: note: while referencing 'son'
    8 | int son[2][N];
      |     ^~~
Found 10 testcases.
[Hydro](https://hydro.ac)提供评测服务
# 状态 耗时 内存占用
#1 Wrong Answer Read 7, expect 3. 1ms 384.0 KiB
#2 Wrong Answer Read 63, expect 45. 1ms 384.0 KiB
#3 Wrong Answer Read 1176, expect 5070. 13ms 7.152 MiB
#4 Wrong Answer Read 2047, expect 105. 2ms 512.0 KiB
#5 Wrong Answer Read 4059, expect 7080. 2ms 384.0 KiB
#6 Wrong Answer Read 2679, expect 1686. 1ms 384.0 KiB
#7 Wrong Answer Read 8183, expect 2667. 1ms 384.0 KiB
#8 Wrong Answer Read 1023, expect 557. 1ms 384.0 KiB
#9 Wrong Answer Read 63, expect 21. 2ms 384.0 KiB
#10 Wrong Answer Read 5493, expect 315. 1ms 384.0 KiB

信息

递交者
类型
递交
题目
P1314 [NOIP2011 普及组] 表达式的值
题目数据
下载
语言
C++
递交时间
2022-09-27 23:08:29
评测时间
2022-09-27 23:08:29
评测机
分数
0
总耗时
30ms
峰值内存
7.152 MiB