이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define B begin()
#define E end()
using namespace std;
int a[300010];
int b[300010];
vector<pair<int,int>>v[100100];
int dist(int i,int j)
{
return abs(a[j]-a[i]);
}
int dis[100100];
const int inf=1e17;
signed main()
{
ios_base::sync_with_stdio();
cin.tie(0);
cout.tie(0);
int n,m;
cin>>n>>m;
int ss,ee;
for(int i=1;i<=m;i++)
{
cin>>a[i]>>b[i];
if(i==1)
ss=a[i];
if(i==2)
ee=a[i];
}
for(int i=1;i<=m;i++)
{
for(int j=1;j<=m;j++)
{
if(j==i)
continue;
if( dist(i,j)%b[i]==0 ){
// cout<<" "<<i<<" "<<j<<endl;
v[a[i]].pb({dist(i,j)/b[i],a[j]});
}
}
}
if(ss==ee)
{
cout<<0<<endl;
return 0;
}
for(int i=0;i<=n;i++)
sort(v[i].B,v[i].E);
for(int i=0;i<=n+1;i++)
{
dis[i]=inf;
}
dis[ss]=0;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
q.push({0,ss});
while(!q.empty())
{
// cout<<"D";
pair<int,int>x=q.top();
q.pop();
// cout<<" :::: "<<x.S<<endl;
for(auto i:v[x.S])
{
int ned=x.F+i.F; // cout<<" "<<i.F<<" "<<ned<<endl;
if(ned<dis[i.S])
{
dis[i.S]=ned;
q.push({ned,i.S});
}
}
}
if(dis[ee]<inf)
cout<<dis[ee]<<endl;
else cout<<-1<<endl;
}
컴파일 시 표준 에러 (stderr) 메시지
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:80:18: warning: 'ee' may be used uninitialized in this function [-Wmaybe-uninitialized]
80 | if(dis[ee]<inf)
| ~~~~~~^
skyscraper.cpp:58:16: warning: 'ss' may be used uninitialized in this function [-Wmaybe-uninitialized]
58 | dis[ss]=0;
| ~~~~~~~^~
# | 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... |