Submission #572887

#	Time	Username	Problem	Language	Result	Execution time	Memory
572887		SlavicG	Vision Program (IOI19_vision)	C++17	0 / 100	380 ms	1048576 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<int> indices;

    bool vis[H][W][H][W];
    forn(a, H) forn(b, W) forn(c, H) forn(d, W) vis[a][b][c][d] = false;
    int oper = H * W;
    for(int i = 0; i < H; ++i) {
        for(int j = 0; j < W; ++j) {
            for(int x = 0; x < H; ++x) {
                for(int y = 0; y < W; ++y) {
                    if(x == i && j == y) continue;
                    if(vis[i][j][x][y]) continue;
                    if(abs(x - i) + abs(y - j) != K) continue;
                    vis[i][j][x][y] = vis[x][y][i][j] = true;
                    vector<int> purice = {i * H + j, x * H + y};
                    assert(min(purice[0], purice[1]) >= 0 && max(purice[0], purice[1]) <= H * W - 1);
                    sort(all(purice));
                    indices.pb(add_and(purice));
                    assert(indices.back() == oper);
                    ++oper;
                }   
            }
        }
    }
    assert(sz(indices));
    add_or(indices);
    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