제출 #695179

#제출 시각아이디문제언어결과실행 시간메모리
695179Farhan_HYJakarta Skyscrapers (APIO15_skyscraper)C++14
0 / 100
18 ms23784 KiB
#include <bits/stdc++.h> #define int long long #define float double #define pb push_back #define F first #define S second #define T int t; cin >> t; while(t--) #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; /// Benzema is the best player in the world const int N = 1e6 + 6; const int M = 1e3 + 3; const int mod = 1e9 + 7; const int inf = 1e18; const int dx[] = {-1, 1, 0, 0}; const int dy[] = {0, 0, -1, 1}; const int LOG = 28; int n, m; int p[N], dist[N]; vector<pair<int, int>> adj[N]; priority_queue<pair<int, int>> q; bool vis[N]; int b[N]; void dij() { for(int i = 1; i <= n; i++) dist[i] = inf; q.push({0, b[1]}); dist[b[1]] = 0; while(!q.empty()) { int u = q.top().S; q.pop(); if (vis[u]) continue; vis[u] = 1; for(auto x: adj[u]) { if (dist[x.F] > dist[u] + x.S) dist[x.F] = dist[u] + x.S, q.push({-dist[x.F], x.F}); } } } main() { IOS cin >> n >> m; for(int i = 1; i <= m; i++) { cin >> b[i] >> p[i]; b[i]++; int j = b[i] - p[i], cnt = 1; while(j >= 1) { adj[j + b[i]].push_back({j, cnt++}); j -= p[i]; } cnt = 1, j = b[i] + p[i]; while(j <= n) { adj[j - p[i]].push_back({j, cnt++}); j += p[i]; } } dij(); if (dist[b[2]] == inf) dist[b[2]] = -1; cout << dist[b[2]]; }

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

skyscraper.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main() {
      | ^~~~
#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...