Submission #1233817

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233817		jundi	Vision Program (IOI19_vision)	C++20	8 / 100	6 ms	1164 KiB

vision

#include <bits/stdc++.h>
#include"vision.h"
using namespace std;
void construct_network(int h,int w,int k){
    int n=h*w;
    int not0=add_not(0);
    vector<int> tmp={0,not0};
    int zero_signal=add_and(tmp);
    vector<int> vec;
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            if(i==0&&j==0)continue;
            if(i+j==k){
                vec.push_back(i*w+j);
            }
        }
    }
    if(vec.empty())return;
    unordered_set<int> re(vec.begin(),vec.end());
    vector<int> black;
    for(int i=1;i<n;i++){
        if(re.find(i)==re.end()){
            black.push_back(i);
        }
    }
    int blackor;
    if(black.empty()){
        blackor=zero_signal;
    }else{
        blackor=add_or(black);
    }
    int a1=add_not(blackor);
    vector<int> output;
    for(int j:vec){
        vector<int> input;
        for(int k:vec){
            if(k==j)continue;
            input.push_back(k);
        }
        int otheror;
        if(input.empty()){
            otheror=zero_signal;
        }else{
            otheror=add_or(input);
        }
        int a2=add_not(otheror);
        vector<int> inputs={0,j,a1,a2};
        output.push_back(add_and(inputs));
    }
    add_or(output);
}

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