| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 847218 | vjudge1 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 869 ms | 3796 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,fma")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define task ""
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define nx freopen (task".inp","r",stdin), freopen (task".out","w",stdout);
#define fi first
#define se second
#define pii pair <int, int>
#define tii tuple <int, int, int>
using namespace std;
const int nmax = 3e5 + 2;
int n, m;
void sub45()
{
vector <vector <int>> jump(n);
vector <pii> doge(m);
for (int b, p, i = 0; i < m; ++i)
{
cin >> b >> p;
jump[b].eb(p);
doge[i] = {b, p};
}
vector <int> d(n, 1e9); //dp theo skyscraper tu 0 -> n - 1
priority_queue <pii, vector <pii>, greater <pii>> q;
vector <bool> vs(n, 0);
d[doge[0].fi] = 0;
q.emplace(0, doge[0].fi);
while(q.size())
{
auto [dist, cur_sky] = q.top();
q.pop();
if (dist > d[cur_sky]) continue;
if (cur_sky == doge[1].fi)
{
cout << dist;
exit(0);
}
if (jump[cur_sky].empty()) continue;
if (vs[cur_sky]) continue;
vs[cur_sky] = 1;
for (auto &P : jump[cur_sky])
{
for (int i = 1; cur_sky + i * P < n; ++i)
{
int right = cur_sky + i * P;
if (d[right] > dist + i)
q.emplace(d[right] = dist + i, right);
}
for (int i = 1; cur_sky - i * P >= 0; ++i)
{
int left = cur_sky - i * P;
if (d[left] > dist + i)
q.emplace(d[left] = dist + i, left);
}
}
}
cout << -1;
exit(0);
}
int main()
{
if (ifstream(task".inp")) nx
fast
cin >> n >> m;
// for (int i = 0; i < m; ++i)
// cin >> b[i] >> p[i], mx = max(mx, p[i]);
// if (checksub123()) sub123();
sub45();
}
컴파일 시 표준 에러 (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... | ||||
