이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
int main(){
cin.sync_with_stdio(false);
ll n,m;
cin>>n>>m;
vi b(m);
vi p(m);
rep(i,0,m) cin>>b[i]>>p[i];
set<tuple<ll,ll> > q; //(jumps,doge);
q.emplace(0,0);
vector<bool> seen(m);
while(q.size()){
ll doge,jumps;
tie(jumps,doge) = *q.begin();
q.erase(q.begin());
if(seen[doge]) continue;
seen[doge] = true;
if(doge==1){
cout<<jumps<<endl;
return 0;
}
rep(i,0,m){
if((b[i]-b[doge])%p[doge]==0&&!seen[i])
q.emplace(jumps+abs(b[i]-b[doge])/p[doge],i);
}
}
cout<<-1<<endl;
}
# | 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... |