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 <bits/stdc++.h>
#include "vision.h"
#pragma GCC optimize("O2,unroll-loops")
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define en cin.close();return 0;
#define pb push_back
#define fi first//printf("%lli\n",cur);
#define se second//scanf("%lli",&n);
#define r0 return 0;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void construct_network(int h, int w, int k)
{
int lpos = h*w-1;
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
int i1 = i, inc = 1;
vector<int> ve;
for(int j1 = j-k;j1<j+k;j1++,i1+=inc)
{
if(i1>=0&&j1>=0&&i1<h&&j1<w)
ve.pb(i1*w+j1);
if(j1==j)
inc=-1;
}
if(!ve.empty())
{
add_or({i*w+j});
add_or(ve);
lpos=add_and({lpos+1,lpos+2});
}
}
}
vector<int> pos;
for(int i = h*w+2;i<=lpos;i+=3)
pos.pb(i);
add_or(pos);
return;
}
# | 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... |