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>
#define sz(x) ll(x.size())
#define all(x) x.begin(),x.end()
#define pb push_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const ll MAX=1e6;
//ii mobs[10]={{1,1},{-1,-1},{1,-1},{-1,1},{0,1},{1,0},{-1, 0},{0, -1}};
int n, m, k;
int dist(int a, int b, int i, int j){
return abs(a-i)+abs(b-j);
}
vector<int>s, p, q;
void look(int a, int b){
}
void construct_network(int H, int W, int K){
n=H;
m=W;
k=K;
if(n==1){
int aux=k;
for(int j=0; j<m; j++){
if(aux>=m)break;
q.pb(j);
q.pb(aux);
s.pb(add_and(q));
q.pop_back();
q.pop_back();
aux++;
}
}
else{
int aux=k;
for(int i=0; i<n; i++){
if(aux>=n)break;
q.pb(i);
q.pb(aux);
s.pb(add_and(q));
q.pop_back();
q.pop_back();
aux++;
}
}
add_or(s);
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... |