Submission #442563

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
442563	2021-07-08 08:11:03	peijar	Vision Program (IOI19_vision)	C++17	34 / 100	58 ms	5312 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 <bits/stdc++.h>
using namespace std;
/*
 * Subtask 1 - 2 - 3 - 5 - 6 - 7  : AC = 66
 * Subtask 4 8
 */
void construct_network(int nbLig, int nbCol, int K) {
  int maxSum = nbLig - 1 + nbCol - 1;
  vector<int> orSum(maxSum + 1), xorSum(maxSum + 1);
  for (int sum = 0; sum <= maxSum; ++sum) {
    vector<int> cases;
    for (int lig = 0; lig < nbLig; ++lig) {
      int col = sum - lig;
      if (col >= nbCol or col < 0)
        continue;
      cases.push_back(nbCol * lig + col);
    }
    orSum[sum] = add_or(cases);
    xorSum[sum] = add_or(cases);
  }
  // nbCol -1 + lig - col
  vector<int> orDiff(maxSum + 1), xorDiff(maxSum + 1);
  for (int diff = 0; diff <= maxSum; ++diff) {
    vector<int> cases;
    for (int lig = 0; lig < nbLig; ++lig) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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