Submission #166200

# Submission time Handle Problem Language Result Execution time Memory
166200 2019-12-01T06:51:52 Z keta_tsimakuridze Vision Program (IOI19_vision) C++14
Compilation error
0 ms 0 KB
#include<bits/stdc++.h>
using namespace std;
#include "vision.h"
long long j,i,iL[500],iR[500],bR[500],bL[500];
vector<int> ansVec,V,Dr[500],Dl[500];
int getans(int h,int w,int k){


 for(int i=k;i<w+h-1;i++){
 	
 	V.push_back(add_or(bL[i-k]);
	V.push_back(add_or(iL[i]);
	ansVec.push_back(add_and(V));
	V.clear();
	V.push_back(add_or(bR[i-k]);
	V.push_back(add_or(iR[i]);
	ansVec.push_back(add_and(V));
	V.clear();
	
 }
 return add_or(ansVec);
	
}
void construct network(int H,int W,int K){
	
	for(i=0;i<H;i++)
	for(j=0;j<W;j++){
		Dr[i-j+W-1].push_back(i*W+j);
		Dl[i+j].push_back(i*W+j);
	}
	iL[0]=add_or(Dl[0]);
	iR[0]=add_or(Dr[0]);
	bL[0]=add_or(Dl[0]);
	bR[0]=add_or(DR[0]);
	for(i=1;i<h+w-1;i++){
	iL[i]=add_or(Dl[i]);
	iR[i]=add_or(Dr[i]);
	V.push_back(iL[i],bL[i-1]);
	bL[i]=add_or(V);
	V.clear();
	V.push_back(iR[i],bR[i-1]);
	bR[i]=add_or(V);
	V.clear;	
		
	} 
	
	
	ans1=getans(H,W,K);
	if(k<=W+H-2){
	
	ans2=getans(H,W,K+1);
	V.push_back(ans1);
	V.push_back(ans2);
	add_xor(V);
	
}

}

Compilation message

vision.cpp: In function 'int getans(int, int, int)':
vision.cpp:11:28: error: could not convert 'bL[(i - k)]' from 'long long int' to 'std::vector<int>'
   V.push_back(add_or(bL[i-k]);
                      ~~~~~~^
vision.cpp:12:25: error: could not convert 'iL[i]' from 'long long int' to 'std::vector<int>'
  V.push_back(add_or(iL[i]);
                     ~~~~^
vision.cpp:15:27: error: could not convert 'bR[(i - k)]' from 'long long int' to 'std::vector<int>'
  V.push_back(add_or(bR[i-k]);
                     ~~~~~~^
vision.cpp:16:25: error: could not convert 'iR[i]' from 'long long int' to 'std::vector<int>'
  V.push_back(add_or(iR[i]);
                     ~~~~^
vision.cpp: At global scope:
vision.cpp:24:16: error: expected initializer before 'network'
 void construct network(int H,int W,int K){
                ^~~~~~~