/ Vijos /

记录详情

Accepted

/in/foo.cc: In function 'void dfs(int, int)':
/in/foo.cc:34:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for (int i=1;i<=k;++i) b[num][i]=a[i];return;
   ^~~
/in/foo.cc:34:41: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
   for (int i=1;i<=k;++i) b[num][i]=a[i];return;
                                         ^~~~~~
/in/foo.cc: In function 'void dfs2(int, int)':
/in/foo.cc:103:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if (numm[b[se][position]]==0) flag[b[se][position]]=false;link[position]=0;
  ^~
/in/foo.cc:103:60: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'if'
  if (numm[b[se][position]]==0) flag[b[se][position]]=false;link[position]=0;
                                                            ^~~~
# 状态 耗时 内存占用
#1 Accepted 1ms 696.0 KiB
#2 Accepted 1ms 592.0 KiB
#3 Accepted 2ms 720.0 KiB
#4 Accepted 6ms 748.0 KiB
#5 Accepted 2ms 748.0 KiB
#6 Accepted 9ms 708.0 KiB
#7 Accepted 2ms 720.0 KiB
#8 Accepted 2ms 712.0 KiB
#9 Accepted 2ms 700.0 KiB
#10 Accepted 72ms 700.0 KiB

信息

递交者
类型
递交
题目
P1829 生成树计数
语言
C++
递交时间
2017-06-07 11:27:01
评测时间
2017-06-07 11:28:05
评测机
分数
100
总耗时
104ms
峰值内存
748.0 KiB