oj.uz

Submission #235077

# Submission time Handle Problem Language Result Execution time Memory
235077 2020-05-26T23:45:21 Z UserIsUndefined Vision Program (IOI19_vision) C++14
8 / 100
 5 ms 384 KB 
#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

map<pair<int,int> , bool> visited;

void construct_network(int H, int W, int K) {
	std::vector<int> Ns;

    for (int i = 0 ; i < 1 ; i++){
        int row = i/W;
        int cal = i%W;
        vector<int> good;

        for (int j = 0 ; j <= K ; j++){
            bool down, up, leftt, rightt;
            int res = K - j;
            down = up = leftt = rightt = false;

            if (row + j < H)down = true;
            if (row - j >= 0)up = true;
            if (cal + res < W)rightt = true;
            if (cal - res >= 0)leftt = true;

            if (down){
                int idx = (row + j)*W;
                if (leftt){
                    idx+= (cal - res);
                    if (visited[{i,idx}] == true)continue;
                    good.push_back(idx);
                    visited[{i, idx}] = visited[{idx, i}] = true;
                }
                if (rightt){
                    idx = (row + j)*W;
                    idx+= cal + res;
                    if (visited[{i,idx}] == true)continue;
                    good.push_back(idx);
                    visited[{i, idx}] = visited[{idx, i}] = true;
                }
            }

            if (up){
                if (leftt){
                    int idx = (row - j)*W;
                    idx+= (cal - res);
                    if (visited[{i,idx}] == true)continue;
                    good.push_back(idx);
                    visited[{i, idx}] = visited[{idx, i}] = true;
                }
                if (rightt){
                    int idx = (row - j)*W;
                    idx+= (cal + res);
                    if (visited[{i,idx}] == true)continue;
                    good.push_back(idx);
                    visited[{i, idx}] = visited[{idx, i}] = true;
                }
            }



        }


        for (int x : good){
            vector<int> test;
            test.push_back(i);
            test.push_back(x);
            Ns.push_back(add_and(test));
        }

    }

    add_xor(Ns);

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 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 384 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 5 ms 384 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 4 ms 256 KB Output is correct
24 Correct 4 ms 256 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 4 ms 256 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 256 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 5 ms 256 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -