# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31141 | nibnalin | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1000 ms | 5308 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 <cstdio>
#include <vector>
#include <set>
#include <cmath>
using namespace std;
const int inf = int(1e9)+5, maxn = int(3e4)+5;
int B[maxn], P[maxn], D[maxn][2];
vector<int> doge[maxn];
// 0 => doge
// 1 => skyscraper
int dist(int x, int y)
{
int ret = abs(B[x]-y);
if(ret%P[x] == 0) return ret/P[x];
else return inf;
}
int main(void)
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 0;i < m;i++)
{
scanf("%d%d", &B[i], &P[i]), D[i][0] = inf;
doge[B[i]].push_back(i);
}
for(int i = 0;i < n;i++) D[i][1] = inf;
set<pair<int, pair<int, int>>> Q;
D[0][0] = 0;
Q.insert({0, {0, 0}});
while(!Q.empty())
{
pair<int, pair<int, int>> top = *Q.begin();
Q.erase(Q.begin());
//cout << top.second << "\n";
if(top.second.second)
{
for(auto it: doge[top.second.first])
{
if(top.first < D[it][0])
{
if(D[it][0] != inf) Q.erase({D[it][0], {it, 0}});
D[it][0] = top.first;
Q.insert({D[it][0], {it, 0}});
}
}
}
else
{
for(int i = 0;i < n;i++)
{
int c = dist(top.second.first, i);
if(top.first+c < D[i][1])
{
if(D[i][1] != inf) Q.erase({D[i][1], {i, 1}});
D[i][1] = top.first+c;
Q.insert({D[i][1], {i, 1}});
}
}
}
}
printf("%d\n", (D[1][0] >= inf)?-1:D[1][0]);
}
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... |