이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl "\n"
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin>>n>>m;
int b[m];
int p[m];
//map<pair<int,int>,int> aa;
vector<pair<int,int>> adj[n];
for(int i=0;i<m;i++){
cin>>b[i]>>p[i];
int jj=1;
for(int j=b[i]-p[i];j>=0;j=j-p[i]){
adj[b[i]].pb(mp(j,jj));
jj+=1;
}
jj=1;
for(int j=b[i]+p[i];j<n;j=j+p[i]){
adj[b[i]].pb(mp(j,jj));
jj+=1;
}
}
int dis[n];
for(int i=0;i<n;i++){
dis[i]=-1;
}
dis[b[0]]=0;
priority_queue<pair<int,int>> aaa;
aaa.push(mp(0,b[0]));
while(aaa.size()>0){
pair<int,int> x=aaa.top();
aaa.pop();
for(int j=0;j<adj[x.b].size();j++){
pair<int,int> nn=adj[x.b][j];
if(dis[nn.a]==-1 or dis[nn.a]>dis[x.b]+nn.b){
dis[nn.a]=dis[x.b]+nn.b;
aaa.push(mp(dis[nn.a],nn.a));
}
}
}
if(dis[b[1]]==-1){
cout<<-1<<endl;
return 0;
}
if(b[0]==b[1]){
cout<<0<<endl;
return 0;
}
cout<<dis[b[1]]<<endl;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:46:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0;j<adj[x.b].size();j++){
~^~~~~~~~~~~~~~~~
# | 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... |