oj.uz

답안 #409734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
409734 2021-05-21T12:25:56 Z nicholask Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 1 ms 296 KB 
#include <bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
#define pb push_back
#define rt return
using namespace std;
signed main(){
	int n,m;
	cin>>n>>m;
	vector <pair <int,int> > g[n];
	pair <int,int> a[m];
	for (int i=0; i<m; i++){
		cin>>a[i].x>>a[i].y;
		for (int j=1; a[i].x-a[i].y*j>=0; j++){
			g[a[i].x].pb({a[i].x-a[i].y*j,j});
		}
		for (int j=1; a[i].x+a[i].y*j<n; j++){
			g[a[i].x].pb({a[i].x+a[i].y*j,j});
		}
	}
	priority_queue <pair <int,int>,vector <pair <int,int> >,greater <pair <int,int> > > pq;
	bool visited[n];
	for (int i=0; i<n; i++) visited[i]=0;
	int dist[n];
	for (int i=0; i<n; i++) dist[i]=1e18;
	dist[a[0].x]=0;
	pq.push({a[0].x,0});
	while (!pq.empty()){
		pair <int,int> tp=pq.top();
		pq.pop();
		if (visited[tp.y]) continue;
		visited[tp.y]=1;
		for (auto&i:g[tp.y]){
			if (!visited[i.x]&&tp.x+i.y<dist[i.x]){
				dist[i.x]=tp.x+i.y;
				pq.push({dist[i.x],i.x});
			}
		}
	}
	if (dist[a[1].x]==1e18) cout<<"-1\n";
	else cout<<dist[a[1].x]<<endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -