제출 #430075

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430075		Blistering_Barnacles	Vision Program (IOI19_vision)	C++14	12 / 100	114 ms	14056 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 q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void construct_network(int H, int W, int K) {
    p = 0 ;
    for(ll i1 = 0 ; i1 < H ; i1++){
        for(ll j1 = 0 ; j1 < W ; j1++){
            for(ll i2 = i1 ; i2 < H ; i2++){
                for(ll j2 = j1 ; j2 < W ; j2++){
                    if(abs(i1 - i2) + abs(j1 - j2) == K){
                        ll i = i1 * W + j1 , j = i2 * W + j2 ;
                        vll v ;
                        v.pb(i) ;
                        //cout << i1 << " " << j1 << " " << i2 << " " << j2 << " " << i << " " << j << endl ;
                        v.pb(j) ;
                        add_and(v) ;
                        p++;
                    }
                }
            }
        }
    }
    vll ret ;
    for(ll i = H * W ; i < H * W + p ; i++){
        ret.pb(i) ;
    }
    add_or(ret) ;
}

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