제출 #238122

#제출 시각아이디문제언어결과실행 시간메모리
238122HellAngelJakarta Skyscrapers (APIO15_skyscraper)C++14
57 / 100
1083 ms3960 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 50007; int n, m, a[maxn], start[maxn], len[maxn], dist[maxn]; vector<int> pos[maxn]; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; bool Inside(int x) { return (x >= 0 && x < n); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin), freopen("test.out", "w", stdout); cin >> n >> m; fill_n(dist, n, 1e9); for(int i = 1; i <= m; i++) { cin >> start[i] >> len[i]; pos[start[i]].push_back(i); } if(m == 1) { cout << -1; return 0; } dist[start[1]] = 0; pq.emplace(0, start[1]); while(pq.size()) { pair<int, int> p = pq.top(); pq.pop(); if(p.first != dist[p.second]) continue; int u = p.second; if(u == start[2]) { cout << p.first; exit(0); } for(auto j: pos[u]) { for(int i = 1;;i++) { int nxt = u + i * len[j]; bool ok = 0; ok |= Inside(nxt); if(Inside(nxt) && dist[nxt] > dist[u] + i) { dist[nxt] = dist[u] + i; pq.emplace(dist[nxt], nxt); } nxt = u - i * len[j]; ok |= Inside(nxt); if(Inside(nxt) && dist[nxt] > dist[u] + i) { dist[nxt] = dist[u] + i; pq.emplace(dist[nxt], nxt); } if(!ok) break; } } } cout << -1; }

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:20:63: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin), freopen("test.out", "w", stdout);
                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:20:63: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...