이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "vision.h"
#include <bits/stdc++.h>
#define ll int
#define vll vector<ll>
#define ins insert
#define pb push_back
using namespace std;
void construct_network(int h, int w, int k) {
ll i,j;
auto check = [&](ll k){
auto calc = [&](auto dia){
vll a;
for(auto [i, j] : dia){
a.pb(add_or(j));
}
vll pr(a.size());
ll n=a.size();
for(i=0;i<n;i++){
if(i==0) pr[i] = a[i];
else pr[i] = add_or({pr[i - 1], a[i]});
}
vll res;
for(i=k;i<n;i++){
res.pb(add_and({pr[i - k], a[i]}));
}
return add_or(res);
};
map<ll,vector<ll>> dia,dia2;
for(i=0;i<h;i++){
for(j=0;j<w;j++){
dia[i + j].pb(i * w + j);
dia2[i - j].pb(i * w + j);
}
}
return add_or({calc(dia), calc(dia2)});
};
if(k == h + w - 2) check(k);
else{
ll a = check(k), b = check(k + 1);
add_and({a, add_not(b)});
}
}
# | 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... |