oj.uz

답안 #793061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793061 2023-07-25T13:18:58 Z Andrey Vision Program (IOI19_vision) C++14
12 / 100
 20 ms 3468 KB 
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> ul[1000];
vector<int> ur[1000];

void construct_network(int h, int w, int k) {
    int br = 0;
    for(int i = 0; i < h; i++) {
        for(int j = 0; j < w; j++) {
            ul[i+j].push_back(i*w+j);
            ur[i+w-j-1].push_back(i*w+j);
        }
    }
    int ans1,ans2;
    vector<int> idk1(0);
    vector<int> idk2(0);
    for(int i = 0; i < h+w-1; i++) {
        idk1.push_back(br+h*w);
        add_xor(ul[i]);
        br++;
        idk2.push_back(br+h*w);
        add_xor(ur[i]);
        br++;
    }
    vector<int> wut(0);
    for(int i = 0; i < idk1.size()-k; i++) {
        add_and({idk1[i],idk1[i+k]});
        wut.push_back(h*w+br);
        br++;
    }
    for(int i = 0; i < idk2.size()-k; i++) {
        add_and({idk2[i],idk2[i+k]});
        wut.push_back(h*w+br);
        br++;
    }
    add_or(wut);
    wut.clear();
    ans1 = h*w+br;
    br++;
    vector<int> wow1(0);
    vector<int> wow2(0);
    for(int i = 0; i < idk1.size(); i++) {
        wut.push_back(idk1[i]);
        add_xor(wut);
        wow1.push_back(h*w+br);
        br++;
    }
    wut.clear();
    for(int i = 0; i < idk2.size(); i++) {
        wut.push_back(idk2[i]);
        add_xor(wut);
        wow2.push_back(h*w+br);
        br++;
    }
    wut.clear();
    for(int i = 0; i < idk1.size()-k; i++) {
        add_and({idk1[i],idk1[i+k]});
        add_and({idk2[i],idk2[i+k]});
        wut.push_back(h*w+br);
        wut.push_back(h*w+br+1);
        br+=2;
    }
    add_or(wut);
    wut.clear();
    add_not(h*w+br);
    ans2 = h*w+br;
    add_and({ans1,ans2});
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:28:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i = 0; i < idk1.size()-k; i++) {
      |                    ~~^~~~~~~~~~~~~~~
vision.cpp:33:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0; i < idk2.size()-k; i++) {
      |                    ~~^~~~~~~~~~~~~~~
vision.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = 0; i < idk1.size(); i++) {
      |                    ~~^~~~~~~~~~~~~
vision.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i = 0; i < idk2.size(); i++) {
      |                    ~~^~~~~~~~~~~~~
vision.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int i = 0; i < idk1.size()-k; i++) {
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 0 ms 344 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 0 ms 344 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 0 ms 344 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 0 ms 344 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 6 ms 800 KB Output is correct
4 Correct 3 ms 728 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 4 ms 732 KB Output is correct
11 Correct 4 ms 732 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 4 ms 708 KB Output is correct
15 Correct 4 ms 732 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 4 ms 708 KB Output is correct
20 Correct 4 ms 732 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 856 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 856 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 4 ms 736 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 736 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 4 ms 692 KB Output is correct
20 Correct 11 ms 2004 KB Output is correct
21 Incorrect 11 ms 2008 KB on inputs (0, 0), (199, 99), expected 0, but computed 1
22 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 3468 KB on inputs (126, 120), (176, 169), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 0 ms 344 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -