oj.uz

Submission #334952

# Submission time Handle Problem Language Result Execution time Memory
334952 2020-12-10T12:43:38 Z Saynaa Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 7 ms 7436 KB 
#include<bits/stdc++.h>
 
using namespace std;
typedef long long ll;
const int MAXN = 3e5 + 2;
int n, m, b[MAXN], p[MAXN], dis[MAXN];
vector< int > adj[MAXN];
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m;
	for(int i = 0; i < m; i ++){
		cin >> b[i] >> p[i];
		adj[b[i]].push_back(p[i]);
	}
	fill(dis, dis + n, INT_MAX/2);
	dis[b[0]] = 0;
	priority_queue< pair< int, int> > q;
	q.push({0, b[0]});
	while( q.size() ){
		int v = q.top().second;
		q.pop();
		if(dis[v] == INT_MAX) break;
		for(int i = 0; i < adj[v].size(); i ++){
			int u = adj[v][i];
			int x = 1;
			for(int i = v + u; i < n; i += u){
				if( dis[i] <= dis[v] + x){
					x ++;
					continue;
				}
				dis[i] = dis[v] + x;
				if( i != b[1]) q.push({-dis[i], i});
				x ++;	
			} 
			x = 1;
			for(int i = v - u; i >= 0; i -= u){
				if( dis[i] <= dis[v] + x){
					x ++;
					continue;
				}
				dis[i] = dis[v] + x;
				if( i != b[1]) q.push({-dis[i], i});
				x ++;
			}
		}
	}
	if( dis[b[1]] != INT_MAX) return printf("%d", dis[b[1]]), 0;
	printf("%d",-1);
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:24:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for(int i = 0; i < adj[v].size(); i ++){
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Incorrect 6 ms 7404 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Incorrect 5 ms 7404 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Incorrect 5 ms 7404 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 7 ms 7404 KB Output is correct
4 Incorrect 5 ms 7404 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7436 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Incorrect 5 ms 7404 KB Output isn't correct
5 Halted 0 ms 0 KB -