Submission #316394

#	Time	Username	Problem	Language	Result	Execution time	Memory
316394		kylych03	Vision Program (IOI19_vision)	C++14	52 / 100	4 ms	512 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
void construct_network(int H, int W, int K) {
    vector<int> vec;
    if(K==-1 ){
        for(int i  = 0 ; i < H; i++ ){
            for(int j = 0 ; j < W; j++){
                if( i + 1 < H ){
                        int p1 = i*W + j;
                        int p2 = (i+1)*W + j;
                        vector <int> v;
                        v.push_back(p1);
                        v.push_back(p2);
                        vec.push_back( add_and(v) );
                    }
                if( j + 1 < W ){
                        int p1 = i*W + j;
                        int p2 = i*W + j+1;
                        vector <int> v;
                        v.push_back(p1);
                        v.push_back(p2);
                        vec.push_back( add_and(v) );
                    }
            }
        }
        add_or(vec);
        return ;
    }
    if( (H < 31 && W < 31) || (H==1 || W==1) ){
        for(int i  = 0 ; i < H; i++ ){
            for(int j = 0 ; j < W; j++){
                vector <int> v,v1;
                for(int t = i; t< H; t++)
                    for(int p = 0 ; p < W; p++)
                        if(abs (t - i) + abs(p - j) == K){
                            int p2 = t*W + p;
                            v.push_back(p2);
                        }
                int p1 = i*W + j;
                v1.push_back(p1);
                if(v.size()== 0)
                    continue;
                v1.push_back( add_or(v));
                vec.push_back( add_and(v1) );
            }
        }
        add_or(vec);
        return ;
    }
    vector <int> v;
    for(int i  = 0 ; i < H; i++ )
            for(int j = 0 ; j < W; j++)
                if(j + i == K){
                    v.push_back(i*W + j);
                }

	add_or(v);
	//add_not(c);
}

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