Submission #210581

#	Time	Username	Problem	Language	Result	Execution time	Memory
210581		ZloyHR	Vision Program (IOI19_vision)	C++17	0 / 100	8 ms	1400 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb push_back
template< typename T,typename V>ostream &operator<< (ostream &out,const pair<T,V> x){ out << "{" << x.fst << " : " << x.snd << "}"; return out;}template< typename T>ostream &operator<< (ostream &out,const set<T> x){ for(auto &it : x){ out << it << " "; } return out;}template< typename T>ostream &operator<< (ostream &out,const multiset<T> x){ for(auto &it : x){ out << it << " "; } return out;}template< typename T,typename V>ostream &operator<< (ostream &out,const map<T,V> x){ for(auto &it : x){ out << "[" << it.fst << "]" << " = " << it.snd << "\n"; } return out;}template< typename T>ostream &operator<< (ostream &out,const vector<T> x){ for(int i = 0;i < x.size() - 1; ++i){ out << x[i] << " "; } out << x.back(); return out;}template< typename T>ostream &operator<< (ostream &out,const vector<vector<T> > x){ for(int i = 0;i < x.size() - 1; ++i){ out << "[" << i << "]" << " = {" << x[i] << "}\n"; } out << "[" << x.size() - 1 << "]" << " = {" << x.back() << "}\n"; return out;}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const ll INF = 1e9;
int dist(int x1,int y1,int x2,int y2){
    return abs(x2 - x1) + abs(y2 - y1);
}
unordered_map<ll,bool> used;
void construct_network(int H, int W, int K) {
    vector<int> g;
    int id = H * W;
	for(int i = 0;i < H; ++i){
        for(int j = 0;j < W; ++j){
            vector<int> Ns;
            for(int add = 0;add <= K; ++add){
                int i1 = i + add,j1 = j + (K - add);
                if(i1 >= H)break;
                if(j1 >= W)continue;
                if(used.find((i * W + j) * INF + (i1 * W + j1)) != used.end())continue;
                if(dist(i,j,i1,j1) == K){
                    used[(i * W + j) * INF + (i1 * W + j1)] = true;
                    Ns.pb(i1 * W + j1);
                }
            }
            if(Ns.empty())continue;
            add_or(Ns);
            add_and({i * W + j,id});
            ++id;
            g.pb(id);
            ++id;
        }
	}
    cout << id << "\n";
	add_or(g);
}

• 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