제출 #1210341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1210341		SpyrosAliv	Vision Program (IOI19_vision)	C++20	0 / 100	136 ms	1312 KiB

vision

#include "vision.h"
#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);
*/
vector<int> get_dis(int r, int c, vector<vector<int>> &grid, int k) {
    int n = grid.size() + 1;
    int m = grid[0].size() + 1;
    vector<int> fin;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (abs(i - r) + abs(j - c) == k) fin.push_back(grid[i][j]);
        }
    }
    return fin;
} 

void construct_network(int H, int W, int K) {
    int n = H;
    int m = W;
    int k = K;
    vector<vector<int>> grid(n, vector<int>(m));
    int curr = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            grid[i][j] = curr++;
        }
    }
    int currPlace = n * m;
    vector<int> finQ;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            finQ.push_back(add_and({grid[i][j], add_or(get_dis(i, j, grid, k))}));
        }
    }
    add_or(finQ);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 0 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19