Submission #223754

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
223754	2020-04-16T10:08:38 Z	rama_pang	Vision Program (IOI19_vision)	C++14	44 / 100	80 ms	7416 KB

vision

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

int IsExist(int H, int W, int K) { // Check whether there exists one of the values >= K
  vector<vector<int>> diagL(H + W - 1); // from topleft
  vector<vector<int>> diagR(H + W - 1); // from topright

  for (int x = 0; x < H; x++) {
    for (int y = 0; y < W; y++) {
      diagL[x + y].emplace_back(x * W + y);
      diagR[x + W - y - 1].emplace_back(x * W + y);
    }
  }
  
  vector<int> prefL; // diagonal prefix from topleft
  vector<int> prefR; // diagonal prefix from topright
  vector<int> check; // check for diagonal_distance >= K from either topleft or topright

  for (int d = K; d < H + W - 1; d++) {
    prefL.insert(end(prefL), begin(diagL[d - K]), end(diagL[d - K]));
    prefR.insert(end(prefR), begin(diagR[d - K]), end(diagR[d - K]));
    check.emplace_back(add_and({add_or(diagL[d]), add_or(prefL)}));
    check.emplace_back(add_and({add_or(diagR[d]), add_or(prefR)}));
  }

  return add_or(check);
}

void construct_network(int H, int W, int K) {
  if (K == H + W - 2) {
    IsExist(H, W, K);
  } else {
    add_and({IsExist(H, W, K), add_not(IsExist(H, W, K + 1))});
  }
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	4 ms	256 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	4 ms	256 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	4 ms	256 KB	Output is correct

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	4 ms	256 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	4 ms	256 KB	Output is correct
28	Correct	11 ms	896 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	256 KB	Output is correct
32	Correct	9 ms	640 KB	Output is correct
33	Correct	15 ms	1280 KB	Output is correct
34	Correct	11 ms	896 KB	Output is correct
35	Correct	7 ms	512 KB	Output is correct
36	Correct	5 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct

Subtask #4
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	4 ms	256 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	4 ms	256 KB	Output is correct
28	Correct	11 ms	896 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	256 KB	Output is correct
32	Correct	9 ms	640 KB	Output is correct
33	Correct	15 ms	1280 KB	Output is correct
34	Correct	11 ms	896 KB	Output is correct
35	Correct	7 ms	512 KB	Output is correct
36	Correct	5 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Incorrect	10 ms	6144 KB	WA in grader: Too many inputs
39	Halted	0 ms	0 KB	-

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	1152 KB	Output is correct
2	Correct	7 ms	512 KB	Output is correct
3	Correct	7 ms	640 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	14 ms	1024 KB	Output is correct
6	Correct	9 ms	640 KB	Output is correct
7	Correct	6 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	13 ms	1152 KB	Output is correct
10	Correct	10 ms	768 KB	Output is correct
11	Correct	7 ms	512 KB	Output is correct
12	Correct	7 ms	512 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	13 ms	1152 KB	Output is correct
16	Correct	10 ms	768 KB	Output is correct
17	Correct	7 ms	512 KB	Output is correct
18	Correct	7 ms	512 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	4 ms	256 KB	Output is correct

Subtask #6
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	80 ms	7416 KB	Output is correct
4	Correct	49 ms	4092 KB	Output is correct
5	Correct	21 ms	1792 KB	Output is correct
6	Correct	8 ms	640 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Incorrect	8 ms	5376 KB	WA in grader: Too many inputs
9	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	10 ms	6528 KB	WA in grader: Too many inputs
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	256 KB	Output is correct
12	Correct	4 ms	256 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	4 ms	256 KB	Output is correct
28	Correct	11 ms	896 KB	Output is correct
29	Correct	5 ms	384 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	256 KB	Output is correct
32	Correct	9 ms	640 KB	Output is correct
33	Correct	15 ms	1280 KB	Output is correct
34	Correct	11 ms	896 KB	Output is correct
35	Correct	7 ms	512 KB	Output is correct
36	Correct	5 ms	384 KB	Output is correct
37	Correct	5 ms	384 KB	Output is correct
38	Incorrect	10 ms	6144 KB	WA in grader: Too many inputs
39	Halted	0 ms	0 KB	-

Submission #223754

Compilation message