# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
139242 | abacaba | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 339 ms | 82016 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 inf = 2e9;
const int N = 3e4 + 15;
int n, m, d[N];
vector <pair <int, int> > g[N];
pair <int, int> a[N];
priority_queue <pair <int, int> > q;
unordered_set <int> used[N], is[N];
int main() {
fill(d, d + N, inf);
scanf("%d%d", &n, &m);
for(int i = 0; i < m; ++i) {
scanf("%d%d", &a[i].first, &a[i].second);
is[a[i].first].insert(a[i].second);
}
for(int i = 0; i < m; ++i) {
int b = a[i].first, p = a[i].second;
int cnt = 0;
if(used[b].find(p) != used[b].end())
continue;
used[b].insert(p);
while(b - p >= 0) {
b -= p;
g[a[i].first].push_back({++cnt, b});
if(is[b].find(p) != is[b].end())
break;
}
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... |