oj.uz

답안 #873660

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873660 2023-11-15T12:48:07 Z andrei_boaca Vision Program (IOI19_vision) C++17
100 / 100
 27 ms 3312 KB 
#include "vision.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;

vector<int> lins,cols;
vector<int> dlin[505],dcol[505];
int d1[505],d2[505],ind,nr[505],zero;
void construct_network(int H, int W, int K)
{
    if(min(H,W)==1)
    {
        H=max(H,W);
        vector<int> v;
        int cnt=0;
        for(int i=0;i+K<H;i++)
        {
            v={i,i+K};
            add_and(v);
            cnt++;
        }
        v.clear();
        for(int i=H;i<H+cnt;i++)
            v.push_back(i);
        assert(v.size()==cnt);
        add_or(v);
        return;
    }
    ind=H*W-1;
    for(int i=0;i<H;i++)
    {
        vector<int> v;
        for(int j=0;j<W;j++)
            v.push_back(i*W+j);
        add_or(v);
        ind++;
        lins.push_back(ind);
    }
    for(int j=0;j<W;j++)
    {
        vector<int> v;
        for(int i=0;i<H;i++)
            v.push_back(i*W+j);
        add_or(v);
        ind++;
        cols.push_back(ind);
    }
    K+=2;
    K=H+W-K;
    vector<int> v1,v2,vals;
    vector<int> a;
    for(int i=0;i<H;i++)
    {
        a.push_back(lins[i]);
        ind++;
        add_or(a);
        add_not(ind);
        ind++;
        v1.push_back(ind);
    }
    a.clear();
    for(int i=H-1;i>=0;i--)
    {
        a.push_back(lins[i]);
        ind++;
        add_or(a);
        add_not(ind);
        ind++;
        v2.push_back(ind);
    }
    reverse(v2.begin(),v2.end());
    for(int i=0;i<H;i++)
    {
        vector<int> pp={v1[i],v2[i]};
        add_or(pp);
        ind++;
        vals.push_back(ind);
    }

    v1.clear();
    v2.clear();
    a.clear();
    for(int i=0;i<W;i++)
    {
        a.push_back(cols[i]);
        ind++;
        add_or(a);
        add_not(ind);
        ind++;
        v1.push_back(ind);
    }
    a.clear();
    for(int i=W-1;i>=0;i--)
    {
        a.push_back(cols[i]);
        ind++;
        add_or(a);
        add_not(ind);
        ind++;
        v2.push_back(ind);
    }
    reverse(v2.begin(),v2.end());
    for(int i=0;i<W;i++)
    {
        vector<int> pp={v1[i],v2[i]};
        add_or(pp);
        ind++;
        vals.push_back(ind);
    }
    vector<int> z;
    for(int i=0;i<H*W;i++)
        z.push_back(i);
    ind++;
    add_xor(z);
    zero=ind;
    for(int i=0;i<8;i++)
    {
        vector<int> pp={zero};
        add_and(pp);
        ind++;
        nr[i]=ind;
    }
    for(int i:vals)
    {
        int t=i;
        for(int j=0;j<8;j++)
        {
            vector<int> pp={nr[j],t};
            add_xor(pp);
            ind++;
            int cif=ind;
            add_and(pp);
            ind++;
            nr[j]=cif;
            t=ind;
        }
    }
    vector<int> cand;
    for(int j=0;j<8;j++)
    {
        if((K>>j)&1)
            cand.push_back(nr[j]);
        else
        {
            add_not(nr[j]);
            ind++;
            cand.push_back(ind);
        }
    }
    add_and(cand);
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from vision.cpp:2:
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:25:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |         assert(v.size()==cnt);
      |                ~~~~~~~~^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 436 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 436 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 6 ms 1236 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 4 ms 860 KB Output is correct
42 Correct 5 ms 860 KB Output is correct
43 Correct 7 ms 1240 KB Output is correct
44 Correct 8 ms 1240 KB Output is correct
45 Correct 9 ms 1240 KB Output is correct
46 Correct 6 ms 1240 KB Output is correct
47 Correct 7 ms 1240 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 396 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 3 ms 880 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 6 ms 1116 KB Output is correct
10 Correct 5 ms 1116 KB Output is correct
11 Correct 6 ms 1116 KB Output is correct
12 Correct 5 ms 1112 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 12 ms 2120 KB Output is correct
21 Correct 11 ms 2140 KB Output is correct
22 Correct 13 ms 2204 KB Output is correct
23 Correct 13 ms 2120 KB Output is correct
24 Correct 14 ms 2112 KB Output is correct
25 Correct 12 ms 2092 KB Output is correct
26 Correct 11 ms 2068 KB Output is correct
27 Correct 19 ms 3092 KB Output is correct
28 Correct 27 ms 2932 KB Output is correct
29 Correct 19 ms 3088 KB Output is correct
30 Correct 19 ms 3076 KB Output is correct
31 Correct 19 ms 3076 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2944 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 5 ms 1060 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 11 ms 2136 KB Output is correct
8 Correct 11 ms 2056 KB Output is correct
9 Correct 20 ms 3076 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 436 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 6 ms 1236 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 4 ms 860 KB Output is correct
42 Correct 5 ms 860 KB Output is correct
43 Correct 7 ms 1240 KB Output is correct
44 Correct 8 ms 1240 KB Output is correct
45 Correct 9 ms 1240 KB Output is correct
46 Correct 6 ms 1240 KB Output is correct
47 Correct 7 ms 1240 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 596 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 396 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 860 KB Output is correct
73 Correct 3 ms 860 KB Output is correct
74 Correct 3 ms 860 KB Output is correct
75 Correct 3 ms 880 KB Output is correct
76 Correct 3 ms 860 KB Output is correct
77 Correct 5 ms 1116 KB Output is correct
78 Correct 6 ms 1116 KB Output is correct
79 Correct 5 ms 1116 KB Output is correct
80 Correct 6 ms 1116 KB Output is correct
81 Correct 5 ms 1112 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 12 ms 2120 KB Output is correct
90 Correct 11 ms 2140 KB Output is correct
91 Correct 13 ms 2204 KB Output is correct
92 Correct 13 ms 2120 KB Output is correct
93 Correct 14 ms 2112 KB Output is correct
94 Correct 12 ms 2092 KB Output is correct
95 Correct 11 ms 2068 KB Output is correct
96 Correct 19 ms 3092 KB Output is correct
97 Correct 27 ms 2932 KB Output is correct
98 Correct 19 ms 3088 KB Output is correct
99 Correct 19 ms 3076 KB Output is correct
100 Correct 19 ms 3076 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 19 ms 2944 KB Output is correct
104 Correct 0 ms 344 KB Output is correct
105 Correct 3 ms 860 KB Output is correct
106 Correct 5 ms 1060 KB Output is correct
107 Correct 0 ms 348 KB Output is correct
108 Correct 1 ms 348 KB Output is correct
109 Correct 11 ms 2136 KB Output is correct
110 Correct 11 ms 2056 KB Output is correct
111 Correct 20 ms 3076 KB Output is correct
112 Correct 1 ms 344 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 20 ms 3088 KB Output is correct
115 Correct 0 ms 348 KB Output is correct
116 Correct 0 ms 348 KB Output is correct
117 Correct 11 ms 2136 KB Output is correct
118 Correct 11 ms 2060 KB Output is correct
119 Correct 19 ms 2948 KB Output is correct
120 Correct 19 ms 3096 KB Output is correct
121 Correct 19 ms 3096 KB Output is correct
122 Correct 20 ms 3084 KB Output is correct
123 Correct 19 ms 3080 KB Output is correct
124 Correct 19 ms 3084 KB Output is correct
125 Correct 22 ms 3076 KB Output is correct
126 Correct 19 ms 3088 KB Output is correct
127 Correct 24 ms 3312 KB Output is correct
128 Correct 19 ms 3076 KB Output is correct