oj.uz

Submission #761154

# Submission time Handle Problem Language Result Execution time Memory
761154 2023-06-19T09:30:21 Z raysh07 Vision Program (IOI19_vision) C++17
0 / 100
 26 ms 3540 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

int cell(int i, int j, int m){
    return i * m + j;
}

void construct_network(int n, int m, int k) {
// 	std::vector<int> Ns;
// 	Ns = {0, 1};
// 	int a = add_and(Ns);
// 	Ns = {0, a};
// 	int b = add_or(Ns);
// 	Ns = {0, 1, b};
// 	int c = add_xor(Ns);
// 	add_not(c);

    vector <int> r, r2;
    vector <int> a;
    for (int i = 0; i < n; i++){
        a.clear();
        for (int j = 0; j < m; j++) a.push_back(cell(i, j, m));
        
        int x = add_xor(a);
        r.push_back(x);
        if (i != n - 1){
            a.clear();
            for (int j = 0; j < m; j++) {
                a.push_back(cell(i, j, m));
                a.push_back(cell(i + 1, j, m));
            }
            
            x = add_xor(a);
            r2.push_back(x);
        }
    }
    
    vector <int> c, c2;
    for (int j = 0; j < m; j++){
        a.clear();
        for (int i = 0; i < n; i++) a.push_back(cell(i, j, m));
        
        int x = add_xor(a);
        c.push_back(x);
        
        if (j != m - 1){
            a.clear();
            for (int i = 0; i < n; i++){
                a.push_back(cell(i, j, m));
                a.push_back(cell(i, j + 1, m));
            }
            
            x = add_xor(a);
            c2.push_back(x);
        }
    }
    
  //  return;
    
    int x;
    a.clear();
    for (auto &x : r){
        a.push_back(x);
        x = add_xor(a);
    }
    
    a.clear();
    for (auto &x : r2){
        a.push_back(x);
        x = add_xor(a);
    }
    
    a.clear();
    for (auto &x : c){
        a.push_back(x);
        x = add_xor(a);
    }
    
    a.clear();
    for (auto &x : c2){
        a.push_back(x);
        x = add_xor(a);
    }
   // return;
    
    int v[4];
    v[0] = add_or(r);
    if (n > 1)
    v[1] = add_or(r2);
    else v[1] = -1;
    v[2] = add_or(c);
    if (m > 1)
    v[3] = add_or(c2);
    else v[3] = -1;
    
    vector <int> pos;
    for (int i = 0; i < 4; i++){
        for (int j = i + 1; j < 4; j++){
            if (v[i] == -1 || v[j] == -1) continue;
            x = add_and({v[i], v[j]});
            pos.push_back(x);
        }
    }
    
    x = add_or(pos);
    add_not(x);
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 3540 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 0 ms 212 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -