# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
248558 | dolphingarlic | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 203 ms | 65536 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 FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
set<int> doges[30000];
vector<pair<int, int>> graph[30000];
int visited[30000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, src, dest;
cin >> n >> m;
FOR(i, 0, m) {
int b, p;
cin >> b >> p;
if (!i) src = b;
if (i == 1) dest = b;
doges[b].insert(p);
}
FOR(i, 0, n) {
for (int j : doges[i]) {
for (int k = i + j, cnt = 1; k < n; k += j, cnt++) {
graph[i].push_back({k, cnt});
if (doges[k].find(j) != doges[k].end()) break;
}
for (int k = i - j, cnt = 1; k >= 0; k -= j, cnt++) {
graph[i].push_back({k, cnt});
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... |