oj.uz

Submission #826942

# Submission time Handle Problem Language Result Execution time Memory
826942 2023-08-16T07:13:23 Z vjudge1 Vision Program (IOI19_vision) C++14
100 / 100
 80 ms 10196 KB 
#include<bits/stdc++.h>
#include "vision.h"
using namespace std ;
vector<int> abu ;
void construct_network(int n, int m, int k)
{
    vector<int> arr_l, arr_l_two, arr_l_k1, arr_l_k, arr_r, arr_r_two, arr_r_k1, arr_r_k ;
    for(int i = n - 1 ; i >= 0 ; i--)
    {
        int x = i, y = 0 ;
        vector<int> now ;
        while(x < n && y < m)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y++ ;
        }
        arr_l.push_back(add_or(now)) ;
    }
    for(int i = 1 ; i < m ; i++)
    {
        int x = 0, y = i ;
        vector<int> now ;
        while(x < n && y < m)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y++ ;
        }
        arr_l.push_back(add_or(now)) ;
    }
    for(int i = n - 1 ; i >= 0 ; i--)
    {
        int x = i, y = 0 ;
        vector<int> now ;
        while(x < n && y < m)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y++ ;
        }
        arr_l_two.push_back(add_and({add_xor(arr_l), add_or(now)})) ;
    }
    for(int i = 1 ; i < m ; i++)
    {
        int x = 0, y = i ;
        vector<int> now ;
        while(x < n && y < m)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y++ ;
        }
        arr_l_two.push_back(add_and({add_xor(arr_l), add_or(now)})) ;
    }
    for(int i = k - 1 ; i < arr_l.size() ; i++)
    {
        vector<int> now, now1 ;
        for(int j = i - k + 1 ; j <= i ; j++)
            now.push_back(arr_l[j]), now1.push_back(arr_l_two[j]) ;
        int num = add_xor({add_xor(now), add_or(now)}) ;
        now1.push_back(num) ;
        arr_l_k.push_back(add_or(now1)) ;
    }
    for(int i = k ; i < arr_l.size() ; i++)
    {
        vector<int> now, now1 ;
        for(int j = i - k ; j <= i ; j++)
            now.push_back(arr_l[j]), now1.push_back(arr_l_two[j]) ;
        int num = add_xor({add_xor(now), add_or(now)}) ;
        now1.push_back(num) ;
        arr_l_k1.push_back(add_or(now1)) ;
    }
    for(int i = 0 ; i < m ; i++)
    {
        int x = 0, y = i ;
        vector<int> now ;
        while(x < n && y >= 0)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y-- ;
        }
        arr_r.push_back(add_or(now)) ;
    }
    for(int i = 1 ; i < n ; i++)
    {
        int x = i, y = m - 1 ;
        vector<int> now ;
        while(x < n && y >= 0)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y-- ;
        }
        arr_r.push_back(add_or(now)) ;
    }
    for(int i = 0 ; i < m ; i++)
    {
        int x = 0, y = i ;
        vector<int> now ;
        while(x < n && y >= 0)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y-- ;
        }
        arr_r_two.push_back({add_and({add_xor(arr_r), add_or(now)})}) ;
    }
    for(int i = 1 ; i < n ; i++)
    {
        int x = i, y = m - 1 ;
        vector<int> now ;
        while(x < n && y >= 0)
        {
            now.push_back(x * m + y) ;
            x++ ;
            y-- ;
        }
        arr_r_two.push_back(add_and({add_xor(arr_r), add_or(now)})) ;
    }
    for(int i = k - 1 ; i < arr_r.size() ; i++)
    {
        vector<int> now, now1 ;
        for(int j = i - k + 1 ; j <= i ; j++)
            now.push_back(arr_r[j]), now1.push_back(arr_r_two[j]) ;
        int num = add_xor({add_xor(now), add_or(now)}) ;
        now1.push_back(num) ;
        arr_r_k.push_back(add_or(now1)) ;
    }
    for(int i = k ; i < arr_r.size() ; i++)
    {
        vector<int> now, now1 ;
        for(int j = i - k ; j <= i ; j++)
            now.push_back(arr_r[j]), now1.push_back(arr_r_two[j]) ;
        int num = add_xor({add_xor(now), add_or(now)}) ;
        now1.push_back(num) ;
        arr_r_k1.push_back(add_or(now1)) ;
    }
    int num1 = add_and({add_or(arr_r_k1), add_or(arr_l_k1)}), num2 = add_and({add_or(arr_r_k), add_or(arr_l_k)}) ;
    add_xor({num1, num2}) ;
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:56:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int i = k - 1 ; i < arr_l.size() ; i++)
      |                         ~~^~~~~~~~~~~~~~
vision.cpp:65:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i = k ; i < arr_l.size() ; i++)
      |                     ~~^~~~~~~~~~~~~~
vision.cpp:122:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(int i = k - 1 ; i < arr_r.size() ; i++)
      |                         ~~^~~~~~~~~~~~~~
vision.cpp:131:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |     for(int i = k ; i < arr_r.size() ; i++)
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.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 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 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 288 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
11.0 / 11.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 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 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 288 KB Output is correct
18 Correct 0 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 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct

Subtask #3
11.0 / 11.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 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 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 288 KB Output is correct
18 Correct 0 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 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.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 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 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 288 KB Output is correct
18 Correct 0 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 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 18 ms 2504 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 8 ms 1108 KB Output is correct
42 Correct 8 ms 924 KB Output is correct
43 Correct 11 ms 1696 KB Output is correct
44 Correct 21 ms 2516 KB Output is correct
45 Correct 20 ms 2772 KB Output is correct
46 Correct 17 ms 2516 KB Output is correct
47 Correct 10 ms 1492 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1232 KB Output is correct
2 Correct 19 ms 2096 KB Output is correct
3 Correct 16 ms 2172 KB Output is correct
4 Correct 8 ms 1108 KB Output is correct
5 Correct 8 ms 1256 KB Output is correct
6 Correct 15 ms 2064 KB Output is correct
7 Correct 15 ms 2056 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 8 ms 1360 KB Output is correct
10 Correct 14 ms 1944 KB Output is correct
11 Correct 16 ms 2120 KB Output is correct
12 Correct 16 ms 2104 KB Output is correct
13 Correct 14 ms 1884 KB Output is correct
14 Correct 7 ms 1108 KB Output is correct
15 Correct 8 ms 1232 KB Output is correct
16 Correct 14 ms 2004 KB Output is correct
17 Correct 16 ms 2132 KB Output is correct
18 Correct 20 ms 2224 KB Output is correct
19 Correct 18 ms 1788 KB Output is correct
20 Correct 7 ms 1108 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 1 ms 212 KB Output is correct
3 Correct 5 ms 932 KB Output is correct
4 Correct 7 ms 1108 KB Output is correct
5 Correct 8 ms 1236 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 9 ms 1360 KB Output is correct
9 Correct 14 ms 1916 KB Output is correct
10 Correct 15 ms 2032 KB Output is correct
11 Correct 13 ms 1864 KB Output is correct
12 Correct 8 ms 1168 KB Output is correct
13 Correct 8 ms 1232 KB Output is correct
14 Correct 15 ms 2012 KB Output is correct
15 Correct 15 ms 2004 KB Output is correct
16 Correct 7 ms 1108 KB Output is correct
17 Correct 8 ms 1232 KB Output is correct
18 Correct 16 ms 2100 KB Output is correct
19 Correct 7 ms 1108 KB Output is correct
20 Correct 27 ms 3260 KB Output is correct
21 Correct 40 ms 5488 KB Output is correct
22 Correct 50 ms 5480 KB Output is correct
23 Correct 21 ms 3008 KB Output is correct
24 Correct 23 ms 3280 KB Output is correct
25 Correct 43 ms 5708 KB Output is correct
26 Correct 21 ms 3028 KB Output is correct
27 Correct 49 ms 5700 KB Output is correct
28 Correct 71 ms 9016 KB Output is correct
29 Correct 77 ms 10196 KB Output is correct
30 Correct 78 ms 8900 KB Output is correct
31 Correct 39 ms 5240 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5628 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 9 ms 1372 KB Output is correct
5 Correct 9 ms 1232 KB Output is correct
6 Correct 8 ms 1276 KB Output is correct
7 Correct 24 ms 3356 KB Output is correct
8 Correct 25 ms 3300 KB Output is correct
9 Correct 53 ms 5644 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct

Subtask #8
19.0 / 19.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 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 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 288 KB Output is correct
18 Correct 0 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 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 18 ms 2504 KB Output is correct
39 Correct 4 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 8 ms 1108 KB Output is correct
42 Correct 8 ms 924 KB Output is correct
43 Correct 11 ms 1696 KB Output is correct
44 Correct 21 ms 2516 KB Output is correct
45 Correct 20 ms 2772 KB Output is correct
46 Correct 17 ms 2516 KB Output is correct
47 Correct 10 ms 1492 KB Output is correct
48 Correct 8 ms 1232 KB Output is correct
49 Correct 19 ms 2096 KB Output is correct
50 Correct 16 ms 2172 KB Output is correct
51 Correct 8 ms 1108 KB Output is correct
52 Correct 8 ms 1256 KB Output is correct
53 Correct 15 ms 2064 KB Output is correct
54 Correct 15 ms 2056 KB Output is correct
55 Correct 7 ms 1108 KB Output is correct
56 Correct 8 ms 1360 KB Output is correct
57 Correct 14 ms 1944 KB Output is correct
58 Correct 16 ms 2120 KB Output is correct
59 Correct 16 ms 2104 KB Output is correct
60 Correct 14 ms 1884 KB Output is correct
61 Correct 7 ms 1108 KB Output is correct
62 Correct 8 ms 1232 KB Output is correct
63 Correct 14 ms 2004 KB Output is correct
64 Correct 16 ms 2132 KB Output is correct
65 Correct 20 ms 2224 KB Output is correct
66 Correct 18 ms 1788 KB Output is correct
67 Correct 7 ms 1108 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 5 ms 932 KB Output is correct
73 Correct 7 ms 1108 KB Output is correct
74 Correct 8 ms 1236 KB Output is correct
75 Correct 7 ms 1108 KB Output is correct
76 Correct 4 ms 724 KB Output is correct
77 Correct 9 ms 1360 KB Output is correct
78 Correct 14 ms 1916 KB Output is correct
79 Correct 15 ms 2032 KB Output is correct
80 Correct 13 ms 1864 KB Output is correct
81 Correct 8 ms 1168 KB Output is correct
82 Correct 8 ms 1232 KB Output is correct
83 Correct 15 ms 2012 KB Output is correct
84 Correct 15 ms 2004 KB Output is correct
85 Correct 7 ms 1108 KB Output is correct
86 Correct 8 ms 1232 KB Output is correct
87 Correct 16 ms 2100 KB Output is correct
88 Correct 7 ms 1108 KB Output is correct
89 Correct 27 ms 3260 KB Output is correct
90 Correct 40 ms 5488 KB Output is correct
91 Correct 50 ms 5480 KB Output is correct
92 Correct 21 ms 3008 KB Output is correct
93 Correct 23 ms 3280 KB Output is correct
94 Correct 43 ms 5708 KB Output is correct
95 Correct 21 ms 3028 KB Output is correct
96 Correct 49 ms 5700 KB Output is correct
97 Correct 71 ms 9016 KB Output is correct
98 Correct 77 ms 10196 KB Output is correct
99 Correct 78 ms 8900 KB Output is correct
100 Correct 39 ms 5240 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 42 ms 5628 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 5 ms 852 KB Output is correct
106 Correct 9 ms 1372 KB Output is correct
107 Correct 9 ms 1232 KB Output is correct
108 Correct 8 ms 1276 KB Output is correct
109 Correct 24 ms 3356 KB Output is correct
110 Correct 25 ms 3300 KB Output is correct
111 Correct 53 ms 5644 KB Output is correct
112 Correct 0 ms 212 KB Output is correct
113 Correct 1 ms 300 KB Output is correct
114 Correct 68 ms 9060 KB Output is correct
115 Correct 7 ms 1108 KB Output is correct
116 Correct 8 ms 1360 KB Output is correct
117 Correct 33 ms 4508 KB Output is correct
118 Correct 37 ms 4680 KB Output is correct
119 Correct 76 ms 10056 KB Output is correct
120 Correct 77 ms 10052 KB Output is correct
121 Correct 75 ms 10056 KB Output is correct
122 Correct 77 ms 10156 KB Output is correct
123 Correct 41 ms 5700 KB Output is correct
124 Correct 69 ms 9020 KB Output is correct
125 Correct 80 ms 10116 KB Output is correct
126 Correct 77 ms 10184 KB Output is correct
127 Correct 69 ms 8900 KB Output is correct
128 Correct 39 ms 5268 KB Output is correct