oj.uz

답안 #535419

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535419 2022-03-10T09:07:42 Z mario05092929 Vision Program (IOI19_vision) C++14
100 / 100
 17 ms 1916 KB 
#include "vision.h"
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair <int,int> pi;
int n,m,k,pl;
int ad[405],su[405],adi[405],sui[405];
int ad_ori[405],su_ori[405];
int ad_or[405],su_or[405];
vector <int> adv[405], suv[405];
vector <int> mo;
vector <int> check;
vector <int> check2;

int f(int x,int y) {
    return x*m+y;
}

int dist(int x1,int y1,int x2,int y2) {
    return abs(x1-x2)+abs(y1-y2);
}

void construct_network(int H, int W, int K) {
    n = H, m = W, k = K;
    int sx = -1,sy,st = n*m,en = n*m;
    for(int i = 0;i < n;i++) {
        for(int j = 0;j < m;j++) {
            suv[i-j+m].push_back(f(i,j));
            adv[i+j+1].push_back(f(i,j));
        }
    }
    for(int i = 1;i < n+m;i++) {
        su[i] = en;
        sui[i] = add_or(suv[i]); en++;
    }
    for(int i = 1;i < n+m;i++) {
        ad[i] = en;
        adi[i] = add_or(adv[i]); en++;
    }
    for(int i = 1;i < n+m;i++) {
        if(i > k) {
            check.push_back(en);
            add_and({su[i],su_or[i-k]}); en++;
        }
        if(i == 1) {
            su_or[i] = su[i];
            su_ori[i] = sui[i];
        }
        else {
            su_or[i] = en;
            su_ori[i] = add_or({su_or[i-1],su[i]}); en++;
        }
    }
    for(int i = 1;i < n+m;i++) {
        if(i > k) {
            check.push_back(en);
            add_and({ad[i],ad_or[i-k]}); en++;
        }
        if(i == 1) {
            ad_or[i] = ad[i];
            ad_ori[i] = adi[i];
        }
        else {
            ad_or[i] = en;
            ad_ori[i] = add_or({ad_or[i-1],ad[i]}); en++;
        }
    }

    memset(ad_or,0,sizeof(ad_or));
    memset(su_or,0,sizeof(su_or));

    for(int i = 1;i < n+m;i++) {
        if(i > k+1) {
            check2.push_back(en);
            add_and({su[i],su_or[i-k-1]}); en++;
        }
        if(i == 1) {
            su_or[i] = su[i];
            su_ori[i] = sui[i];
        }
        else {
            su_or[i] = en;
            su_ori[i] = add_or({su_or[i-1],su[i]}); en++;
        }
    }
    for(int i = 1;i < n+m;i++) {
        if(i > k+1) {
            check2.push_back(en);
            add_and({ad[i],ad_or[i-k-1]}); en++;
        }
        if(i == 1) {
            ad_or[i] = ad[i];
            ad_ori[i] = adi[i];
        }
        else {
            ad_or[i] = en;
            ad_ori[i] = add_or({ad_or[i-1],ad[i]}); en++;
        }
    }
    vector <int> ans;
    for(int i : check) ans.push_back(i);
    add_or(ans); en++;
    ans.clear();
    if(!(int)check2.size()) return;
    for(int i : check2) ans.push_back(i);
    add_or(ans); en++;
    add_xor({en-2,en-1});
    return;
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:27:9: warning: unused variable 'sx' [-Wunused-variable]
   27 |     int sx = -1,sy,st = n*m,en = n*m;
      |         ^~
vision.cpp:27:17: warning: unused variable 'sy' [-Wunused-variable]
   27 |     int sx = -1,sy,st = n*m,en = n*m;
      |                 ^~
vision.cpp:27:20: warning: unused variable 'st' [-Wunused-variable]
   27 |     int sx = -1,sy,st = n*m,en = n*m;
      |                    ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 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 1 ms 340 KB Output is correct
34 Correct 2 ms 328 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 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 1 ms 340 KB Output is correct
34 Correct 2 ms 328 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 1 ms 324 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 584 KB Output is correct
42 Correct 2 ms 456 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 5 ms 724 KB Output is correct
45 Correct 4 ms 712 KB Output is correct
46 Correct 4 ms 724 KB Output is correct
47 Correct 4 ms 724 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 452 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 476 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 484 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
14 Correct 1 ms 356 KB Output is correct
15 Correct 2 ms 472 KB Output is correct
16 Correct 2 ms 484 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 2 ms 484 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 2 ms 356 KB Output is correct
21 Correct 1 ms 228 KB Output is correct
22 Correct 1 ms 228 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 4 ms 484 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 424 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 4 ms 612 KB Output is correct
9 Correct 4 ms 636 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 7 ms 596 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 7 ms 1108 KB Output is correct
21 Correct 8 ms 1176 KB Output is correct
22 Correct 6 ms 1108 KB Output is correct
23 Correct 10 ms 1064 KB Output is correct
24 Correct 7 ms 1108 KB Output is correct
25 Correct 7 ms 1164 KB Output is correct
26 Correct 6 ms 980 KB Output is correct
27 Correct 12 ms 1916 KB Output is correct
28 Correct 12 ms 1876 KB Output is correct
29 Correct 12 ms 1728 KB Output is correct
30 Correct 12 ms 1748 KB Output is correct
31 Correct 13 ms 1788 KB Output is correct
32 Correct 1 ms 324 KB Output is correct
33 Correct 1 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1876 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 7 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 8 ms 1184 KB Output is correct
8 Correct 9 ms 1108 KB Output is correct
9 Correct 14 ms 1908 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 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 1 ms 340 KB Output is correct
34 Correct 2 ms 328 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 1 ms 324 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 584 KB Output is correct
42 Correct 2 ms 456 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 5 ms 724 KB Output is correct
45 Correct 4 ms 712 KB Output is correct
46 Correct 4 ms 724 KB Output is correct
47 Correct 4 ms 724 KB Output is correct
48 Correct 3 ms 452 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 1 ms 476 KB Output is correct
51 Correct 2 ms 456 KB Output is correct
52 Correct 2 ms 468 KB Output is correct
53 Correct 2 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 2 ms 484 KB Output is correct
60 Correct 1 ms 484 KB Output is correct
61 Correct 1 ms 356 KB Output is correct
62 Correct 2 ms 472 KB Output is correct
63 Correct 2 ms 484 KB Output is correct
64 Correct 2 ms 464 KB Output is correct
65 Correct 2 ms 484 KB Output is correct
66 Correct 2 ms 464 KB Output is correct
67 Correct 2 ms 356 KB Output is correct
68 Correct 1 ms 228 KB Output is correct
69 Correct 1 ms 228 KB Output is correct
70 Correct 1 ms 228 KB Output is correct
71 Correct 1 ms 356 KB Output is correct
72 Correct 4 ms 484 KB Output is correct
73 Correct 2 ms 532 KB Output is correct
74 Correct 2 ms 424 KB Output is correct
75 Correct 2 ms 484 KB Output is correct
76 Correct 2 ms 464 KB Output is correct
77 Correct 4 ms 612 KB Output is correct
78 Correct 4 ms 636 KB Output is correct
79 Correct 4 ms 596 KB Output is correct
80 Correct 4 ms 596 KB Output is correct
81 Correct 7 ms 596 KB Output is correct
82 Correct 2 ms 468 KB Output is correct
83 Correct 2 ms 468 KB Output is correct
84 Correct 2 ms 468 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 2 ms 468 KB Output is correct
87 Correct 2 ms 468 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 7 ms 1108 KB Output is correct
90 Correct 8 ms 1176 KB Output is correct
91 Correct 6 ms 1108 KB Output is correct
92 Correct 10 ms 1064 KB Output is correct
93 Correct 7 ms 1108 KB Output is correct
94 Correct 7 ms 1164 KB Output is correct
95 Correct 6 ms 980 KB Output is correct
96 Correct 12 ms 1916 KB Output is correct
97 Correct 12 ms 1876 KB Output is correct
98 Correct 12 ms 1728 KB Output is correct
99 Correct 12 ms 1748 KB Output is correct
100 Correct 13 ms 1788 KB Output is correct
101 Correct 1 ms 324 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 14 ms 1876 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 2 ms 468 KB Output is correct
106 Correct 7 ms 596 KB Output is correct
107 Correct 2 ms 468 KB Output is correct
108 Correct 3 ms 468 KB Output is correct
109 Correct 8 ms 1184 KB Output is correct
110 Correct 9 ms 1108 KB Output is correct
111 Correct 14 ms 1908 KB Output is correct
112 Correct 1 ms 328 KB Output is correct
113 Correct 1 ms 328 KB Output is correct
114 Correct 15 ms 1864 KB Output is correct
115 Correct 1 ms 468 KB Output is correct
116 Correct 2 ms 468 KB Output is correct
117 Correct 7 ms 1060 KB Output is correct
118 Correct 9 ms 1108 KB Output is correct
119 Correct 13 ms 1852 KB Output is correct
120 Correct 13 ms 1748 KB Output is correct
121 Correct 12 ms 1748 KB Output is correct
122 Correct 13 ms 1800 KB Output is correct
123 Correct 12 ms 1876 KB Output is correct
124 Correct 11 ms 1844 KB Output is correct
125 Correct 17 ms 1772 KB Output is correct
126 Correct 13 ms 1800 KB Output is correct
127 Correct 16 ms 1748 KB Output is correct
128 Correct 13 ms 1772 KB Output is correct