记录详情

Wrong Answer

/in/foo.cc: In function 'void dfs(int)':
/in/foo.cc:12:8: warning: array subscript is above array bounds [-Warray-bounds]
  f[v][1]=1;
  ~~~~~~^
/in/foo.cc:15:27: warning: array subscript is above array bounds [-Warray-bounds]
   f[v][0]+=f[tree[v][i]][1];
            ~~~~~~~~~~~~~~~^
/in/foo.cc:16:16: warning: array subscript is above array bounds [-Warray-bounds]
   f[v][1]+=min1(f[tree[v][i]][0],f[tree[v][i]][1]);
            ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/in/foo.cc:16:50: warning: array subscript is above array bounds [-Warray-bounds]
   f[v][1]+=min1(f[tree[v][i]][0],f[tree[v][i]][1]);
                                                  ^
/in/foo.cc:16:10: warning: array subscript is above array bounds [-Warray-bounds]
   f[v][1]+=min1(f[tree[v][i]][0],f[tree[v][i]][1]);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/in/foo.cc: In function 'int main()':
/in/foo.cc:37:34: warning: array subscript is above array bounds [-Warray-bounds]
  cout<<min1(f[root][0],f[root][1]);
                                  ^
# 状态 耗时 内存占用
#1 Wrong Answer 7ms 8.07 MiB
#2 Wrong Answer 7ms 8.086 MiB
#3 Wrong Answer 8ms 8.234 MiB
#4 Wrong Answer 7ms 8.0 MiB
#5 Wrong Answer 3ms 256.0 KiB

信息

递交者
类型
递交
题目
战略游戏
题目数据
下载
语言
C++
递交时间
2017-08-27 23:33:31
评测时间
2017-08-27 23:33:31
评测机
分数
0
总耗时
34ms
峰值内存
8.234 MiB