이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include "vision.h"
#define MAXN 207
using namespace std;
int n,m,k;
vector<int> v;
int res[MAXN][MAXN];
void construct_network(int H, int W, int K){
n=H; m=W; k=K;
for(int i=0;i<1;i++){
for(int f=0;f<1;f++){
v.clear();
for(int p=0;p<n;p++){
for(int q=0;q<m;q++){
if(abs(i-p)+abs(f-q)==k)v.push_back(p*m+q);
}
}
if(!v.empty())res[i][f]=add_and({add_or(v),i*m+f});
}
}
v.clear();
for(int i=0;i<1;i++){
for(int f=0;f<1;f++){
if(res[i][f]!=0)v.push_back(res[i][f]);
}
}
add_or(v);
}
/*
int main(){
cout<<count_rectangles({{4, 8, 7, 5, 6},
{7, 4, 10, 3, 5},
{9, 7, 20, 14, 2},
{9, 14, 7, 3, 6},
{5, 7, 5, 2, 7},
{4, 5, 13, 5, 6}})<<"\n";
return 0;
}
*/
# | 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... |