oj.uz

Submission #238875

# Submission time Handle Problem Language Result Execution time Memory
238875 2020-06-13T10:19:37 Z UserIsUndefined Vision Program (IOI19_vision) C++14
0 / 100
 13 ms 1152 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) {
	vector<int> calsXor;
    vector<int> rowsXor;
    vector<int> test;

    for (int i = 0 ; i < H * W ; i++){
        if (i && i % W == 0 && test.size()){calsXor.push_back(add_xor(test)); test.clear();}
        test.push_back(i);
    }

    if (H * W == 2){
        add_and({0 , 1});
        return;
    }

    if (test.size())calsXor.push_back(add_xor(test));
    test.clear();

    for (int i = 0 ; i < W ; i++){
        for (int j = i ; j < W * H ; j+= W){
            test.push_back(j);
        }
        if(test.size())rowsXor.push_back(add_xor(test));
        test.clear();
    }

    vector<int> androws;
    vector<int> andcals;

    for (int i = 0 ; i < calsXor.size() - 1 ; i++){
        andcals.push_back(add_and({calsXor[i], calsXor[i+1]}));
    }

    for (int i = 0 ; i < rowsXor.size() - 1 ; i++){
        androws.push_back(add_and({rowsXor[i], rowsXor[i+1]}));
    }

    int conrow , concal, samerow, samecal;

    conrow = add_xor(androws);
    concal = add_xor(andcals);
    samecal = add_not(add_or(calsXor));
    samerow = add_not(add_or(rowsXor));


    int ConRowSameCal, ConCalSameRow;

    ConCalSameRow = add_and({concal, samerow});
    ConRowSameCal = add_and({conrow , samecal});

    add_or({ConCalSameRow , ConRowSameCal});


}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:37:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0 ; i < calsXor.size() - 1 ; i++){
                      ~~^~~~~~~~~~~~~~~~~~~~
vision.cpp:41:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0 ; i < rowsXor.size() - 1 ; i++){
                      ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 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 Correct 13 ms 1152 KB Output is correct
2 Correct 5 ms 432 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Incorrect 5 ms 384 KB WA in grader: Instruction with no inputs
6 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -