답안 #14558 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
14558	2015-05-20T00:14:26 Z	dohyun0324	Jakarta Skyscrapers (APIO15_skyscraper)	C++	36 / 100	562 ms	262144 KB

skyscraper

#include<stdio.h>
#include<math.h>
#include<queue>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
bool ch[30010][200];
vector<int>con[30010];
typedef pair<int,int> ppair;
struct data{
    int val,x,y;
    bool operator<(const data&r)const{
        return val>r.val;
    }
}b;
priority_queue<data>q;
int sw,n,m,root,s,pos;
struct data2{
    int x,p;
}a[30010];
int main()
{
    int i,j,val,x,y;
    scanf("%d %d",&n,&m);
    root=sqrt(n);
    for(i=0;i<m;i++){scanf("%d %d",&a[i].x,&a[i].p); con[a[i].x].push_back(a[i].p);}
    b.val=0, b.x=a[0].x, b.y=a[0].p, q.push(b);
    while(1){
        while(q.size())
        {
            if(q.top().y<=root)
            {
                if(ch[q.top().x][q.top().y]){q.pop(); continue;}
                else break;
            }
            x=q.top().x; val=q.top().val; y=q.top().y;
            if(x==a[1].x){printf("%d",val); return 0;}
            q.pop();
            for(i=x+y;i<n;i+=y){
                b.val=val+(i-x)/y; b.x=i; b.y=n; q.push(b);
            }
            for(i=x-y;i>=0;i-=y){
                b.val=val+(x-i)/y; b.x=i; b.y=n; q.push(b);
            }
            if(ch[x][0]) continue;
            for(i=0;i<con[x].size();i++){
                b.val=val; b.x=x; b.y=con[x][i];
                q.push(b);
            }
            ch[x][0]=1;
        }
        if(q.size()==0){sw=1; break;}
        val=q.top().val; x=q.top().x; y=q.top().y; ch[x][y]=1; ch[x][0]=1; q.pop();
        if(x==a[1].x) break;
        for(i=0;i<con[x].size();i++){
            b.val=val; b.x=x; b.y=con[x][i];
            q.push(b);
        }
        if(x+y<n) b.val=val+1, b.x=x+y, b.y=y, q.push(b);
        if(x-y>=0) b.val=val+1, b.x=x-y, b.y=y, q.push(b);
    }
    if(sw) printf("-1");
    else printf("%d",val);
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
0.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	8408 KB	Output is correct
2	Correct	0 ms	8408 KB	Output is correct
3	Correct	0 ms	8408 KB	Output is correct
4	Correct	0 ms	8408 KB	Output is correct
5	Correct	0 ms	8408 KB	Output is correct
6	Correct	0 ms	8408 KB	Output is correct
7	Correct	0 ms	8408 KB	Output is correct
8	Correct	0 ms	8408 KB	Output is correct
9	Correct	0 ms	8408 KB	Output is correct
10	Correct	0 ms	8408 KB	Output is correct
11	Correct	0 ms	8408 KB	Output is correct
12	Correct	0 ms	8408 KB	Output is correct
13	Correct	0 ms	8408 KB	Output is correct
14	Correct	5 ms	8808 KB	Output is correct
15	Correct	1 ms	8808 KB	Output is correct
16	Correct	0 ms	8408 KB	Output is correct
17	Correct	2 ms	8624 KB	Output is correct
18	Correct	0 ms	8408 KB	Output is correct
19	Correct	0 ms	8408 KB	Output is correct
20	Correct	0 ms	8408 KB	Output is correct
21	Correct	0 ms	8408 KB	Output is correct
22	Correct	0 ms	8408 KB	Output is correct
23	Correct	0 ms	8408 KB	Output is correct
24	Correct	0 ms	8544 KB	Output is correct
25	Correct	0 ms	8408 KB	Output is correct
26	Correct	0 ms	8408 KB	Output is correct
27	Correct	0 ms	8408 KB	Output is correct
28	Correct	7 ms	8408 KB	Output is correct
29	Correct	16 ms	8408 KB	Output is correct
30	Correct	4 ms	8408 KB	Output is correct
31	Correct	16 ms	8996 KB	Output is correct
32	Correct	12 ms	9572 KB	Output is correct
33	Correct	372 ms	45292 KB	Output is correct
34	Correct	318 ms	45292 KB	Output is correct
35	Correct	14 ms	10948 KB	Output is correct
36	Correct	3 ms	8408 KB	Output is correct
37	Correct	9 ms	9160 KB	Output is correct
38	Correct	0 ms	9248 KB	Output is correct
39	Correct	0 ms	8540 KB	Output is correct
40	Correct	0 ms	8860 KB	Output is correct
41	Correct	9 ms	9248 KB	Output is correct
42	Correct	3 ms	8540 KB	Output is correct
43	Correct	0 ms	8540 KB	Output is correct
44	Correct	7 ms	9184 KB	Output is correct
45	Memory limit exceeded	562 ms	262144 KB	Memory limit exceeded
46	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	8408 KB	Output is correct
2	Correct	0 ms	8408 KB	Output is correct
3	Correct	0 ms	8408 KB	Output is correct
4	Correct	0 ms	8408 KB	Output is correct
5	Correct	0 ms	8408 KB	Output is correct
6	Correct	0 ms	8408 KB	Output is correct
7	Correct	0 ms	8408 KB	Output is correct
8	Correct	0 ms	8408 KB	Output is correct
9	Correct	1 ms	8408 KB	Output is correct
10	Correct	0 ms	8408 KB	Output is correct
11	Correct	0 ms	8408 KB	Output is correct
12	Correct	0 ms	8408 KB	Output is correct
13	Correct	0 ms	8408 KB	Output is correct
14	Correct	7 ms	8808 KB	Output is correct
15	Correct	0 ms	8808 KB	Output is correct
16	Correct	0 ms	8408 KB	Output is correct
17	Correct	0 ms	8624 KB	Output is correct
18	Correct	0 ms	8408 KB	Output is correct
19	Correct	0 ms	8408 KB	Output is correct
20	Correct	0 ms	8408 KB	Output is correct
21	Correct	0 ms	8408 KB	Output is correct
22	Correct	0 ms	8408 KB	Output is correct
23	Correct	2 ms	8408 KB	Output is correct
24	Correct	0 ms	8544 KB	Output is correct
25	Correct	0 ms	8408 KB	Output is correct
26	Correct	0 ms	8408 KB	Output is correct
27	Correct	0 ms	8408 KB	Output is correct
28	Correct	7 ms	8408 KB	Output is correct
29	Correct	15 ms	8408 KB	Output is correct
30	Correct	4 ms	8408 KB	Output is correct
31	Correct	16 ms	8996 KB	Output is correct
32	Correct	16 ms	9572 KB	Output is correct
33	Correct	371 ms	45292 KB	Output is correct
34	Correct	316 ms	45292 KB	Output is correct
35	Correct	17 ms	10948 KB	Output is correct
36	Correct	0 ms	8408 KB	Output is correct
37	Correct	0 ms	9160 KB	Output is correct
38	Correct	15 ms	9248 KB	Output is correct
39	Correct	11 ms	8540 KB	Output is correct
40	Correct	6 ms	8860 KB	Output is correct
41	Correct	7 ms	9248 KB	Output is correct
42	Correct	0 ms	8540 KB	Output is correct
43	Correct	0 ms	8540 KB	Output is correct
44	Correct	0 ms	9184 KB	Output is correct
45	Memory limit exceeded	558 ms	262144 KB	Memory limit exceeded
46	Halted	0 ms	0 KB	-

답안 #14558

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 0.0 / 21.0

Subtask #5 0.0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
0.0 / 21.0

Subtask #5
0.0 / 43.0