제출 #764141

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
764141		alexander707070	Vision Program (IOI19_vision)	C++14	32 / 100	3 ms	1872 KiB

vision

#include<bits/stdc++.h>
#include "vision.h"
#define MAXN 507
using namespace std;
 
int n,m,k,dist;
vector<int> d[MAXN],e[MAXN];
int res[MAXN],ser[MAXN]; 
vector<int> bad,good;

void construct_network(int H, int W, int K){
    n=H; m=W; k=K;
 
    for(int i=0;i<n;i++){
        for(int f=0;f<m;f++){
            d[i-f+m-1].push_back(i*m+f);
            e[i+f].push_back(i*m+f);
        }
    }
    
    for(int i=0;i<n+m-1;i++){
        res[i]=add_or(d[i]);
        ser[i]=add_or(e[i]);
    }
    
    for(int i=0;i<n+m-1;i++){
        for(int f=i+k+1;f<n+m-1;f++){
            bad.push_back(add_and({res[i],res[f]}));
            bad.push_back(add_and({ser[i],ser[f]}));
        }
    }
    
    for(int i=0;i+k<n+m-1;i++){
        good.push_back(add_and({res[i],res[i+k]}));
        good.push_back(add_and({ser[i],ser[i+k]}));
    }
    
    if(bad.empty()){
        add_or(good);
    }else{
        add_and({add_or(good) , add_not(add_or(bad)) });
    }
}
 
/*
int main(){
 
    cout<<count_rectangles({{4, 8, 7, 5, 6},
{7, 4, 10, 3, 5},
{9, 7, 20, 14, 2},
{9, 14, 7, 3, 6},
{5, 7, 5, 2, 7},
{4, 5, 13, 5, 6}})<<"\n";
 
 K=3
 X . . O . .
 . O . . O .
 . . O . . X
 . . . O . .
 
 
 
    return 0;
}
*/

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