Submission #316670

#	Time	Username	Problem	Language	Result	Execution time	Memory
316670		jainbot27	Vision Program (IOI19_vision)	C++17	8 / 100	12 ms	1920 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

void construct_network(int n, int m, int k){
    vector<vi> di0(n+m-1), di1(n+m-1);
    vi tot0(n+m-1), tot1(n+m-1);
    F0R(i, n){
        F0R(j, m){
            di0[i+j].pb(i*m+j);
            di1[i+j].pb(i*m+(m-1-j));
        }
    }
    F0R(i, n+m-1){
        tot0[i] = add_or(di0[i]);
        tot1[i] = add_or(di1[i]);
    }
    vi p0(n + m - 1), p1(n + m - 1);
    p0[0] = tot0[0], p1[0] = tot1[0];
    FOR(i, 1, n+m-1){
        p0[i]=add_or({p0[i-1],tot0[i]});
        p1[i]=add_or({p1[i-1],tot1[i]});
    }
    int nk0 = -1, nk1 = -1;
    F0R(i, 2){
        int K = (i == 0 ? k : k + 1);
        int& nk = (i == 0 ? nk0 : nk1);
        vi al;
        FOR(s, 0, n+m-1-K){
            al.pb(add_and({p0[s], tot0[s+K]}));
        }
        FOR(s, 0, n+m-1-K){
            al.pb(add_and({p1[s], tot0[s+K]}));
        }
        if(siz(al))
            nk = add_or(al);
    }
    if(nk1 == -1){
        add_or({nk0, nk0});
    }
    else{
        add_xor({nk0, nk1});
    }
}
//int32_t main(){
//    ios_base::sync_with_stdio(0); cin.tie(0);


//    return 0;
//}

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