oj.uz

답안 #1010239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1010239 2024-06-28T14:17:19 Z kunzaZa183 Vision Program (IOI19_vision) C++17
8 / 100
 1 ms 604 KB 
#include "vision.h"

#include <bits/stdc++.h>
using namespace std;

int width;

int val(int a, int b) { return a * width + b; }

void construct_network(int H, int W, int K) {
  width = W;
  vector<int> lastone;
  for (int i = 0; i <=0 ; i++) {
    for (int j = 0; j <=0; j++) {
      vector<int> vi;
      // cout << i << " " << j << "\n";
      for (int k = 0; k <= K; k++)
        if (i + k >= 0 && i + k < H) {
          if (j + K - k >= 0 && j + K - k < W) {
            // cout << i + k << " " << j + K - k << "  ";
            vi.push_back(val(i + k, j + K - k));
          }
          if (j - (K - k) >= 0 && j - (K - k) < W) {
            // cout << i + k << " " << j - (K - k) << "  ";
            vi.push_back(val(i + k, j - (K - k)));
          }
        }
      // cout << "\n\n";
      if (vi.size() >= 2) {
        int x = add_or(vi);
        vi.clear();
        vi.push_back(x);
        vi.push_back(val(i, j));
        lastone.push_back(add_and(vi));
      } else if (vi.size() == 1) {
        vi.push_back(val(i, j));
        lastone.push_back(add_and(vi));
      }
    }
  }
  add_or(lastone);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

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 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 344 KB Output is correct
7 Correct 1 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 0 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 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 440 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -