oj.uz

답안 #685229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
685229 2023-01-23T17:31:04 Z cadmiumsky Vision Program (IOI19_vision) C++14
100 / 100
 12 ms 1840 KB 
#include <bits/stdc++.h>
#include "vision.h"

using namespace std;

#define sz(x) (int)(x).size()
//,(x).end()

const int nmax = 200 + 5;
#define less mothioash
int zero;

//int value[] = {1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1};
//int value[] = {1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int value[] = {1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1};



int query(int x, int y, int type) {
  vector<int> tmp;
  tmp.emplace_back(x);
  tmp.emplace_back(y);
  if(type == 0)
    return add_and(tmp);
  if(type == 1)
    return add_or(tmp);
  return add_xor(tmp);
}

int less(vector<int> l, int K) {
  //cerr << "Less:\n";
  //for(auto x : l)
    //cerr << value[x] << ' ';
  //cerr << '\n';
  vector<int> pref;
  int last = zero;
  for(int i = 0; i < sz(l); i++) {
    //cerr << value[l[i]] << ' ';
    pref.emplace_back(query(last, l[i], 1));
    last = pref.back();
  }
  //for(auto x : pref)
    //cerr << value[x] << ' ';
  //cerr << '\n';
  vector<int> accum;
  for(int i = K + 1; i < sz(l); i++) {
    accum.emplace_back(query(l[i], pref[i - K - 1], 0));
    //cerr << value[accum.back()] << ' ';
  }
  //cerr << '\n';
  //cerr << '\n';
  
  
  if(sz(accum) == 0) return add_not(zero);
  return add_not(add_or(accum));
}

int equal(vector<int> l, int K) {
  //cerr << "Equal:\n";
  //for(auto x : l)
    //cerr << value[x] << ' ';
  //cerr << '\n';
  vector<int> accum;
  for(int i = K; i < sz(l); i++) {
    accum.emplace_back(query(l[i - K], l[i], 0));
    //cerr << value[accum.back()] << ' ';
  }
  //cerr << '\n';
  if(sz(accum) == 0) return zero;
  return add_or(accum);
}

vector<int> prim[nmax * 2], sec[nmax * 2];

void construct_network(int H, int W, int K) {
  
  vector<int> tmp;
  if(H * W == 2) {
    tmp.emplace_back(0);
    tmp.emplace_back(1);
    add_and(tmp);
    return;
  }
  tmp.emplace_back(0);
  tmp.emplace_back(1);
  tmp.emplace_back(2);
  zero = add_and(tmp);
  
  for(int i = 0; i < H; i++) {
    for(int j = 0; j < W; j++) {
      int x = i * W + j;
      prim[i + j].emplace_back(x);
      sec[i - j + W - 1].emplace_back(x);
    }
  }
  
  vector<int> p, s;
  for(int i = 0; i < H + W - 1; i++) {
    //cerr << i << '\n';
    //for(auto x : prim[i])
      //cerr << x << '\n';
    //for(auto x : sec[i])
      //cerr << x << '\n';
    //cerr << '\n';
    p.emplace_back(add_xor(prim[i]));
    s.emplace_back(add_xor(sec[i]));
  }
  
  int eq[2] = {equal(p, K), equal(s, K)}, ls[2] = {less(p, K), less(s, K)};
  
  query(query(eq[0], ls[1], 0), query(eq[1], ls[0], 0), 1);
  
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 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 320 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 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 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 1 ms 320 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 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 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 1 ms 320 KB Output is correct
28 Correct 1 ms 340 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 320 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 320 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 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 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 1 ms 320 KB Output is correct
28 Correct 1 ms 340 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 320 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 320 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 340 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 724 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 3 ms 708 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 3 ms 596 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 452 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 444 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 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 2 ms 472 KB Output is correct
5 Correct 2 ms 472 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 580 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 452 KB Output is correct
12 Correct 3 ms 448 KB Output is correct
13 Correct 2 ms 456 KB Output is correct
14 Correct 2 ms 452 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 2 ms 472 KB Output is correct
18 Correct 2 ms 452 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 5 ms 1088 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 6 ms 980 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 7 ms 1108 KB Output is correct
25 Correct 6 ms 980 KB Output is correct
26 Correct 6 ms 980 KB Output is correct
27 Correct 11 ms 1840 KB Output is correct
28 Correct 10 ms 1744 KB Output is correct
29 Correct 10 ms 1748 KB Output is correct
30 Correct 12 ms 1692 KB Output is correct
31 Correct 9 ms 1592 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 312 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1748 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 452 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 5 ms 1116 KB Output is correct
8 Correct 6 ms 1088 KB Output is correct
9 Correct 11 ms 1832 KB Output is correct
10 Correct 1 ms 220 KB Output is correct
11 Correct 1 ms 220 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 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 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 1 ms 320 KB Output is correct
28 Correct 1 ms 340 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 320 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 320 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 340 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 724 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 3 ms 708 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 3 ms 596 KB Output is correct
48 Correct 2 ms 452 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 2 ms 468 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 1 ms 444 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 2 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 2 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 444 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 2 ms 444 KB Output is correct
73 Correct 2 ms 472 KB Output is correct
74 Correct 2 ms 472 KB Output is correct
75 Correct 2 ms 456 KB Output is correct
76 Correct 2 ms 344 KB Output is correct
77 Correct 3 ms 580 KB Output is correct
78 Correct 4 ms 600 KB Output is correct
79 Correct 2 ms 576 KB Output is correct
80 Correct 2 ms 452 KB Output is correct
81 Correct 3 ms 448 KB Output is correct
82 Correct 2 ms 456 KB Output is correct
83 Correct 2 ms 452 KB Output is correct
84 Correct 2 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 2 ms 472 KB Output is correct
87 Correct 2 ms 452 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 5 ms 1088 KB Output is correct
90 Correct 6 ms 980 KB Output is correct
91 Correct 6 ms 980 KB Output is correct
92 Correct 6 ms 980 KB Output is correct
93 Correct 7 ms 1108 KB Output is correct
94 Correct 6 ms 980 KB Output is correct
95 Correct 6 ms 980 KB Output is correct
96 Correct 11 ms 1840 KB Output is correct
97 Correct 10 ms 1744 KB Output is correct
98 Correct 10 ms 1748 KB Output is correct
99 Correct 12 ms 1692 KB Output is correct
100 Correct 9 ms 1592 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 0 ms 312 KB Output is correct
103 Correct 10 ms 1748 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 2 ms 452 KB Output is correct
106 Correct 3 ms 596 KB Output is correct
107 Correct 2 ms 468 KB Output is correct
108 Correct 1 ms 468 KB Output is correct
109 Correct 5 ms 1116 KB Output is correct
110 Correct 6 ms 1088 KB Output is correct
111 Correct 11 ms 1832 KB Output is correct
112 Correct 1 ms 220 KB Output is correct
113 Correct 1 ms 220 KB Output is correct
114 Correct 10 ms 1820 KB Output is correct
115 Correct 1 ms 348 KB Output is correct
116 Correct 2 ms 476 KB Output is correct
117 Correct 5 ms 980 KB Output is correct
118 Correct 6 ms 1108 KB Output is correct
119 Correct 9 ms 1744 KB Output is correct
120 Correct 9 ms 1740 KB Output is correct
121 Correct 9 ms 1748 KB Output is correct
122 Correct 9 ms 1764 KB Output is correct
123 Correct 9 ms 1784 KB Output is correct
124 Correct 12 ms 1764 KB Output is correct
125 Correct 11 ms 1764 KB Output is correct
126 Correct 10 ms 1764 KB Output is correct
127 Correct 9 ms 1636 KB Output is correct
128 Correct 11 ms 1676 KB Output is correct