Submission #879507

#TimeUsernameProblemLanguageResultExecution timeMemory
879507serifefedartarJakarta Skyscrapers (APIO15_skyscraper)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; #define fast ios::sync_with_stdio(0);cin.tie(0); #define s second #define f first typedef long long ll; const ll MOD = 1e9 + 9; const ll LOGN = 21; const ll MAXN = 3e4 + 100; int B[MAXN], P[MAXN]; bool vis[MAXN]; vector<vector<pair<int,ll>>> graph; vector<int> dist; set<int> places[MAXN]; int main() { int N, M; cin >> N >> M; graph = vector<vector<pair<int,ll>>>(N+1, vector<pair<int,ll>>()); dist = vector<int>(N+1, 1e8); for (int i = 1; i <= M; i++) { cin >> B[i] >> P[i]; B[i]++; places[P[i]].insert(B[i]); } for (int i = 1; i < MAXN; i++) { if (places[i].size() == 0) continue; for (auto u : places[i]) { for (int p = u - i; ; p -= i) { graph[plc].push_back({p, (plc - p) / i}); if (places[i].count(p)) break; } for (int p = u + i; ; p += i) { graph[plc].push_back({p, (p - plc) / i}); if (places[i].count(p)) break; } } } priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>>> pq; pq.push({0, 1}); dist[1] = 0; while (!pq.empty()) { int node = pq.top().s; ll d = pq.top().f; pq.pop(); if (vis[node]) continue; vis[node] = true; for (auto u : graph[node]) { if (dist[u.f] > dist[node] + u.s) { dist[u.f] = dist[node] + u.s; pq.push({dist[u.f], u.f}); } } } cout << (dist[B[2]] >= 1e7 ? -1 : dist[B[2]]) << "\n"; }

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:36:11: error: 'plc' was not declared in this scope
   36 |     graph[plc].push_back({p, (plc - p) / i});
      |           ^~~
skyscraper.cpp:41:11: error: 'plc' was not declared in this scope
   41 |     graph[plc].push_back({p, (p - plc) / i});
      |           ^~~
skyscraper.cpp:54:6: warning: unused variable 'd' [-Wunused-variable]
   54 |   ll d = pq.top().f;
      |      ^