This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
set<pair<int,int> > S; S.clear();
vector<int> v; v.clear();
for(int i = 0; i < H; i++)
{
for(int j = 0; j < W; j++)
{
if(i+j==0)continue;
//for(int k = i; k < H; k++)
//{
// for(int l = 0; l < W; l++)
// {
vector<int> Ns; Ns.clear();
Ns = {i*W+j, 0};
if(abs(i-0)+abs(j-0)!=K or S.count({i*W+j, 0})) continue;
S.insert({i*W+j, 0});
S.insert({0, i*W+j});
int x = add_and(Ns); v.push_back(x);
// }
//}
}
}
add_or(v);
}
# | 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... |