oj.uz

Submission #150892

# Submission time Handle Problem Language Result Execution time Memory
150892 2019-09-01T10:07:30 Z johutha Vision Program (IOI19_vision) C++14
73 / 100
 93 ms 8560 KB 
#include <vector>
#include "vision.h"
#include <iostream>

using namespace std;

struct picture
{
    int H, W;
    int dignr;

    int getnr(int y, int x)
    {
        return y*W + x;
    }

    int inside(int y, int x)
    {
        return (y >= 0) && (x >= 0) && (x < W) && (y < H);
    }

    vector<int> leftdig;
    vector<int> leftdig_double;

    vector<int> rightdig;
    vector<int> rightdig_double;

    void init_dig()
    {
        for (int i = 0; i < dignr; i++)
        {
            vector<int> fields;
            for (int j = 0; j < H; j++)
            {
                int x = i - j;
                int y = j;
                if (!inside(y, x)) continue;
                fields.push_back(getnr(y, x));
            }
            int n_in = add_or(fields);
            leftdig.push_back(n_in);
            int xr = add_xor(fields);
            leftdig_double.push_back(add_xor({n_in, xr}));
        }

        
        for (int i = W - dignr; i < W; i++)
        {
            vector<int> fields;
            for (int j = 0; j < H; j++)
            {
                int x = i + j;
                int y = j;
                if (!inside(y, x)) continue;
                fields.push_back(getnr(y, x));
            }
            int n_in = add_or(fields);
            rightdig.push_back(n_in);
            int xr = add_xor(fields);
            rightdig_double.push_back(add_xor({n_in, xr}));
        }
    }

    void init(int iH, int iW)
    {
        H = iH;
        W = iW;
        dignr = H + W - 1;
    }

    int smaller(int k)
    {
        vector<int> allleftd;
        for (int i = 0; i < dignr; i++)
        {
            vector<int> ld;
            for (int j = 0; j <= k; j++)
            {
                if (i + j >= dignr) continue;
                ld.push_back(leftdig[i + j]);
                ld.push_back(leftdig_double[i + j]);
            }
            int n_or = add_or(ld);
            int n_xr = add_xor(ld);
            allleftd.push_back(add_xor({n_or, n_xr}));
        }
        int l_in = add_or(allleftd);

        vector<int> allrightd;
        for (int i = 0; i < dignr; i++)
        {
            vector<int> ld;
            for (int j = 0; j <= k; j++)
            {
                if (i + j >= dignr) continue;
                ld.push_back(rightdig[i + j]);
                ld.push_back(rightdig_double[i + j]);
            }
            int n_or = add_or(ld);
            int n_xr = add_xor(ld);
            allrightd.push_back(add_xor({n_or, n_xr}));
        }
        int r_in = add_or(allrightd);
        return add_and({r_in, l_in});
    }
};

void construct_network(int H, int W, int K)
{
    picture pic;
    pic.init(H, W);
    pic.init_dig();
    add_xor({pic.smaller(K), pic.smaller(K - 1)});
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 356 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 356 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 4 ms 508 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 6 ms 632 KB Output is correct
36 Correct 6 ms 632 KB Output is correct
37 Correct 6 ms 760 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 356 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 4 ms 508 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 6 ms 632 KB Output is correct
36 Correct 6 ms 632 KB Output is correct
37 Correct 6 ms 760 KB Output is correct
38 Correct 24 ms 2296 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 11 ms 1016 KB Output is correct
41 Correct 7 ms 804 KB Output is correct
42 Correct 25 ms 2296 KB Output is correct
43 Correct 9 ms 1016 KB Output is correct
44 Correct 24 ms 2296 KB Output is correct
45 Correct 34 ms 3320 KB Output is correct
46 Correct 42 ms 3832 KB Output is correct
47 Correct 43 ms 4092 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 29 ms 2700 KB Output is correct
3 Correct 30 ms 2552 KB Output is correct
4 Correct 38 ms 3320 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 23 ms 2012 KB Output is correct
7 Correct 34 ms 2908 KB Output is correct
8 Correct 37 ms 3192 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 19 ms 1784 KB Output is correct
11 Correct 29 ms 2552 KB Output is correct
12 Correct 30 ms 2576 KB Output is correct
13 Correct 36 ms 3064 KB Output is correct
14 Correct 38 ms 3192 KB Output is correct
15 Correct 5 ms 632 KB Output is correct
16 Correct 19 ms 1784 KB Output is correct
17 Correct 29 ms 2552 KB Output is correct
18 Correct 29 ms 2556 KB Output is correct
19 Correct 35 ms 3056 KB Output is correct
20 Correct 38 ms 3292 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 11 ms 1144 KB Output is correct
5 Correct 15 ms 1400 KB Output is correct
6 Correct 18 ms 1656 KB Output is correct
7 Correct 19 ms 1784 KB Output is correct
8 Correct 7 ms 760 KB Output is correct
9 Correct 18 ms 1764 KB Output is correct
10 Correct 27 ms 2552 KB Output is correct
11 Correct 32 ms 2920 KB Output is correct
12 Correct 34 ms 2936 KB Output is correct
13 Correct 4 ms 632 KB Output is correct
14 Correct 21 ms 1912 KB Output is correct
15 Correct 34 ms 2936 KB Output is correct
16 Correct 37 ms 3192 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 29 ms 2552 KB Output is correct
19 Correct 37 ms 3192 KB Output is correct
20 Correct 15 ms 1524 KB Output is correct
21 Correct 58 ms 5336 KB Output is correct
22 Correct 83 ms 7792 KB Output is correct
23 Correct 92 ms 8560 KB Output is correct
24 Correct 15 ms 1524 KB Output is correct
25 Correct 72 ms 6744 KB Output is correct
26 Correct 93 ms 8536 KB Output is correct
27 Correct 25 ms 2420 KB Output is correct
28 Correct 86 ms 7904 KB Output is correct
29 Incorrect 12 ms 4596 KB WA in grader: Too many inputs
30 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2420 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 604 KB Output is correct
7 Correct 15 ms 1520 KB Output is correct
8 Correct 14 ms 1524 KB Output is correct
9 Correct 26 ms 2548 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 356 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 4 ms 508 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 6 ms 632 KB Output is correct
36 Correct 6 ms 632 KB Output is correct
37 Correct 6 ms 760 KB Output is correct
38 Correct 24 ms 2296 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 11 ms 1016 KB Output is correct
41 Correct 7 ms 804 KB Output is correct
42 Correct 25 ms 2296 KB Output is correct
43 Correct 9 ms 1016 KB Output is correct
44 Correct 24 ms 2296 KB Output is correct
45 Correct 34 ms 3320 KB Output is correct
46 Correct 42 ms 3832 KB Output is correct
47 Correct 43 ms 4092 KB Output is correct
48 Correct 4 ms 632 KB Output is correct
49 Correct 29 ms 2700 KB Output is correct
50 Correct 30 ms 2552 KB Output is correct
51 Correct 38 ms 3320 KB Output is correct
52 Correct 5 ms 632 KB Output is correct
53 Correct 23 ms 2012 KB Output is correct
54 Correct 34 ms 2908 KB Output is correct
55 Correct 37 ms 3192 KB Output is correct
56 Correct 5 ms 632 KB Output is correct
57 Correct 19 ms 1784 KB Output is correct
58 Correct 29 ms 2552 KB Output is correct
59 Correct 30 ms 2576 KB Output is correct
60 Correct 36 ms 3064 KB Output is correct
61 Correct 38 ms 3192 KB Output is correct
62 Correct 5 ms 632 KB Output is correct
63 Correct 19 ms 1784 KB Output is correct
64 Correct 29 ms 2552 KB Output is correct
65 Correct 29 ms 2556 KB Output is correct
66 Correct 35 ms 3056 KB Output is correct
67 Correct 38 ms 3292 KB Output is correct
68 Correct 2 ms 256 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 384 KB Output is correct
71 Correct 2 ms 376 KB Output is correct
72 Correct 5 ms 632 KB Output is correct
73 Correct 11 ms 1144 KB Output is correct
74 Correct 15 ms 1400 KB Output is correct
75 Correct 18 ms 1656 KB Output is correct
76 Correct 19 ms 1784 KB Output is correct
77 Correct 7 ms 760 KB Output is correct
78 Correct 18 ms 1764 KB Output is correct
79 Correct 27 ms 2552 KB Output is correct
80 Correct 32 ms 2920 KB Output is correct
81 Correct 34 ms 2936 KB Output is correct
82 Correct 4 ms 632 KB Output is correct
83 Correct 21 ms 1912 KB Output is correct
84 Correct 34 ms 2936 KB Output is correct
85 Correct 37 ms 3192 KB Output is correct
86 Correct 5 ms 632 KB Output is correct
87 Correct 29 ms 2552 KB Output is correct
88 Correct 37 ms 3192 KB Output is correct
89 Correct 15 ms 1524 KB Output is correct
90 Correct 58 ms 5336 KB Output is correct
91 Correct 83 ms 7792 KB Output is correct
92 Correct 92 ms 8560 KB Output is correct
93 Correct 15 ms 1524 KB Output is correct
94 Correct 72 ms 6744 KB Output is correct
95 Correct 93 ms 8536 KB Output is correct
96 Correct 25 ms 2420 KB Output is correct
97 Correct 86 ms 7904 KB Output is correct
98 Incorrect 12 ms 4596 KB WA in grader: Too many inputs
99 Halted 0 ms 0 KB -