Submission #974703

#	Time	Username	Problem	Language	Result	Execution time	Memory
974703		NemanjaSo2005	Vision Program (IOI19_vision)	C++17	44 / 100	219 ms	1940 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int N,M,K;
vector<int> bigor;
int getbit(int x,int y){
   return (x-1)*M+(y-1);
}
void construct_network(int h, int w, int k){
	N=h;
	M=w;
	K=k;
	for(int i1=1;i1<=N;i1++)
      for(int j1=1;j1<=M;j1++){
         vector<int> V;
         for(int i2=1;i2<=N;i2++)
            for(int j2=1;j2<=M;j2++){
               if(j2<j1)
                  continue;
               if(j2==j1 and i2<i1)
                  continue;
               if(abs(i1-i2)+abs(j1-j2)!=K)
                  continue;
               V.push_back(getbit(i2,j2));
             //  cout<<i1<<" "<<j1<<"    "<<i2<<" "<<j2<<endl;
            }
         if(V.size()==0)
            continue;

        /* cout<<i1<<" "<<j1<<" OROVI:"<<endl;
         for(int x:V)
            cout<<x<<" ";
         cout<<endl;
*/
         int a=0;
         if(V.size()==1)
            a=V[0];
         else
            a=add_or(V);
         bigor.push_back(add_and({a,getbit(i1,j1)}));
      }
   add_or(bigor);
}

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