oj.uz

Submission #725795

# Submission time Handle Problem Language Result Execution time Memory
725795 2023-04-18T05:36:41 Z PixelCat Vision Program (IOI19_vision) C++14
14 / 100
 9 ms 1568 KB 
#include "vision.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i,a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

void construct_network(int H, int W, 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<vector<int>> row(H);
    vector<vector<int>> col(W);
    For(i, 0, H - 1) For(j, 0, W - 1) {
        int id = i * W + j;
        row[i].eb(id);
        col[j].eb(id);
    }
    vector<int> or_row(H);
    vector<int> or_col(W);
    For(i, 0, H - 1) or_row[i] = add_or(row[i]);
    For(i, 0, W - 1) or_col[i] = add_or(col[i]);
    
    vector<int> adj;
    int a, b;

    if(H >= 2) {
        adj.clear();
        For(i, 0, H - 2) {
            adj.eb(add_and({or_row[i], or_row[i + 1]}));
        }
        a = add_and({add_xor(or_col), add_or(adj)});
    }
    
    if(W >= 2) {
        adj.clear();
        For(i, 0, W - 2) {
            adj.eb(add_and({or_col[i], or_col[i + 1]}));
        }
        b = add_and({add_xor(or_row), add_or(adj)});
    }
    
    if(H >= 2 && W >= 2) {
        add_or({a, b});
    }
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:60:22: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
   60 |         add_or({a, b});
      |                      ^

Subtask #1
0 / 10.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 #2
0 / 11.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 #3
0 / 11.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 #4
0 / 15.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 #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1492 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 5 ms 836 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 9 ms 1568 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #8
0 / 19.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 -