oj.uz

답안 #793058

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793058 2023-07-25T13:15:45 Z Andrey Vision Program (IOI19_vision) C++14
0 / 100
 4 ms 1364 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);
        }
    }
    for(int i = 0; i <= h+w-2; i++) {
        for(int j = 0; j < ul[i].size(); j++) {
            cout << ur[i][j] << " ";
        }
        cout << endl;
    }
    int ans1,ans2;
    vector<int> idk1(0);
    vector<int> idk2(0);
    for(int i = 0; i < h*w-2; 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:17:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         for(int j = 0; j < ul[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~~
vision.cpp:34:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = 0; i < idk1.size()-k; i++) {
      |                    ~~^~~~~~~~~~~~~~~
vision.cpp:39:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i = 0; i < idk2.size()-k; i++) {
      |                    ~~^~~~~~~~~~~~~~~
vision.cpp:50:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i = 0; i < idk1.size(); i++) {
      |                    ~~^~~~~~~~~~~~~
vision.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i = 0; i < idk2.size(); i++) {
      |                    ~~^~~~~~~~~~~~~
vision.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i = 0; i < idk1.size()-k; i++) {
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 724 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1364 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB secret mismatch
2 Halted 0 ms 0 KB -