# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23047 | Bruteforceman | Jakarta Skyscrapers (APIO15_skyscraper) | C++11 | 536 ms | 26680 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;
vector <int> g[30010];
const int magic = 173;
int n;
int table[180][30010];
int p[30010];
int b[30010];
class vertex {
public:
int position;
int power;
vertex (int position, int power) : position (position), power (power) {}
vertex (int position) : position (position) {
power = 0;
}
vertex () {}
int distance() {
return table[power][position];
}
void updateDist(int dist) {
table[power][position] = min(table[power][position], dist);
}
bool good(int dist) {
if(0 > position or position >= n) return false;
if(this -> distance() <= dist) return false;
else {
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... |