# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
248518 | sahil_k | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 195 ms | 65764 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 <iostream>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <queue>
using namespace std;
/*
int n, m;
set<int> inc[30100];
vector< pair<int, int> > adj[2000000];
int dist[2000000];
bool vis[2000000];
priority_queue< pair<int, int> > ord;
int main () {
cin >> n >> m;
int rt = sqrt(n);
int start, end;
for (int i=0; i<n; i++) {
for (int j=1; j<rt; j++) {
adj[i*rt+j].push_back({i*rt, 0});
if (i-j >= 0) adj[i*rt+j].push_back({(i-j)*rt+j, 1});
if (i+j < n) adj[i*rt+j].push_back({(i+j)*rt+j, 1});
}
}
int bi, pi;
for (int i=0; i<m; i++) {
cin >> bi >> pi;
if (i == 0) start = bi;
if (i == 1) end = bi;
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... |