oj.uz

Submission #674485

# Submission time Handle Problem Language Result Execution time Memory
674485 2022-12-24T14:02:56 Z tbzard Vision Program (IOI19_vision) C++14
20 / 100
 76 ms 9388 KB 
#include <bits/stdc++.h>
using namespace std;

int add_not(int n);
int add_and(vector<int> ns);
int add_or(vector<int> ns);
int add_xor(vector<int> ns);

int getpoint(int x, int y, int w){
    return x*w + y;
}
int check(int h, int w, int k){
    vector<int> aans, dans;
    vector<pair<int, int> > axy[402], dxy[402];
    int aidx[402], didx[402];
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            axy[i+j].push_back(make_pair(i, j));
            dxy[i-j+200].push_back(make_pair(i, j));
        }
    }
    vector<int> p3;
    for(int i=0;i<h+w-1;i++){
        vector<int> p2;
        for(int j=0;j<axy[i].size();j++){
            int p = getpoint(axy[i][j].first, axy[i][j].second, w);
            p2.push_back(p);
        }
        if(p2.empty()) continue;
        aidx[i] = add_or(p2);
        p3.push_back(aidx[i]);
    }
    int acheck = add_xor(p3);

    for(int i=0;i<h+w-1;i++){
        vector<int> p2;
        for(int j=0;j<h+w-1;j++){
            if(i == j) continue;
            if(abs(i-j) <= k) p2.push_back(aidx[j]);
        }
        if(p2.empty()) continue;
        p2.push_back(acheck);
        int tmp = add_or(p2);
        aans.push_back(add_and(vector<int>{aidx[i], tmp}));
    }
    int ans1 = add_or(aans);

    p3.clear();
    for(int i=0-w-1+200;i<h-1-0+200;i++){
        vector<int> p2;
        for(int j=0;j<dxy[i].size();j++){
            int p = getpoint(dxy[i][j].first, dxy[i][j].second, w);
            p2.push_back(p);
        }
        if(p2.empty()) continue;
        didx[i] = add_or(p2);
        p3.push_back(didx[i]);
    }
    int dcheck = add_xor(p3);

    for(int i=0-w-1+200;i<h-1-0+200;i++){
        vector<int> p2;
        for(int j=0-w-1+200;j<h-1-0+200;j++){
            if(i == j) continue;
            if(abs(i-j) <= k) p2.push_back(didx[j]);
        }
        if(p2.empty()) continue;
        p2.push_back(dcheck);
        int tmp = add_or(p2);
        dans.push_back(add_and(vector<int>{didx[i], tmp}));
    }
    int ans2 = add_or(dans);

    return add_and(vector<int>{ans1, ans2});
}
void construct_network(int h, int w, int k){
    int last1 = check(h, w, k);
    if(k != 1){
        int last2 = check(h, w, k-1);
        int last3 = add_not(last2);
        add_and(vector<int>{last1, last3});
    }
}

Compilation message

vision.cpp: In function 'int check(int, int, int)':
vision.cpp:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for(int j=0;j<axy[i].size();j++){
      |                     ~^~~~~~~~~~~~~~
vision.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         for(int j=0;j<dxy[i].size();j++){
      |                     ~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 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 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 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 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 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 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Incorrect 0 ms 212 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 12 ms 1492 KB Output is correct
3 Correct 13 ms 1492 KB Output is correct
4 Correct 15 ms 1836 KB Output is correct
5 Correct 3 ms 556 KB Output is correct
6 Correct 9 ms 1236 KB Output is correct
7 Correct 14 ms 1620 KB Output is correct
8 Correct 16 ms 1748 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 9 ms 1108 KB Output is correct
11 Correct 12 ms 1492 KB Output is correct
12 Correct 12 ms 1620 KB Output is correct
13 Correct 15 ms 1832 KB Output is correct
14 Correct 15 ms 1748 KB Output is correct
15 Correct 1 ms 424 KB Output is correct
16 Correct 8 ms 1108 KB Output is correct
17 Correct 12 ms 1492 KB Output is correct
18 Correct 12 ms 1492 KB Output is correct
19 Correct 15 ms 1748 KB Output is correct
20 Correct 16 ms 1832 KB Output is correct
21 Correct 0 ms 300 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 5 ms 812 KB Output is correct
5 Correct 8 ms 912 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 10 ms 1108 KB Output is correct
8 Correct 3 ms 680 KB Output is correct
9 Correct 9 ms 1364 KB Output is correct
10 Correct 13 ms 1620 KB Output is correct
11 Correct 15 ms 1876 KB Output is correct
12 Correct 16 ms 1876 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 9 ms 1204 KB Output is correct
15 Correct 15 ms 1680 KB Output is correct
16 Correct 15 ms 1756 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 12 ms 1448 KB Output is correct
19 Correct 16 ms 1800 KB Output is correct
20 Correct 6 ms 1236 KB Output is correct
21 Correct 29 ms 3668 KB Output is correct
22 Correct 39 ms 4940 KB Output is correct
23 Correct 42 ms 5212 KB Output is correct
24 Correct 6 ms 1236 KB Output is correct
25 Correct 35 ms 4356 KB Output is correct
26 Correct 43 ms 5336 KB Output is correct
27 Correct 11 ms 2260 KB Output is correct
28 Correct 45 ms 5820 KB Output is correct
29 Correct 64 ms 7852 KB Output is correct
30 Correct 73 ms 9004 KB Output is correct
31 Correct 76 ms 9388 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
0 / 14.0

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

Subtask #8
0 / 19.0

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