# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569238 | BadPenalty | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 2 ms | 1272 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;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
const int N = 4e4,mod = 1e9+7;
vector<int>adj[N];
int dst[N],vstd[N];
pair<int,int>A[N];
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
for(int i = 0;i<n;i++)
dst[i] = mod;
int st = 0,en = 0;
for(int i = 0;i<m;i++)
{
int x,p;
cin>>A[i].F>>A[i].S;
if(i==1)
{
en = A[i].F;
continue;
}
if(i==0)
st = A[i].F;
}
dst[st] = 0;
for(int i = 0;i<m;i++)
{
if(i==1)continue;
for(int j = A[i].F+A[i].S;j<n;j+=A[i].S)
dst[j] = dst[j-A[i].S]+1;
for(int j = A[i].F-A[i].S;j>=0;j-=A[i].S)
dst[j] = dst[j+A[i].S]+1;
}
cout<<dst[en]<<endl;
return 0;
}
/*
*/
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... |