Submission #1210345

#TimeUsernameProblemLanguageResultExecution timeMemory
1210345SpyrosAlivVision Program (IOI19_vision)C++20
8 / 100
0 ms580 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(); int m = grid[0].size(); 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++) { vector<int> cands = get_dis(0, 0, grid, k); if (!cands.empty()) finQ.push_back(add_and({0, add_or(cands)})); // } //} if (finQ.empty()) add_not(0); else 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...