/ new_bzoj /

记录详情

System Error

/in/foo.cc: In function 'int bfs()':
/in/foo.cc:18:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<G[x].size();i++){
               ~^~~~~~~~~~~~
/in/foo.cc:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
/in/foo.cc: In function 'int dfs(int, int)':
/in/foo.cc:37:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<G[x].size();i++){
              ~^~~~~~~~~~~~
/in/foo.cc:40:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
/in/foo.cc: In function 'void build(int, int, int)':
/in/foo.cc:45:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=l+r>>1;
          ~^~
/in/foo.cc: In function 'void change(int, int, int, int, int)':
/in/foo.cc:54:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=l+r>>1;
          ~^~
/in/foo.cc: In function 'int qsum(int, int, int, int, int)':
/in/foo.cc:62:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=l+r>>1;
          ~^~
/in/foo.cc: In function 'int qmax(int, int, int, int, int)':
/in/foo.cc:70:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=l+r>>1;
          ~^~
/in/foo.cc:71:6: warning: unused variable 'ans' [-Wunused-variable]
  int ans=-30001;
      ^~~
/in/foo.cc: In function 'void build(int, int, int)':
/in/foo.cc:42:23: warning: array subscript is above array bounds [-Warray-bounds]
  if(l==r){trm[x]=trs[x]=v[rk[l]]; 
                  ~~~~~^
/in/foo.cc: In function 'void build(int, int, int)':
/in/foo.cc:48:17: warning: array subscript is above array bounds [-Warray-bounds]
  trs[x]=trs[x<<1]+trs[x<<1|1];
         ~~~~~~~~^
/in/foo.cc:48:29: warning: array subscript is above array bounds [-Warray-bounds]
  trs[x]=trs[x<<1]+trs[x<<1|1];
                   ~~~~~~~~~~^
/in/foo.cc:48:7: warning: array subscript is above array bounds [-Warray-bounds]
  trs[x]=trs[x<<1]+trs[x<<1|1];
  ~~~~~^
/in/foo.cc: In function 'void change(int, int, int, int, int)':
/in/foo.cc:52:23: warning: array subscript is above array bounds [-Warray-bounds]
  if(l==r){trm[x]=trs[x]=va;
                  ~~~~~^
/in/foo.cc:57:17: warning: array subscript is above array bounds [-Warray-bounds]
  trs[x]=trs[x<<1]+trs[x<<1|1];
         ~~~~~~~~^
/in/foo.cc:57:29: warning: array subscript is above array bounds [-Warray-bounds]
  trs[x]=trs[x<<1]+trs[x<<1|1];
                   ~~~~~~~~~~^
/in/foo.cc:57:7: warning: array subscript is above array bounds [-Warray-bounds]
  trs[x]=trs[x<<1]+trs[x<<1|1];
  ~~~~~^
/in/foo.cc: In function 'int qsum(int, int, int, int, int)':
/in/foo.cc:61:28: warning: array subscript is above array bounds [-Warray-bounds]
  if(l>=L&&r<=R)return trs[x];
                       ~~~~~^
/in/foo.cc: In function 'int main()':
/in/foo.cc:42:23: warning: array subscript is above array bounds [-Warray-bounds]
  if(l==r){trm[x]=trs[x]=v[rk[l]]; 
                  ~~~~~^
VJ4Error('ProblemDataNotFoundError', '题目 590c987dd3d8a13210993742 的数据未找到。', 'newbzoj', '590c987dd3d8a13210993742')

信息

递交者
类型
递交
题目
树的统计Count
语言
C++
递交时间
2017-07-10 16:05:16
评测时间
2017-07-10 16:05:16
评测机
分数
0
总耗时
0ms
峰值内存
0 Bytes