Submission #644944

#	Time	Username	Problem	Language	Result	Execution time	Memory
644944		a_aguilo	Vision Program (IOI19_vision)	C++14	0 / 100	2 ms	1104 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>

using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> possibilities;
	for(int i = 0; i < W; ++i){
        for(int j = 0; j < H; ++j){
            int PosAct = i + j*W;
            vector<int> AtDistanceK;
            AtDistanceK.push_back(PosAct);
            for(int w = 0; w <= K; ++w){
                int h = K - w;
                //cout << i << " " << j  << " " << w << endl;
                if(i + w < W){
                    if(j + h < H){
                        AtDistanceK.push_back((j+h)*W + i + w);
                    }
                    if(j - h >= 0){
                        AtDistanceK.push_back((j-h)*W + i + w);
                    }
                }
                if(i - w >= 0){
                    if(j + h < H){
                        AtDistanceK.push_back((j+h)*W + i - w);
                    }
                    if(j - h >= 0){
                        AtDistanceK.push_back((j-h)*W + i - w);
                    }
                }
            }
            if(AtDistanceK.size()==1)continue;
            int hasTwoOnes = add_and({add_or(AtDistanceK), add_not(add_xor(AtDistanceK)), add_xor({PosAct})});
            possibilities.push_back(hasTwoOnes);
            //cout << memory[hasTwoOnes] << endl;
            //print(AtDistanceK);
        }
	}
	add_or(possibilities);
}

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