제출 #1117192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1117192		epicci23	Vision Program (IOI19_vision)	C++17	100 / 100	43 ms	5580 KiB

vision

#include "bits/stdc++.h"
#include "vision.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;

int n,m;

inline int get_ind(int a,int b){
  return a*m+b;
}

inline bool is_valid(int a,int b){
  return a>=0 && a<n && b>=0 && b<m;
}

map<int,int> info1_l,info1_r,info2_l,info2_r;

void construct_network(int _n, int _m, int k){
  n = _n , m = _m;
  
  int p = 0;
  while(p<n){
    int c = p , d = 0;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c--,d++;
    }
    info1_l[p] = add_or(res);
    p++;
  }

  p = 1;
  while(p<m){
    int c = n - 1 , d = p;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c--,d++;
    }
    info1_l[n-1+p] = add_or(res);
    p++;
  }

  p = 0;
  while(p<n){
    int c = p , d = 0;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c--,d++;
    }
    info2_l[p] = add_and({info1_l[p],add_not(add_xor(res))});
    p++;
  }


  p = 1;
  while(p<m){
    int c = n - 1 , d = p;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c--,d++;
    }
    info2_l[n-1+p] = add_and({info1_l[n-1+p],add_not(add_xor(res))});
    p++;
  }




  p = n - 1;
  while(p >= 0){
    int c = p , d = 0;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c++,d++;
    }
    info1_r[p] = add_or(res);
    p--;
  }

  p = 1;
  while(p<m){
    int c = 0 , d = p;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c++,d++;
    }
    info1_r[-p] = add_or(res);
    p++;
  }

  
  p = n - 1;
  while(p >= 0){
    int c = p , d = 0;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c++,d++;
    }
    info2_r[p] = add_and({info1_r[p],add_not(add_xor(res))});
    p--;
  }

  p = 1;
  while(p < m){
    int c = 0 , d = p;
    vector<int> res;
    while(is_valid(c,d)){
      res.push_back(get_ind(c,d));
      c++,d++;
    }
    info2_r[-p] = add_and({info1_r[-p],add_not(add_xor(res))});
    p++;
  }

  vector<int> l_diagonals,r_diagonals;
  
  for(int i = 0; i <= n + m - 2; i++) l_diagonals.push_back(i);
  for(int i = n - 1; i >= 1 - m; i--) r_diagonals.push_back(i);
  
  vector<int> ok_l;
  for(int x : l_diagonals) ok_l.push_back(info2_l[x]);
  for(int i = k - 1; i < sz(l_diagonals) ; i++){
     vector<int> res;
     for(int j = i ; j > i - k; j--) res.push_back(info1_l[l_diagonals[j]]);
     ok_l.push_back(add_and({add_or(res),add_not(add_xor(res))}));
  }

  vector<int> ok_r;
  for(int x : r_diagonals) ok_r.push_back(info2_r[x]);
  for(int i = k - 1; i < sz(r_diagonals) ; i++){
     vector<int> res;
     for(int j = i ; j > i - k; j--) res.push_back(info1_r[r_diagonals[j]]);
     ok_r.push_back(add_and({add_or(res),add_not(add_xor(res))}));
  }


  int hm1 = add_and({add_or(ok_l),add_or(ok_r)});
  
  
  ok_l.clear();
  for(int x : l_diagonals) ok_l.push_back(info2_l[x]);
  for(int i = k; i < sz(l_diagonals) ; i++){
     vector<int> res;
     for(int j = i ; j >= i - k; j--) res.push_back(info1_l[l_diagonals[j]]);
     ok_l.push_back(add_and({add_or(res),add_not(add_xor(res))}));
  }

  ok_r.clear();
  for(int x : r_diagonals) ok_r.push_back(info2_r[x]);
  for(int i = k; i < sz(r_diagonals) ; i++){
     vector<int> res;
     for(int j = i ; j >= i - k; j--) res.push_back(info1_r[r_diagonals[j]]);
     ok_r.push_back(add_and({add_or(res),add_not(add_xor(res))}));
  }

  int hm2 = add_and({add_or(ok_l),add_or(ok_r)});

  add_and({add_not({hm1}),hm2});
}

• 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