Submission #1067077

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067077		ewirlan	Vision Program (IOI19_vision)	C++17	100 / 100	13 ms	1788 KiB

vision

//
#ifndef __SIZEOF_INT128__
  #define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset =  tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
    string name{""};
    time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
    duration<float, std::milli> dur;
    Timer() = default;
    Timer(string nm): name(nm) {}
    ~Timer() {
        end = high_resolution_clock::now(); dur= end - start;
        cout << "@" << name << "> " << dur.count() << " ms" << '\n';
    }
};
template <typename T = int> inline T in()
{
    static T x;
    std::cin >> x;
    return x;
}
std::string yn(bool b)
{
    if(b) return "YES\n";
    else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
    for(const auto& i : wek)out << i << ' ';
    return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
    out << '{'<<par.first<<", "<<par.second<<"}";
    return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
#include "vision.h"
void construct_network(int n, int m, int k)
{
    auto wj = [n,m](int a, int b){return a*m + b; };
    vector <int> ts;
    rep(i, 0, n){
        vector <int> v;
        if(i != 0)v.pb(ts.back());
        rep(j, 0, m)v.pb(wj(i, j));
        ts.pb(add_xor(v));
    }
    rep(j, 0, m){
        vector <int> v;
        if(j != 0)v.pb(ts.back());
        rep(i, 0, n)v.pb(wj(i, j));
        ts.pb(add_xor(v));
    }
    int z(add_and({0, add_not(0)})), j(add_not(z));
    vector <int> l(9, z);
    for(auto i: ts){
        vector <int> nl(9), p(9);
        p[0] = i;
        rep(j, 0, 9){
            nl[j] = add_xor({l[j], p[j]});
            if(j < 8)p[j+1] = add_and({l[j], p[j]});
        }
        l = nl;
    }
    rep(i, 0, 9)l[i] = add_xor({l[i], (k&1<<i ? j : z)});
    add_not(add_or(l));
}

• 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