Submission #241495

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
241495	2020-06-24 09:30:59	mosesmayer	Vision Program (IOI19_vision)	C++17	0 / 100	1158 ms	916260 KiB

vision

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "vision.h"
#include <tuple>
using namespace std;
int H, W;
int coord(int i, int j) {
  return i * W + j;
};
vector<int> get_cells(int D, bool dir) {
  // dir is 1 if left diagonal (sum), 0 if right diagonal.
  vector<int> res;
  int start, stop, diff;
  if (dir) {
    start = D < W ? D : (D - W + 1) * W + (W - 1);
    stop = D < H ? D * W : (H - 1) * W + (D - H + 1);
    diff = W - 1;
  } else {
    start = D < W ? W - 1 - D : (D - W + 1) * W;
    stop = D < H ? (D + 1) * W - 1 : H * W - 1 - (D - H + 1);
    diff = W + 1;
  }
  for (; start <= stop; start += diff)
    res.emplace_back(start);
  return res;
}
void construct_diagonals(bool dir, vector<int>& orv, vector<int>& xorv) {
  for (int i = 0; i <= H + W - 2; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 0 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19