oj.uz

Submission #984360

# Submission time Handle Problem Language Result Execution time Memory
984360 2024-05-16T14:39:50 Z Nurislam Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 1000 ms 604 KB 
///*                                                    __                    __                        __                    */
///*        ======     _      /| /|  __   _            /   |  |   /|  |   *  |    |  |  | /   /| |\  | /   |  |  * | /        */
///* \-       ||  |_| |_     / |/ | |  | |_  |-        |   |--|  /-|  |   |  \ \  |==|  |-   /=| | \ | |   |--|  | |-         */
///*          ||  | | |_    /     | |__|  _| |_        \__ |  | /  |  |__ |  __|  |  |  | \ /  | |  \| \__ |  |  | | \        */
///* 
// autor :: Rick Prime
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define Mp make_pair
#define double double long
typedef vector<int> vi;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int N = 1e6, inf = 2e18, mod = 1e9+7;

void solve(){
	int n, m;
	cin >> n >> m;
	vii v(m);
	for(auto &[i, j]:v)cin >> i >> j;
	int dp[n];
	for(int &i:dp)i = inf;
	dp[v[0].ff] = 0;
	for(int i = 0; i < m; i++){
		for(auto [b, p]:v){
			if(dp[b] == inf)continue;
			for(int x = b+p, ct = 1; x < n; x += p, ct++){
				dp[x] = min(dp[x], dp[b] + ct);
			}for(int x = b-p, ct = 1; x >= 0; x -= p, ct++){
				dp[x] = min(dp[x], dp[b] + ct);
			}
		}
	}
	
	cout << (dp[v[1].ff]==inf?-1:dp[v[1].ff]) << '\n';
}
 
signed main(){
	ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	int test = 1;
	//cin >> test;
	while(test--){
		solve();
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 25 ms 480 KB Output is correct
12 Correct 313 ms 348 KB Output is correct
13 Correct 348 ms 472 KB Output is correct
14 Correct 15 ms 344 KB Output is correct
15 Correct 16 ms 348 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 25 ms 500 KB Output is correct
12 Correct 312 ms 472 KB Output is correct
13 Correct 360 ms 476 KB Output is correct
14 Correct 15 ms 348 KB Output is correct
15 Correct 15 ms 504 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 39 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 1095 ms 348 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 25 ms 496 KB Output is correct
12 Correct 316 ms 348 KB Output is correct
13 Correct 342 ms 344 KB Output is correct
14 Correct 16 ms 348 KB Output is correct
15 Correct 16 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 40 ms 476 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 1038 ms 344 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 24 ms 496 KB Output is correct
12 Correct 317 ms 600 KB Output is correct
13 Correct 342 ms 476 KB Output is correct
14 Correct 16 ms 348 KB Output is correct
15 Correct 16 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 40 ms 492 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 1091 ms 348 KB Time limit exceeded
21 Halted 0 ms 0 KB -