/* made by amunduzbaev */
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define tut(x) array<int, x>
//#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b? a = b, true:false; }
template<class T> bool umax(T& a, const T& b) { return a < b? a = b, true:false; }
//void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
//freopen((s+".out").c_str(),"w",stdout); }
//template<class T> tree<T,
//less<T>, null_type, rb_tree_tag,
//tree_order_statistics_node_update> ordered_set;
const int N = 3e4+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
const int M = 2e3+5;
const int B = 500;
#define MULTI 0
int n, m, K, s, ans, q, res, a[N];
int b[N], p[N], dd[M][M];
vii cnt[N];
void solve(int t_case){
cin>>m>>n;
for(int i=0;i<n;i++) cin>>b[i]>>p[i], cnt[b[i]].pb(i);
memset(dd, 127, sizeof dd);
queue<pii> qq;
res = mod;
for(auto x : cnt[0]) qq.push({0, p[x]}), dd[0][p[x]] = 0;
while(!qq.empty()){
pii cur = qq.front(); qq.pop();
if(cur.ff + cur.ss < m && umin(dd[cur.ff + cur.ss][cur.ss], dd[cur.ff][cur.ss] + 1)) qq.push({cur.ff + cur.ss, cur.ss});
if(cur.ff - cur.ss >= 0 && umin(dd[cur.ff - cur.ss][cur.ss], dd[cur.ff][cur.ss] + 1)) qq.push({cur.ff - cur.ss, cur.ss});
for(auto x : cnt[cur.ff]){
if(cur.ff + p[x] < m && umin(dd[cur.ff + p[x]][p[x]], dd[cur.ff][cur.ss] + 1)) qq.push({cur.ff + p[x], p[x]});
if(cur.ff - p[x] >= 0 && umin(dd[cur.ff - p[x]][p[x]], dd[cur.ff][cur.ss] + 1)) qq.push({cur.ff - p[x], p[x]});
}
}
for(int i=0;i<M;i++) umin(res, dd[b[1]][i]);
if(res != mod) cout<<res<<"\n";
else cout<<-1<<"\n";
}
signed main(){
NeedForSpeed
if(!MULTI) {
solve(1);
} else {
int t; cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
} return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
16716 KB |
Output is correct |
2 |
Correct |
9 ms |
16736 KB |
Output is correct |
3 |
Correct |
9 ms |
16716 KB |
Output is correct |
4 |
Correct |
9 ms |
16716 KB |
Output is correct |
5 |
Correct |
9 ms |
16844 KB |
Output is correct |
6 |
Correct |
10 ms |
16760 KB |
Output is correct |
7 |
Correct |
10 ms |
16716 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
16716 KB |
Output is correct |
2 |
Correct |
10 ms |
16716 KB |
Output is correct |
3 |
Correct |
9 ms |
16760 KB |
Output is correct |
4 |
Correct |
9 ms |
16716 KB |
Output is correct |
5 |
Correct |
9 ms |
16716 KB |
Output is correct |
6 |
Correct |
9 ms |
16764 KB |
Output is correct |
7 |
Correct |
9 ms |
16684 KB |
Output is correct |
8 |
Incorrect |
9 ms |
16760 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
16716 KB |
Output is correct |
2 |
Correct |
9 ms |
16716 KB |
Output is correct |
3 |
Correct |
9 ms |
16760 KB |
Output is correct |
4 |
Correct |
9 ms |
16648 KB |
Output is correct |
5 |
Correct |
9 ms |
16716 KB |
Output is correct |
6 |
Correct |
10 ms |
16716 KB |
Output is correct |
7 |
Correct |
9 ms |
16716 KB |
Output is correct |
8 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
16716 KB |
Output is correct |
2 |
Correct |
8 ms |
16716 KB |
Output is correct |
3 |
Correct |
9 ms |
16716 KB |
Output is correct |
4 |
Correct |
9 ms |
16736 KB |
Output is correct |
5 |
Correct |
9 ms |
16732 KB |
Output is correct |
6 |
Correct |
9 ms |
16764 KB |
Output is correct |
7 |
Correct |
9 ms |
16720 KB |
Output is correct |
8 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
16716 KB |
Output is correct |
2 |
Correct |
9 ms |
16692 KB |
Output is correct |
3 |
Correct |
10 ms |
16716 KB |
Output is correct |
4 |
Correct |
9 ms |
16716 KB |
Output is correct |
5 |
Correct |
9 ms |
16716 KB |
Output is correct |
6 |
Correct |
9 ms |
16716 KB |
Output is correct |
7 |
Correct |
9 ms |
16716 KB |
Output is correct |
8 |
Incorrect |
9 ms |
16716 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |