제출 #430324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430324		Blistering_Barnacles	Vision Program (IOI19_vision)	C++14	0 / 100	56 ms	55500 KiB

vision

#include "vision.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll h , w , k , q, dp[105][100005], a[555555] , b[555555], l, m, n, o, p;
map < ll , ll > mp;
vll o1[555555] , o2[555555];
const ll mod = 1e9+7;
str s;
ll pp1(vll &v){
    for(auto u : v){
        if(u < 0 || u >= h * w)R 0 ;
    }
    R 1 ;
}
ll pp2(ll v){
    R (0 <= v && v < h * w) ;
}
    vll xor1 , no , or1 , and1 , and2;
void construct_network(int H, int W, int K) {
    h = H , w = W , k = K ;
    for(ll i = 0 ; i < h ; i++){
        for(ll j = 0 ; j < w ; j++){
            o1[i].pb(i * w + j) ;
        }
        sort(all(o1[i])) ;
    }
    for(ll i = 0 ; i < w ; i++){
        for(ll j = 0 ; j < h ; j++){
            o2[i].pb(j * w + i) ;
        }
        sort(all(o2[i])) ;
    }
    for(ll i = 0 ; i < h ; i++){
        vll &u = o1[i] ;
        assert(pp1(u)) ;
        or1.pb(add_or(u)) ;
        xor1.pb(add_xor(u)) ;
    }
    for(ll i = 0 ; i < w ; i++){
        vll &u = o2[i] ;
        assert(pp1(u)) ;
        or1.pb(add_or(u)) ;
        xor1.pb(add_xor(u)) ;
    }
    for(auto u : xor1){
        vll tmp ;
        assert(pp2(u)) ;
        no.pb(add_not(u)) ;
    }
    for(ll i = 0 ; i < (ll)sz(no) ; i++){
        vll tmp ;
        tmp.pb(no[i]) ;
        tmp.pb(or1[i]) ;
        sort(all(tmp)) ;
        assert(pp1(tmp)) ;
        and1.pb(add_and(tmp)) ;
        tmp.clear() ;
        if(i == h - 1)C ;
        tmp.pb(or1[i]) ;
        tmp.pb(or1[i + 1]) ;
        sort(all(tmp)) ;
        assert(pp1(tmp)) ;
        and2.pb(add_and(tmp)) ;
    }
    vll ret ;
    ll op1 = add_or(and1) , op2 = add_or(and2) ;
    ret.pb(op1) , ret.pb(op2) ;
    sort(all(ret)) ;
    add_and(ret) ;
}

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