이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "vision.h"
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> v2i;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
void construct_network(int H, int W, int K) {
vi finalouts;
rep(i, K + 1) {
rep(x, W+i-K) {
rep(y, H - i) {
finalouts.pb(add_and({ x + y*W, (x+K-i) + (y+i)*W }));
}
}
}
for (int i = 1; i < K; i++) {
for (int x = K-i; x < W; x++)
{
rep(y, H - i) {
finalouts.pb(add_and({ x + y*W, (x + i - K) + (y + i)*W }));
}
}
}
add_or(finalouts);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |