제출 #1050643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050643		dead0ne	Vision Program (IOI19_vision)	C++17	44 / 100	12 ms	3024 KiB

vision

#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#include "vision.h"
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
//#define int long long
#define ii pair<long long,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1e15
#define MOD 1000000007
#define MX 50005
using namespace std;

void construct_network(int H, int W, int K){
    vi results;
    for(int i=0; i<H; i++){
        for(int j=0; j<W; j++){
            vi ors;
            for(int k=0; k<=K; k++){
                if(i+k<H && j+K-k<W) ors.pb((i+k)*W+(j+K-k));
                if(i+k<H && j-K+k>=0) ors.pb((i+k)*W+(j-K+k));
                if(i-k>=0 && j+K-k<W) ors.pb((i-k)*W+(j+K-k));
                if(i-k>=0 && j-K+k>=0) ors.pb((i-k)*W+(j-K+k));
            }
			if(ors.empty()) continue;
            results.pb(add_and({i*W+j, add_or(ors)}));
        }
    }
    add_or(results);
}

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