이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K)
{
vector < int > vec;
int cnt = 0;
for (int i = 0; i < H; i ++)
for (int j = 0; j < W; j ++)
for (int x = 0; x < H; x ++)
for (int y = 0; y < W; y ++)
{
int dis = abs(x - i) + abs(y - j);
if (dis == K)
{
///cout << i << " : " << j << " : " << x << " : " << y << endl;
cnt ++;
vec.push_back(i * W + j);
vec.push_back(x * W + y);
add_and(vec);
vec.clear();
}
}
for (int i = H * W; i < H * W + cnt; i ++)
vec.push_back(i);
add_or(vec);
/**cout << "now" << endl;
for (int v : vec)
cout << v << " ";
cout << endl;*/
}
# | 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... |