Submission #832360

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
832360	2023-08-21T09:40:46 Z	maomao90	Vision Program (IOI19_vision)	C++17	20 / 100	8 ms	1108 KB

vision

// I can do all things through Christ who strenghthens me
// Philippians 4:13

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

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <class T>
inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int) x.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tuple<int, int, int> iii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXN = 200005;

int h, w, k;

void construct_network(int H, int W, int K) {
    h = H, w = W; k = K;
    if (k == 1 && h != 1 && w != 1) {
        int hs = h * w;
        REP (i, 0, h) {
            vi v(w);
            iota(ALL(v), i * w);
            add_or(v);
        }
        int ws = hs + h;
        REP (j, 0, w) {
            vi v;
            REP (i, 0, h) {
                v.pb(i * w + j);
            }
            add_or(v);
        }
        vi hall;
        REP (i, 0, h - 1) {
            hall.pb(add_and({hs + i, hs + i + 1}));
        }
        int hb = add_or(hall);
        vi wall;
        REP (i, 0, w - 1) {
            wall.pb(add_and({ws + i, ws + i + 1}));
        }
        int wb = add_or(wall);
        int o = add_or({hb, wb});
        int a = add_and({hb, wb});
        a = add_not(a);
        add_and({o, a});
        /*
        vi v1, v2;
        REP (i, 0, h) {
            REP (j, 0, w) {
                if (i + j & 1) {
                    v1.pb(i * w + j);
                } else {
                    v2.pb(i * w + j);
                }
            }
        }
        int t1 = add_or(v1), t2 = add_or(v2);
        add_and({wb, hb, t1, t2});
        */
        return;
    }
    vi all;
    REP (i, 0, h) {
        REP (j, 0, w) {
            if (max(h, w) > 30 && min(h, w) != 1 && j != 0) {
                break;
            }
            vi v;
            REP (ni, 0, h) {
                if (abs(ni - i) > k) {
                    continue;
                }
                {
                    // abs(ni - i) + nj - j = k
                    // nj = k - abs(ni - i) + j
                    int nj = k - abs(ni - i) + j;
                    if (nj >= 0 && nj < w) {
                        v.pb(ni * w + nj);
                    }
                }
            }
            if (v.empty()) {
                continue;
            }
            int tmp = add_or(v);
            all.pb(add_and({i * w + j, tmp}));
        }
    }
    add_or(all);
}

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Incorrect	1 ms	212 KB	on inputs (0, 2), (1, 0), expected 0, but computed 1
8	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Incorrect	1 ms	212 KB	on inputs (0, 2), (1, 0), expected 0, but computed 1
8	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Incorrect	1 ms	212 KB	on inputs (0, 2), (1, 0), expected 0, but computed 1
8	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Incorrect	1 ms	212 KB	on inputs (0, 2), (1, 0), expected 0, but computed 1
8	Halted	0 ms	0 KB	-

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	232 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct

Subtask #6
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	2 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	4 ms	724 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	4 ms	724 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	7 ms	1056 KB	Output is correct
28	Correct	3 ms	596 KB	Output is correct
29	Correct	4 ms	596 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	8 ms	1108 KB	on inputs (57, 107), (59, 108), expected 0, but computed 1
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Incorrect	1 ms	212 KB	on inputs (0, 2), (1, 0), expected 0, but computed 1
8	Halted	0 ms	0 KB	-

Submission #832360

Compilation message