# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
405853 | A_D | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 75 ms | 70504 KiB |
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>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
const int N=2e3+100;
vector<int> vec[N];
int vis[N][N];
int dis,st,n;
set<int> stt;
deque<ii> deq;
bool in(int x)
{
return 0<=x && x<n;
}
void fix(int v,int w)
{
if(in(v+w)&&vis[v+w][w]>vis[v][w]+1){
// cout<<5<<endl;
vis[v+w][w]=vis[v][w]+1;
deq.push_back({v+w,w});
}
if(in(v-w)&&vis[v-w][w]>vis[v][w]+1){
// cout<<5<<endl;
vis[v-w][w]=vis[v][w]+1;
deq.push_back({v-w,w});
}
}
int bfs()
Compilation message (stderr)
# | 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... |