답안 #442563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442563	2021-07-08T08:11:03 Z	peijar	Vision Program (IOI19_vision)	C++17	34 / 100	58 ms	5312 KB

vision

#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) {
      int col = nbCol - 1 + lig - diff;
      if (col < 0 or col >= nbCol)
        continue;
      cases.push_back(nbCol * lig + col);
    }
    orDiff[diff] = add_or(cases);
    xorDiff[diff] = add_xor(cases);
  }

  auto sumLess = [&](int k) {
    vector<int> sumLessK;
    for (int sum = 0; sum + k <= maxSum; ++sum) {
      vector<int> ors, xors;
      for (int s = sum; s <= sum + k; ++s)
        ors.push_back(orSum[s]), xors.push_back(xorSum[s]);
      sumLessK.push_back(add_and({add_or(ors), add_not(add_xor(xors))}));
    }
    return add_or(sumLessK);
  };

  auto diffLess = [&](int k) {
    vector<int> diffLessK;
    for (int diff = 0; diff + k <= maxSum; ++diff) {
      vector<int> ors, xors;
      for (int d = diff; d <= diff + k; ++d)
        ors.push_back(orDiff[d]), xors.push_back(xorDiff[d]);
      diffLessK.push_back(add_and({add_or(ors), add_not(add_xor(xors))}));
    }
    return add_or(diffLessK);
  };

  if (K == 1)
    add_and({sumLess(K), diffLess(K)});
  else
    add_and({sumLess(K), diffLess(K),
             add_or({add_not(diffLess(K - 1)), add_not(sumLess(K - 1))})});
}

Subtask #1
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Incorrect	1 ms	204 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Incorrect	1 ms	204 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Incorrect	1 ms	204 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Incorrect	1 ms	204 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #5
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	460 KB	Output is correct
2	Correct	11 ms	1072 KB	Output is correct
3	Correct	11 ms	1100 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	3 ms	588 KB	Output is correct
6	Correct	10 ms	1044 KB	Output is correct
7	Correct	9 ms	972 KB	Output is correct
8	Correct	2 ms	288 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	14 ms	992 KB	Output is correct
11	Correct	11 ms	1100 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	8 ms	788 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	3 ms	460 KB	Output is correct
16	Correct	11 ms	972 KB	Output is correct
17	Correct	11 ms	1100 KB	Output is correct
18	Correct	11 ms	1068 KB	Output is correct
19	Correct	8 ms	888 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct

Subtask #6
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	3 ms	424 KB	Output is correct
4	Correct	6 ms	804 KB	Output is correct
5	Correct	6 ms	716 KB	Output is correct
6	Correct	5 ms	716 KB	Output is correct
7	Correct	2 ms	416 KB	Output is correct
8	Correct	5 ms	588 KB	Output is correct
9	Correct	10 ms	1064 KB	Output is correct
10	Correct	11 ms	1228 KB	Output is correct
11	Correct	9 ms	1020 KB	Output is correct
12	Correct	4 ms	460 KB	Output is correct
13	Correct	2 ms	460 KB	Output is correct
14	Correct	10 ms	972 KB	Output is correct
15	Correct	9 ms	932 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	2 ms	460 KB	Output is correct
18	Correct	11 ms	1100 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	12 ms	1244 KB	Output is correct
21	Correct	30 ms	2852 KB	Output is correct
22	Correct	29 ms	2804 KB	Output is correct
23	Correct	11 ms	1100 KB	Output is correct
24	Correct	11 ms	1312 KB	Output is correct
25	Correct	32 ms	3040 KB	Output is correct
26	Correct	10 ms	1100 KB	Output is correct
27	Correct	23 ms	2112 KB	Output is correct
28	Correct	53 ms	4576 KB	Output is correct
29	Correct	58 ms	5312 KB	Output is correct
30	Correct	48 ms	4420 KB	Output is correct
31	Correct	20 ms	1996 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct

Subtask #7
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	2212 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	3 ms	460 KB	Output is correct
4	Correct	5 ms	588 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	540 KB	Output is correct
7	Correct	11 ms	1300 KB	Output is correct
8	Correct	11 ms	1228 KB	Output is correct
9	Correct	24 ms	2124 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct

Subtask #8
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Incorrect	1 ms	204 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

답안 #442563

Compilation message