# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
995496 | Baytoro | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1096 ms | 2444 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
//#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
#define ll long long
const int N=3e4+5;
vector<int> g[N];
bool used[N];
int dist[N];
int n,m;
void solve(){
int n,m;cin>>n>>m;
vector<int> b(m),p(m);
for(int i=0;i<N;i++) dist[i]=1e9;
for(int i=0;i<m;i++){
cin>>b[i]>>p[i];
g[b[i]].pb(p[i]);
}
int node=b[0];
dist[node]=0;
while(!used[b[1]] && node!=-1){
used[node]=1;
for(auto it: g[node]){
for(int j=1;node+j*it<n;j++){
dist[node+j*it]=min(dist[node+j*it],dist[node]+j);
}
for(int j=1;node-j*it>=0;j++){
dist[node-j*it]=min(dist[node-j*it],dist[node]+j);
}
}
node=-1;
for(int i=0;i<n;i++){
if(used[i]) continue;
if(dist[i]==1e9) continue;
if(node==-1 || dist[node]>dist[i]) node=i;
}
}
if(dist[b[1]]==1e9) dist[b[1]]=-1;
cout<<dist[b[1]];
}
signed main(){
//fopn("paint");
int t=1;//cin>>t;
while(t--) solve();
}
Compilation message (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... |