# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1138623 | huydarwin | Jakarta Skyscrapers (APIO15_skyscraper) | C++20 | 51 ms | 65360 KiB |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define ii pii
#define fi first
#define sc second
#define ll long long
#define pll pair<ll,ll>
#define lli pair<ll,int>
#define ill pair<int,ll>
#define inf 2000000000
#define INF inf
#define endl "\n"
#define pb push_back
#define eb emplace_back
#define llinf (ll)1e18
#define LLINF llinf
#define maxn 30005
#define task "jakarta"
using namespace std;
int n,m;
ll b[maxn],p[maxn];
vector<ill> adj[maxn];
ll d[maxn];
void di(){
for(int i=2;i<=m;i++) d[i]=llinf;
set<lli> q;
q.insert({0,1});
while(!q.empty()){
int u=q.begin()->sc;
q.erase(q.begin());
for(auto node: adj[u]){
int v=node.fi; ll w=node.sc;
if(d[v]>d[u]+w){
if(d[v]!=llinf) q.erase({d[v],v});
d[v]=d[u]+w;
q.insert({d[v],v});
}
}
}
}
void sub1(){
for(int i=1;i<=m;i++) for(int j=1;j<=m;j++){
if(i==j) continue;
if(abs(b[i]-b[j])%p[i]==0){
adj[i].eb(j, abs(b[i]-b[j])/p[i]);
}
}
di();
if(d[2]==llinf) cout<<-1<<endl;
else cout<<d[2]<<endl;
}
int main(){
if (fopen(task".inp","r")) {
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
ios::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n>>m;
for(int i=1;i<=m;i++) cin>>b[i]>>p[i];
if(m<=2000) sub1();
else cout<<-1<<endl;
return 0;
}
컴파일 시 표준 에러 (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... |