제출 #1155663

#제출 시각아이디문제언어결과실행 시간메모리
1155663gygVision Program (IOI19_vision)C++20
8 / 100
1 ms328 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; #define vec vector int n, m, k; int id(int i, int j) { return i * m + j; } void construct_network(int _n, int _m, int _k) { n = _n, m = _m, k = _k; int cnt = 0; for (int a = 0; a < n; a++) { for (int b = 0; b < m; b++) { if (a != 0 || b != 0) continue; for (int c = 0; c < n; c++) { for (int d = 0; d < m; d++) { if (id(a, b) >= id(c, d)) continue; if (abs(a - c) + abs(b - d) != k) continue; cnt++, add_and({id(a, b), id(c, d)}); } } } } vec<int> lst; for (int i = n * m; i <= n * m + cnt - 1; i++) lst.push_back(i); add_or(lst); }
#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...