oj.uz

답안 #31812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31812 2017-09-09T16:34:58 Z minchurl Jakarta Skyscrapers (APIO15_skyscraper) C++11
57 / 100
 1000 ms 4500 KB 
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#define MAX_N 30005
#define inf 0x3fffffff
using namespace std;
struct emp{
	int b,p,i;
	int next,prev;
	vector<int> list;
	bool operator < (emp d) const{
		if(b==d.b)	return p>d.p;
		return b<d.b;
	}
} arr[MAX_N];
int N,M,S,E;
int hn,heap[MAX_N],hloc[MAX_N],dst[MAX_N],chk[MAX_N];
bool hchk[MAX_N];
void upheap(int x){
	int y;
	while(x>1){
		y=x/2;
		if(dst[heap[x]]>=dst[heap[y]])	return;
		swap(heap[x],heap[y]);
		hloc[heap[x]]=x;
		hloc[heap[y]]=y;
		x=y;
	}
}
void downheap(int x){
	int y;
	while(2*x<=hn){
		y=2*x;
		if(y<hn && dst[heap[y+1]]<=dst[heap[y]])	y++;
		if(dst[heap[x]]<=dst[heap[y]])	return;
		swap(heap[x],heap[y]);
		hloc[heap[x]]=x;
		hloc[heap[y]]=y;
		x=y;
	}
}
int remove(){
	int x;
	x=heap[1];
	heap[1]=heap[hn];
	hloc[heap[1]]=1;
	hn--;
	downheap(1);
	hchk[x]=false;
	if(arr[x].prev!=-1)	arr[arr[x].prev].next=arr[x].next;
	arr[arr[x].next].prev=arr[x].prev;
	return x;
}
int dijkstra(){
	int i,x,y,z,maxx=0,sz;
	for(i=0;i<N;i++)	dst[i]=inf;
	dst[S]=0;
	heap[++hn]=S;
	hloc[S]=hn;
	hchk[S]=true;
	while(hn){
		x=remove();
		if(x==E)	break;
		sz=arr[x].list.size();
		for(i=0;i<sz;i++){
			y=arr[x].prev;
			while(y!=-1){
				if((arr[x].b-arr[y].b)%arr[x].list[i]){y=arr[y].prev;continue;}
				z=dst[x]+(abs(arr[x].b-arr[y].b))/arr[x].list[i];
				if(dst[y]>z){
					dst[y]=dst[x]+(abs(arr[x].b-arr[y].b))/arr[x].list[i];
					if(hchk[y]==false){
						heap[++hn]=y;
						hloc[y]=hn;
						hchk[y]=true;
					}
					upheap(hloc[y]);
				}
				y=arr[y].prev;
			}
			y=arr[x].next;
			while(y<N){
				if((arr[x].b-arr[y].b)%arr[x].list[i]){y=arr[y].next;continue;}
				z=dst[x]+(abs(arr[x].b-arr[y].b))/arr[x].list[i];
				if(dst[y]>z){
					dst[y]=dst[x]+(abs(arr[x].b-arr[y].b))/arr[x].list[i];
					if(hchk[y]==false){
						heap[++hn]=y;
						hloc[y]=hn;
						hchk[y]=true;
					}
					upheap(hloc[y]);
				}
				y=arr[y].next;
			}
		}
	}
	if(dst[E]==inf)	return -1;
	return dst[E];
}
int main(){
	int i,x;
	scanf("%d %d",&M,&N);
	for(i=0;i<N;i++){
		scanf("%d %d",&arr[i].b,&arr[i].p);
		arr[i].i=i;
	}
	sort(arr,arr+N);
	x=0;
	arr[x].prev=x-1;
	arr[x].next=x+1;
	arr[x].list.push_back(arr[0].p);
	arr[x++].b=arr[0].b;
	for(i=1;i<N;i++){
		if(arr[x-1].b!=arr[i].b){
			arr[x].prev=x-1;
			arr[x].next=x+1;
			arr[x++].b=arr[i].b;
		}
		arr[x-1].list.push_back(arr[i].p);
		if(arr[i].i==0)	S=x-1;
		if(arr[i].i==1)	E=x-1;
	}
	N=x;
	printf("%d\n",dijkstra());
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int dijkstra()':
skyscraper.cpp:56:14: warning: unused variable 'maxx' [-Wunused-variable]
  int i,x,y,z,maxx=0,sz;
              ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:104:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&M,&N);
                      ^
skyscraper.cpp:106:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&arr[i].b,&arr[i].p);
                                     ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3840 KB Output is correct
2 Correct 0 ms 3840 KB Output is correct
3 Correct 0 ms 3840 KB Output is correct
4 Correct 0 ms 3840 KB Output is correct
5 Correct 0 ms 3840 KB Output is correct
6 Correct 0 ms 3840 KB Output is correct
7 Correct 0 ms 3840 KB Output is correct
8 Correct 0 ms 3840 KB Output is correct
9 Correct 0 ms 3840 KB Output is correct
10 Correct 0 ms 3840 KB Output is correct
11 Correct 0 ms 3840 KB Output is correct
12 Correct 0 ms 3840 KB Output is correct
13 Correct 0 ms 3840 KB Output is correct
14 Correct 0 ms 3840 KB Output is correct
15 Correct 0 ms 3840 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3840 KB Output is correct
2 Correct 0 ms 3840 KB Output is correct
3 Correct 0 ms 3840 KB Output is correct
4 Correct 0 ms 3840 KB Output is correct
5 Correct 0 ms 3840 KB Output is correct
6 Correct 0 ms 3840 KB Output is correct
7 Correct 0 ms 3840 KB Output is correct
8 Correct 0 ms 3840 KB Output is correct
9 Correct 0 ms 3840 KB Output is correct
10 Correct 0 ms 3840 KB Output is correct
11 Correct 0 ms 3840 KB Output is correct
12 Correct 0 ms 3840 KB Output is correct
13 Correct 0 ms 3840 KB Output is correct
14 Correct 0 ms 3840 KB Output is correct
15 Correct 0 ms 3840 KB Output is correct
16 Correct 0 ms 3840 KB Output is correct
17 Correct 6 ms 3840 KB Output is correct
18 Correct 0 ms 3840 KB Output is correct
19 Correct 0 ms 3840 KB Output is correct
20 Correct 19 ms 3972 KB Output is correct
21 Correct 0 ms 3840 KB Output is correct
22 Correct 0 ms 3840 KB Output is correct
23 Correct 3 ms 3840 KB Output is correct
24 Correct 6 ms 3840 KB Output is correct
25 Correct 3 ms 3840 KB Output is correct
26 Correct 0 ms 3840 KB Output is correct
27 Correct 0 ms 3840 KB Output is correct
28 Correct 13 ms 3972 KB Output is correct
29 Correct 0 ms 3840 KB Output is correct
30 Correct 0 ms 3840 KB Output is correct
31 Correct 0 ms 3840 KB Output is correct
32 Correct 0 ms 3840 KB Output is correct
33 Correct 0 ms 3840 KB Output is correct
34 Correct 0 ms 3840 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3840 KB Output is correct
2 Correct 0 ms 3840 KB Output is correct
3 Correct 0 ms 3840 KB Output is correct
4 Correct 0 ms 3840 KB Output is correct
5 Correct 0 ms 3840 KB Output is correct
6 Correct 0 ms 3840 KB Output is correct
7 Correct 0 ms 3840 KB Output is correct
8 Correct 0 ms 3840 KB Output is correct
9 Correct 0 ms 3840 KB Output is correct
10 Correct 0 ms 3840 KB Output is correct
11 Correct 0 ms 3840 KB Output is correct
12 Correct 0 ms 3840 KB Output is correct
13 Correct 0 ms 3840 KB Output is correct
14 Correct 0 ms 3840 KB Output is correct
15 Correct 3 ms 3840 KB Output is correct
16 Correct 0 ms 3840 KB Output is correct
17 Correct 6 ms 3840 KB Output is correct
18 Correct 0 ms 3840 KB Output is correct
19 Correct 0 ms 3840 KB Output is correct
20 Correct 19 ms 3972 KB Output is correct
21 Correct 0 ms 3840 KB Output is correct
22 Correct 0 ms 3840 KB Output is correct
23 Correct 3 ms 3840 KB Output is correct
24 Correct 6 ms 3840 KB Output is correct
25 Correct 3 ms 3840 KB Output is correct
26 Correct 0 ms 3840 KB Output is correct
27 Correct 0 ms 3840 KB Output is correct
28 Correct 13 ms 3972 KB Output is correct
29 Correct 0 ms 3840 KB Output is correct
30 Correct 0 ms 3840 KB Output is correct
31 Correct 0 ms 3840 KB Output is correct
32 Correct 0 ms 3840 KB Output is correct
33 Correct 0 ms 3840 KB Output is correct
34 Correct 0 ms 3840 KB Output is correct
35 Correct 136 ms 3972 KB Output is correct
36 Correct 6 ms 3840 KB Output is correct
37 Correct 39 ms 3972 KB Output is correct
38 Correct 149 ms 4104 KB Output is correct
39 Correct 13 ms 4104 KB Output is correct
40 Correct 46 ms 4104 KB Output is correct
41 Correct 66 ms 4104 KB Output is correct
42 Correct 13 ms 4116 KB Output is correct
43 Correct 13 ms 4112 KB Output is correct
44 Correct 29 ms 4108 KB Output is correct
45 Correct 43 ms 3972 KB Output is correct
46 Correct 39 ms 3972 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3840 KB Output is correct
2 Correct 0 ms 3840 KB Output is correct
3 Correct 0 ms 3840 KB Output is correct
4 Correct 0 ms 3840 KB Output is correct
5 Correct 0 ms 3840 KB Output is correct
6 Correct 0 ms 3840 KB Output is correct
7 Correct 0 ms 3840 KB Output is correct
8 Correct 0 ms 3840 KB Output is correct
9 Correct 0 ms 3840 KB Output is correct
10 Correct 0 ms 3840 KB Output is correct
11 Correct 0 ms 3840 KB Output is correct
12 Correct 0 ms 3840 KB Output is correct
13 Correct 0 ms 3840 KB Output is correct
14 Correct 0 ms 3840 KB Output is correct
15 Correct 0 ms 3840 KB Output is correct
16 Correct 0 ms 3840 KB Output is correct
17 Correct 3 ms 3840 KB Output is correct
18 Correct 0 ms 3840 KB Output is correct
19 Correct 0 ms 3840 KB Output is correct
20 Correct 19 ms 3972 KB Output is correct
21 Correct 0 ms 3840 KB Output is correct
22 Correct 0 ms 3840 KB Output is correct
23 Correct 3 ms 3840 KB Output is correct
24 Correct 6 ms 3840 KB Output is correct
25 Correct 3 ms 3840 KB Output is correct
26 Correct 0 ms 3840 KB Output is correct
27 Correct 0 ms 3840 KB Output is correct
28 Correct 13 ms 3972 KB Output is correct
29 Correct 0 ms 3840 KB Output is correct
30 Correct 0 ms 3840 KB Output is correct
31 Correct 0 ms 3840 KB Output is correct
32 Correct 0 ms 3840 KB Output is correct
33 Correct 0 ms 3840 KB Output is correct
34 Correct 0 ms 3840 KB Output is correct
35 Correct 123 ms 3972 KB Output is correct
36 Correct 6 ms 3840 KB Output is correct
37 Correct 36 ms 3972 KB Output is correct
38 Correct 146 ms 4104 KB Output is correct
39 Correct 16 ms 4104 KB Output is correct
40 Correct 49 ms 4104 KB Output is correct
41 Correct 69 ms 4104 KB Output is correct
42 Correct 6 ms 4116 KB Output is correct
43 Correct 6 ms 4112 KB Output is correct
44 Correct 26 ms 4108 KB Output is correct
45 Correct 49 ms 3972 KB Output is correct
46 Correct 39 ms 3972 KB Output is correct
47 Correct 509 ms 4236 KB Output is correct
48 Correct 9 ms 4368 KB Output is correct
49 Correct 9 ms 4368 KB Output is correct
50 Correct 3 ms 4236 KB Output is correct
51 Execution timed out 1000 ms 4500 KB Execution timed out
52 Halted 0 ms 0 KB -