Submission #1210339

#TimeUsernameProblemLanguageResultExecution timeMemory
1210339SpyrosAlivVision Program (IOI19_vision)C++20
0 / 100
136 ms1300 KiB
#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);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...