# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110199 | SamAnd | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 857 ms | 226132 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>
using namespace std;
const int N = 30004;
struct ban
{
int x, p;
int d;
ban(){}
ban(int x, int p, int d)
{
this->x = x;
this->p = p;
this->d = d;
}
};
int n, m;
int b[N], p[N];
vector<int> a[N];
bool c[N][N];
int bfs()
{
queue<ban> q;
for (int i = 0; i < a[b[0]].size(); ++i)
{
if (!c[b[0]][a[b[0]][i]])
{
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... |