# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
977080 | 2024-05-07T11:14:38 Z | nnin | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1 ms | 1176 KB |
#include<bits/stdc++.h> using namespace std; #define pii pair<int,int> int N, M, B[30005], P[30005]; vector<pii> adj[30005]; int mindis[30005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>N>>M; for(int i=0;i<M;i++) { cin>>B[i]>>P[i]; for(int j=1;B[i]-(j*P[i])>=0;j++) { adj[B[i]].push_back({B[i]-(j*P[i]), j}); } for(int j=1;B[i]+(j*P[i])<N;j++) { adj[B[i]].push_back({B[i]+(j*P[i]), j}); } } for(int i=0;i<N;i++) mindis[i] = 2e9; priority_queue<pii, vector<pii>, greater<pii>> pq; pq.push({0, 0}); mindis[0] = 0; while(!pq.empty()) { auto [dis, u] = pq.top(); pq.pop(); if(mindis[u]!=dis) continue; for(auto [v, w]:adj[u]) { if(mindis[v]>dis+w) { mindis[v] = dis+w; pq.push({mindis[v], v}); } } } cout<<mindis[1]; } /* 5 3 0 2 1 1 4 1 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1112 KB | Output is correct |
2 | Correct | 1 ms | 1112 KB | Output is correct |
3 | Incorrect | 1 ms | 1116 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1116 KB | Output is correct |
2 | Correct | 1 ms | 1116 KB | Output is correct |
3 | Incorrect | 1 ms | 1176 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1116 KB | Output is correct |
2 | Correct | 1 ms | 1172 KB | Output is correct |
3 | Incorrect | 1 ms | 1116 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1112 KB | Output is correct |
2 | Correct | 1 ms | 1112 KB | Output is correct |
3 | Incorrect | 1 ms | 1116 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1112 KB | Output is correct |
2 | Correct | 1 ms | 1172 KB | Output is correct |
3 | Incorrect | 1 ms | 1116 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |