제출 #288610

#제출 시각아이디문제언어결과실행 시간메모리
288610DanerZeinVision Program (IOI19_vision)C++14
44 / 100
34 ms3584 KiB
#include "vision.h" #include <bits/stdc++.h> #define MAX 1000000000 using namespace std; typedef pair<int,int> ii; typedef vector<int> vi; void construct_network(int H, int W, int K) { map<ii,int> m; vector<int> res; int c=0; int id=0; for(int i=0;i<H;i++){ for(int j=0;j<W;j++){ m[ii(i,j)]=c; c++; } } for(int i=0;i<H;i++){ for(int j=0;j<W;j++){ vector<int> pos; //pos.push_back(m[ii(i,j)]); int x=j+K; int y=i; while(true){ if(x<j) break; if(x<W and y<H){ pos.push_back(m[ii(y,x)]); } x--; y++; } //id=add_xor(pos); if(!pos.empty()){ id=add_or(pos); pos.clear(); pos.push_back(m[ii(i,j)]); id=add_or(pos); } x=j-K; y=i; pos.clear(); // pos.push_back(m[ii(i,j)]); while(true){ if(x>=j) break; if(x>=0 and y<H){ pos.push_back(m[ii(y,x)]); } x++; y++; } //id=add_xor(pos); if(!pos.empty()){ id=add_or(pos); pos.clear(); pos.push_back(m[ii(i,j)]); id=add_or(pos); } } } int mi=MAX,t=id; //cout<<mi<<" "<<ma<<endl; for(int i=(H*W);i<=t;i+=2){ vector<int> pos; pos.push_back(i); pos.push_back(i+1); id=add_and(pos); mi=min(mi,id); } vector<int> pos; for(int i=mi;i<=id;i++){ pos.push_back(i); } if(!pos.empty()) int id=add_or(pos); }

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

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:74:7: warning: unused variable 'id' [-Wunused-variable]
   74 |   int id=add_or(pos);
      |       ^~
#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...