Submission #424736

#	Time	Username	Problem	Language	Result	Execution time	Memory
424736		TryMax	Vision Program (IOI19_vision)	C++17	44 / 100	239 ms	2308 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
#ifdef LOCAL
    #include "grader.cpp"
#endif // LOCAL

#define pb push_back

using namespace std;

const int N = 1e5 + 10;

int n, m, k;

int dist(int x, int y, int x1, int y1){
    return abs(x - x1) + abs(y - y1);
}

int pos(int x, int y){
    return x * m + y;
}

void construct_network(int N, int M, int K){
    n = N;
    m = M;
    k = K;
    int last = 0;
	for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j){
            vector<int> q;
            for(int i1 = i; i1 < n; ++i1)
                for(int j1 = 0; j1 < m; ++j1)
                    if(dist(i, j, i1, j1) == k)
                        q.pb(pos(i1, j1));
            if(!q.empty()){
                int t = add_or(q);
                q.clear();
                q.pb(pos(i, j));
                q.pb(t);
                last = add_and(q);
            }
        }
    vector<int> q;
    for(int i = n * m + 1; i <= last; i += 2)
        q.pb(i);
    add_or(q);
}
/*
2 3 3
0 0 0 1
0 0 0 2
0 0 1 0
0 0 1 1
0 0 1 2
0 1 0 2
0 1 1 0
0 1 1 1
0 1 1 2
0 2 1 0
0 2 1 1
0 2 1 2
1 0 1 1
1 0 1 2
1 1 1 2
-1
*/

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