oj.uz

Submission #261302

# Submission time Handle Problem Language Result Execution time Memory
261302 2020-08-11T15:59:03 Z caoash Vision Program (IOI19_vision) C++14
0 / 100
 22 ms 1916 KB 
#include <bits/stdc++.h> 
#include "vision.h"

using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

void construct_network(int H, int W, int K) {
    vi ups;
    for (int y = 0; y < W; y++) {
        pi st = mp(0, y);
        vi diag;
        while (st.f < H && st.s < W) {
            diag.pb(W * st.f + st.s);
            ++st.f, ++st.s;
        }
        ups.pb(add_and({add_or(diag), add_xor(diag)})); 
    }
    for (int x = 1; x < H; x++) {
        pi st = mp(x, 0);
        vi diag;
        while (st.f < H && st.s < W) {
            diag.pb(W * st.f + st.s);
            ++st.f, ++st.s;
        }
        ups.pb(add_and({add_or(diag), add_xor(diag)}));
    }
    vi downs;
    for (int y = 0; y < W; y++) {
        pi st = mp(0, y);
        vi diag;
        while (st.f >= 0 && st.s >= 0) {
            diag.pb(W * st.f + st.s);
            --st.f, --st.s;
        }
        downs.pb(add_and({add_or(diag), add_xor(diag)}));
    }
    for (int x = 1; x < H; x++) {
        pi st = mp(x, W - 1);
        vi diag;
        while (st.f >= 0 && st.s >= 0) {
            diag.pb(W * st.f + st.s);
            --st.f, --st.s;
        }
        downs.pb(add_and({add_or(diag), add_xor(diag)}));
    }
    vi psup(sz(ups));
    for (int i = 0; i < sz(ups); i++) {
        if (i == 0) {
            psup[i] = add_xor({ups[i]}); 
        }
        else {
            psup[i] = add_xor({ups[i], psup[i - 1]});
        }
    }
    vi pdown(sz(downs));
    for (int i = 0; i < sz(downs); i++) {
        if (i == 0) {
            pdown[i] = add_xor({downs[i]});
        }
        else {
            pdown[i] = add_xor({downs[i], pdown[i - 1]});
        }
    }
    int upok = 0, downok = 0;
    for (int i = 0; i < sz(ups) - K + 1; i++) {
        vi curr;
        for (int j = i; j < i + K; j++) {
            curr.pb(psup[j]);
        } 
        if (i == 0) upok = add_and(curr);
        else upok = add_or({upok, add_and(curr)});
    }
    for (int i = 0; i < sz(downs) - K; i++) {
        vi curr;
        for (int j = i; j < i + K; j++) {
            curr.pb(pdown[j]);
        } 
        if (i == 0) downok = add_and(curr);
        else downok = add_or({downok, add_and(curr)});
    }
    int NK = K + 1;
    int upok2 = 0, downok2 = 0;
    for (int i = 0; i < sz(ups) - NK; i++) {
        vi curr;
        for (int j = i; j < i + NK; j++) {
            curr.pb(psup[j]);
        } 
        if (i == 0) upok2 = add_and(curr);
        else upok2 = add_or({upok2, add_and(curr)});
    }
    for (int i = 0; i < sz(downs) - NK + 1; i++) {
        vi curr;
        for (int j = i; j < i + NK; j++) {
            curr.pb(pdown[j]);
        } 
        if (i == 0) downok2 = add_and(curr);
        else downok2 = add_or({downok2, add_and(curr)});
    }
    add_and({add_or({upok, downok}), add_not(add_or({upok2, downok2}))});
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB on inputs (0, 0), (0, 2), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB on inputs (0, 0), (0, 2), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB on inputs (0, 0), (0, 2), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB on inputs (0, 0), (0, 2), expected 1, but computed 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 1916 KB on inputs (126, 120), (176, 169), 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 256 KB Output is correct
2 Incorrect 1 ms 256 KB on inputs (0, 0), (0, 2), expected 1, but computed 0
3 Halted 0 ms 0 KB -