oj.uz

Submission #293212

# Submission time Handle Problem Language Result Execution time Memory
293212 2020-09-07T18:49:05 Z muhammad_hokimiyon Vision Program (IOI19_vision) C++14
100 / 100
 145 ms 9712 KB 
#include "vision.h"
#include <bits/stdc++.h>

#define fi first
#define se second

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,m;
int qur;
vector < int > g;
map < int , int > ll1,rr1;
map < int , pair < int , int > > ll , rr;
map < int , vector < int > > l,r;

int o_r( vector < int > v )
{
    qur += 1;
    add_or( v );
    return qur;
}

int an_d( vector < int > v )
{
    qur += 1;
    add_and( v );
    return qur;
}

int xo_r( vector < int > v )
{
    qur += 1;
    add_xor( v );
    return qur;
}

int no_t( int x )
{
    qur += 1;
    add_not( x );
    return qur;
}

int foo( int k )
{
    vector < int > g,ff;
    for( int i = -(n + m); i <= n + m; i++ ){
        if( l[i].empty() )continue;
        bool f = true;
        vector < int > ask;
        for( int j = i; j <= i + k; j++ ){
            if( l[j].empty() ){
                continue;
            }
            assert( ll.find(j) != ll.end() );
            ask.push_back( ll[j].fi );
        }
        if( (int)ask.size() < 1 )continue;
        //assert( (int)ask.size() == k + 1 );
        int x = o_r( ask );
        int y = xo_r( ask );
        int z = no_t( y );
        g.push_back( an_d( {x , z} ) );
        g.push_back( ll1[i] );
    }
    for( int i = -(n + m); i <= n + m; i++ ){
        if( r[i].empty() )continue;
        bool f = true;
        vector < int > ask;
        for( int j = i; j <= i + k; j++ ){
            if( r[j].empty() ){
                continue;
            }
            assert( rr.find(j) != rr.end() );
            ask.push_back( rr[j].fi );
        }
        if( (int)ask.size() < 1 )continue;
        //assert( (int)ask.size() == k + 1 );
        int x = o_r( ask );
        int y = xo_r( ask );
        int z = no_t( y );
        ff.push_back( an_d( {x , z} ) );
        ff.push_back( rr1[i] );
    }
    return an_d( { o_r( g ), o_r( ff ) } );
}

void construct_network(int H, int W, int K)
{
    n = H;
    m = W;
    qur = n * m - 1;
    for( int i = 0; i < n; i++ ){
        for( int j = 0; j < m; j++ ){
            int x = i - j , y = i + j;
            l[x].push_back(i * m + j);
            r[y].push_back(i * m + j);
        }
    }
    for( int i = -(n + m); i <= n + m; i++ ){
        if( l[i].empty() )continue;
        int x = o_r(l[i]);
        int y = xo_r(l[i]);
        ll[i] = { x , no_t(y) };
        ll1[i] = an_d({ ll[i].fi , ll[i].se });
    }
    for( int i = -(n + m); i <= n + m; i++ ){
        if( r[i].empty() )continue;
        int x = o_r( r[i] );
        int y = xo_r(r[i]);
        rr[i] = { x , no_t(y) };
        rr1[i] = an_d( {rr[i].fi , rr[i].se} );
    }
    int x = foo( K );
    int y = foo( K - 1 );
    y = no_t( y );
    vector < int > f;
    f.push_back(x);
    f.push_back(y);
    an_d(f);
   // o_r( f );
}

Compilation message

vision.cpp: In function 'int foo(int)':
vision.cpp:51:14: warning: unused variable 'f' [-Wunused-variable]
   51 |         bool f = true;
      |              ^
vision.cpp:70:14: warning: unused variable 'f' [-Wunused-variable]
   70 |         bool f = true;
      |              ^

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 544 KB Output is correct
34 Correct 3 ms 552 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 4 ms 640 KB Output is correct
37 Correct 4 ms 640 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 544 KB Output is correct
34 Correct 3 ms 552 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 4 ms 640 KB Output is correct
37 Correct 4 ms 640 KB Output is correct
38 Correct 21 ms 1916 KB Output is correct
39 Correct 5 ms 768 KB Output is correct
40 Correct 8 ms 896 KB Output is correct
41 Correct 7 ms 896 KB Output is correct
42 Correct 23 ms 1664 KB Output is correct
43 Correct 10 ms 1276 KB Output is correct
44 Correct 20 ms 1908 KB Output is correct
45 Correct 28 ms 2420 KB Output is correct
46 Correct 33 ms 2676 KB Output is correct
47 Correct 36 ms 2932 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 896 KB Output is correct
2 Correct 22 ms 1788 KB Output is correct
3 Correct 22 ms 1788 KB Output is correct
4 Correct 30 ms 2164 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 17 ms 1532 KB Output is correct
7 Correct 26 ms 2036 KB Output is correct
8 Correct 30 ms 2164 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 14 ms 1532 KB Output is correct
11 Correct 21 ms 1788 KB Output is correct
12 Correct 23 ms 1820 KB Output is correct
13 Correct 29 ms 2048 KB Output is correct
14 Correct 30 ms 2164 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 15 ms 1404 KB Output is correct
17 Correct 22 ms 1788 KB Output is correct
18 Correct 22 ms 1788 KB Output is correct
19 Correct 28 ms 2036 KB Output is correct
20 Correct 30 ms 2164 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 12 ms 1152 KB Output is correct
6 Correct 14 ms 1280 KB Output is correct
7 Correct 15 ms 1408 KB Output is correct
8 Correct 7 ms 1024 KB Output is correct
9 Correct 17 ms 1660 KB Output is correct
10 Correct 21 ms 1916 KB Output is correct
11 Correct 25 ms 2036 KB Output is correct
12 Correct 28 ms 2172 KB Output is correct
13 Correct 4 ms 896 KB Output is correct
14 Correct 18 ms 1532 KB Output is correct
15 Correct 26 ms 2164 KB Output is correct
16 Correct 29 ms 2180 KB Output is correct
17 Correct 4 ms 896 KB Output is correct
18 Correct 22 ms 1832 KB Output is correct
19 Correct 34 ms 2164 KB Output is correct
20 Correct 17 ms 2044 KB Output is correct
21 Correct 47 ms 3956 KB Output is correct
22 Correct 67 ms 5108 KB Output is correct
23 Correct 78 ms 5492 KB Output is correct
24 Correct 18 ms 2164 KB Output is correct
25 Correct 58 ms 4596 KB Output is correct
26 Correct 77 ms 5492 KB Output is correct
27 Correct 31 ms 3312 KB Output is correct
28 Correct 73 ms 6004 KB Output is correct
29 Correct 105 ms 8008 KB Output is correct
30 Correct 128 ms 9280 KB Output is correct
31 Correct 145 ms 9616 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 3320 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 5 ms 768 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 4 ms 896 KB Output is correct
6 Correct 4 ms 896 KB Output is correct
7 Correct 18 ms 2044 KB Output is correct
8 Correct 18 ms 2044 KB Output is correct
9 Correct 31 ms 3320 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 544 KB Output is correct
34 Correct 3 ms 552 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 4 ms 640 KB Output is correct
37 Correct 4 ms 640 KB Output is correct
38 Correct 21 ms 1916 KB Output is correct
39 Correct 5 ms 768 KB Output is correct
40 Correct 8 ms 896 KB Output is correct
41 Correct 7 ms 896 KB Output is correct
42 Correct 23 ms 1664 KB Output is correct
43 Correct 10 ms 1276 KB Output is correct
44 Correct 20 ms 1908 KB Output is correct
45 Correct 28 ms 2420 KB Output is correct
46 Correct 33 ms 2676 KB Output is correct
47 Correct 36 ms 2932 KB Output is correct
48 Correct 5 ms 896 KB Output is correct
49 Correct 22 ms 1788 KB Output is correct
50 Correct 22 ms 1788 KB Output is correct
51 Correct 30 ms 2164 KB Output is correct
52 Correct 4 ms 768 KB Output is correct
53 Correct 17 ms 1532 KB Output is correct
54 Correct 26 ms 2036 KB Output is correct
55 Correct 30 ms 2164 KB Output is correct
56 Correct 5 ms 768 KB Output is correct
57 Correct 14 ms 1532 KB Output is correct
58 Correct 21 ms 1788 KB Output is correct
59 Correct 23 ms 1820 KB Output is correct
60 Correct 29 ms 2048 KB Output is correct
61 Correct 30 ms 2164 KB Output is correct
62 Correct 4 ms 768 KB Output is correct
63 Correct 15 ms 1404 KB Output is correct
64 Correct 22 ms 1788 KB Output is correct
65 Correct 22 ms 1788 KB Output is correct
66 Correct 28 ms 2036 KB Output is correct
67 Correct 30 ms 2164 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 4 ms 768 KB Output is correct
73 Correct 9 ms 1024 KB Output is correct
74 Correct 12 ms 1152 KB Output is correct
75 Correct 14 ms 1280 KB Output is correct
76 Correct 15 ms 1408 KB Output is correct
77 Correct 7 ms 1024 KB Output is correct
78 Correct 17 ms 1660 KB Output is correct
79 Correct 21 ms 1916 KB Output is correct
80 Correct 25 ms 2036 KB Output is correct
81 Correct 28 ms 2172 KB Output is correct
82 Correct 4 ms 896 KB Output is correct
83 Correct 18 ms 1532 KB Output is correct
84 Correct 26 ms 2164 KB Output is correct
85 Correct 29 ms 2180 KB Output is correct
86 Correct 4 ms 896 KB Output is correct
87 Correct 22 ms 1832 KB Output is correct
88 Correct 34 ms 2164 KB Output is correct
89 Correct 17 ms 2044 KB Output is correct
90 Correct 47 ms 3956 KB Output is correct
91 Correct 67 ms 5108 KB Output is correct
92 Correct 78 ms 5492 KB Output is correct
93 Correct 18 ms 2164 KB Output is correct
94 Correct 58 ms 4596 KB Output is correct
95 Correct 77 ms 5492 KB Output is correct
96 Correct 31 ms 3312 KB Output is correct
97 Correct 73 ms 6004 KB Output is correct
98 Correct 105 ms 8008 KB Output is correct
99 Correct 128 ms 9280 KB Output is correct
100 Correct 145 ms 9616 KB Output is correct
101 Correct 1 ms 256 KB Output is correct
102 Correct 0 ms 256 KB Output is correct
103 Correct 31 ms 3320 KB Output is correct
104 Correct 1 ms 384 KB Output is correct
105 Correct 5 ms 768 KB Output is correct
106 Correct 7 ms 1024 KB Output is correct
107 Correct 4 ms 896 KB Output is correct
108 Correct 4 ms 896 KB Output is correct
109 Correct 18 ms 2044 KB Output is correct
110 Correct 18 ms 2044 KB Output is correct
111 Correct 31 ms 3320 KB Output is correct
112 Correct 1 ms 256 KB Output is correct
113 Correct 1 ms 384 KB Output is correct
114 Correct 72 ms 6076 KB Output is correct
115 Correct 30 ms 2164 KB Output is correct
116 Correct 5 ms 896 KB Output is correct
117 Correct 74 ms 5492 KB Output is correct
118 Correct 34 ms 3060 KB Output is correct
119 Correct 107 ms 7920 KB Output is correct
120 Correct 106 ms 8084 KB Output is correct
121 Correct 117 ms 7920 KB Output is correct
122 Correct 109 ms 7920 KB Output is correct
123 Correct 31 ms 3312 KB Output is correct
124 Correct 74 ms 6000 KB Output is correct
125 Correct 107 ms 7920 KB Output is correct
126 Correct 110 ms 8048 KB Output is correct
127 Correct 133 ms 9200 KB Output is correct
128 Correct 145 ms 9712 KB Output is correct