제출 #873614

#제출 시각아이디문제언어결과실행 시간메모리
873614andrei_boacaVision Program (IOI19_vision)C++17
66 / 100
95 ms9928 KiB
#include "vision.h" #include <bits/stdc++.h> //#include "grader.cpp" using namespace std; vector<int> lins,cols; vector<int> dlin[505],dcol[505]; int d1[505],d2[505],ind; void construct_network(int H, int W, int K) { if(min(H,W)==1) { H=max(H,W); vector<int> v; int cnt=0; for(int i=0;i+K<H;i++) { v={i,i+K}; add_and(v); cnt++; } v.clear(); for(int i=H;i<H+cnt;i++) v.push_back(i); assert(v.size()==cnt); add_or(v); return; } ind=H*W-1; if(K==1) { for(int i=0;i<H;i++) { vector<int> v; for(int j=0;j<W;j++) v.push_back(i*W+j); add_or(v); ind++; lins.push_back(ind); } for(int j=0;j<W;j++) { vector<int> v; for(int i=0;i<H;i++) v.push_back(i*W+j); add_or(v); ind++; cols.push_back(ind); } for(int i=0;i<H;i++) for(int j=i+1;j<H&&j-i<=K;j++) { vector<int> v={lins[i],lins[j]}; add_and(v); ind++; dlin[j-i].push_back(ind); } for(int i=0;i<W;i++) for(int j=i+1;j<W&&j-i<=K;j++) { vector<int> v={cols[i],cols[j]}; add_and(v); ind++; dcol[j-i].push_back(ind); } vector<int> a; for(int d=1;d<=H-1&&d<=K;d++) { ind++; add_or(dlin[d]); d1[d]=ind; a.push_back(ind); } a.clear(); for(int d=1;d<=W-1&&d<=K;d++) { ind++; add_or(dcol[d]); d2[d]=ind; a.push_back(ind); } a.clear(); for(int i=0;i+1<H;i++) { vector<int> v; for(int j=i+1;j<H;j++) v.push_back(lins[j]); ind++; add_or(v); vector<int> p={ind,lins[i]}; add_and(p); ind++; a.push_back(ind); } add_or(a); ind++; add_not(ind); ind++; d1[0]=ind; a.clear(); for(int i=0;i+1<W;i++) { vector<int> v; for(int j=i+1;j<W;j++) v.push_back(cols[j]); ind++; add_or(v); vector<int> p={ind,cols[i]}; add_and(p); ind++; a.push_back(ind); } add_or(a); ind++; add_not(ind); ind++; d2[0]=ind; vector<int> cand; for(int x=0;x<=H-1;x++) for(int y=0;y<=W-1;y++) if(x+y==K) { vector<int> v={d1[x],d2[y]}; add_and(v); ind++; cand.push_back(ind); } add_or(cand); return; } vector<int> cand; int cnt=0; for(int i=0;i<H;i++) for(int j=0;j<W;j++) { vector<int> v; for(int l=0;l<H;l++) { int need=K-abs(l-i); if(need<0) continue; int c=j+need; if(c>=0&&c<W) v.push_back(l*W+c); c=j-need; if(c>=0&&c<W&&need!=0) v.push_back(l*W+c); } if(cnt<9997&&!v.empty()) { ind++; add_or(v); cnt++; vector<int> t={ind,i*W+j}; add_and(t); cnt++; ind++; cand.push_back(ind); } } add_or(cand); return; }

컴파일 시 표준 에러 (stderr) 메시지

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from vision.cpp:2:
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:25:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |         assert(v.size()==cnt);
      |                ~~~~~~~~^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...