제출 #287309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287309		DanerZein	Vision Program (IOI19_vision)	C++14	41 / 100	4 ms	1148 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;
void construct_network(int H, int W, int K) {
  int c=-1;
  int mi=MAX,ma=-MAX;
  if((H<=30 and W<=30) or (min(H,W)==1)){
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
	c++;
	int cc=c+1;
	for(int l=j+1;l<W;l++){
	  vector<int> pos;
	  pos.push_back(c);
	  pos.push_back(cc);
	  cc++;
	  if(abs(j-l)==K){
	    int id=add_and(pos);
	    mi=min(mi,id);
	    ma=max(ma,id);
	  }
	}
	for(int k=i+1;k<H;k++){
	  for(int l=0;l<W;l++){
	    vector<int> pos;
	    if(abs(i-k)+abs(j-l)==K){
	      //cout<<i<<" "<<j<<" "<<k<<" "<<l<<" "<<c<<" "<<cc<<endl;
	      pos.push_back(c);
	      pos.push_back(cc);
	      int id=add_and(pos);
	      ma=max(ma,id);
	      mi=min(mi,id);
	    }
	    cc++;
	  }
	}
      }
    }
  }
  else{
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
	c++;
	if(i==0 and j==0){
	  continue;
	}
	if(i+j==K){
	  vector<int> pos;
	  pos.push_back(0);
	  pos.push_back(c);
	  int id=add_and(pos);
	  ma=max(ma,id);
	  mi=min(mi,id);
	}
      }
    }
  }
  //cout<<mi<<" "<<ma<<endl;
  vector<int> pos;
  for(int i=mi;i<=ma;i++){
    pos.push_back(i);
  }
  int id=add_or(pos);
}

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

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:64:7: warning: unused variable 'id' [-Wunused-variable]
   64 |   int id=add_or(pos);
      |       ^~

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 8 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19