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