Submission #572862

#	Time	Username	Problem	Language	Result	Execution time	Memory
572862		SlavicG	Vision Program (IOI19_vision)	C++17	0 / 100	1 ms	976 KiB

vision

#include "vision.h"
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

/*
int add_not(int N){}
int add_and(vector<int> Ns){}
int add_or(vector<int> Ns){}
int add_xor(vector<int> Ns){}
*/

void construct_network(int H, int W, int K) {
    vector<pair<int, int>> v;
    for(int i = 0; i < H; ++i) {
        for(int j = 0; j < W - (i == H - 1); ++j) {
            if(!add_not(i * H + j)) v.pb({i, j});
        }
    }
    if(sz(v) == 1) v.pb({H - 1, W - 1});
    assert(sz(v) == 2);
    int dist = abs(v[0].first - v[1].first) + abs(v[0].second - v[1].second);

    if(dist != K) {
        add_not(v[0].first * H + v[0].second);
    } else {
        add_and({v[0].first * H + v[0].second});
    }
    return;
}
/*
void solve() {  
    
} 
     
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}   
*/

• 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