Submission #478403

#	Time	Username	Problem	Language	Result	Execution time	Memory
478403		blue	Vision Program (IOI19_vision)	C++17	100 / 100	67 ms	5900 KiB

vision

#include "vision.h"
#include <vector>
using namespace std;
#define pb push_back
int C(int H,int W,int K){
    vector<int> M[450],O[450],P,Q,R,S,T;
    for(int i = 0; i < H*W; i++){
        M[i/W+int(i%W)].pb(i);
        O[i/W-int(i%W)+W-1].push_back(i); }
    for(int d=0;d<=H+W-2;d++){
        P.push_back(add_or(M[d]));
        Q.push_back(add_or(P));
        R.push_back(add_or(O[d]));
        S.push_back(add_or(R));
        if(d-K >= 0){
            T.push_back(add_and({P[d], Q[d-K]}));
            T.push_back(add_and({R[d], S[d-K]}));}}
    return add_or(T);}
void construct_network(int H, int W, int K){
    if(K==H+W-2)C(H, W, K);
    else add_xor({C(H, W, K),C(H, W, K+1)});}

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