제출 #146310

#제출 시각아이디문제언어결과실행 시간메모리
146310jwvg0425Vision Program (IOI19_vision)C++17
33 / 100
128 ms1272 KiB
#include "vision.h" #include <stdio.h> #include <vector> #include <queue> #include <algorithm> #include <iostream> #include <string> #include <bitset> #include <map> #include <set> #include <tuple> #include <string.h> #include <math.h> #include <random> #include <functional> #include <assert.h> #include <math.h> #define all(x) (x).begin(), (x).end() #define xx first #define yy second using namespace std; using i64 = long long int; using ii = pair<int, int>; using ii64 = pair<i64, i64>; void construct_network(int H, int W, int K) { int inst = 0; for (int y1 = 0; y1 < H; y1++) { for (int x1 = 0; x1 < W; x1++) { int a = y1 * W + x1; for (int y2 = 0; y2 < H; y2++) { for (int x2 = 0; x2 < W; x2++) { if (abs(x1 - x2) + abs(y1 - y2) != K) continue; int b = y2 * W + x2; add_and({ a, b }); inst++; } } } } vector<int> ors; for (int i = 0; i < inst; i++) ors.push_back(H * W + i); add_or(ors); }
#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...