oj.uz

Submission #14548

# Submission time Handle Problem Language Result Execution time Memory
14548 2015-05-19T14:54:18 Z dohyun0324 Jakarta Skyscrapers (APIO15_skyscraper) C++
36 / 100
 1000 ms 22700 KB 
#include<stdio.h>
#include<math.h>
#include<queue>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
map<int,int>ch[30010];
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() && ch[q.top().x][q.top().y]) q.pop();
        if(q.size()==0){sw=1; break;}
        val=q.top().val; x=q.top().x; y=q.top().y; ch[x][y]=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(y<=root){
            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);
        }
        else{
            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(sw) printf("-1");
    else printf("%d",val);
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3952 KB Output is correct
2 Correct 0 ms 3952 KB Output is correct
3 Correct 0 ms 3952 KB Output is correct
4 Correct 0 ms 3952 KB Output is correct
5 Correct 1 ms 3952 KB Output is correct
6 Correct 0 ms 3952 KB Output is correct
7 Correct 2 ms 3952 KB Output is correct
8 Correct 0 ms 3952 KB Output is correct
9 Correct 0 ms 3952 KB Output is correct
10 Correct 1 ms 3952 KB Output is correct
11 Correct 0 ms 3952 KB Output is correct
12 Correct 2 ms 3952 KB Output is correct
13 Correct 2 ms 3952 KB Output is correct
14 Correct 18 ms 4160 KB Output is correct
15 Correct 15 ms 4160 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3952 KB Output is correct
2 Correct 0 ms 3952 KB Output is correct
3 Correct 0 ms 3952 KB Output is correct
4 Correct 0 ms 3952 KB Output is correct
5 Correct 0 ms 3952 KB Output is correct
6 Correct 0 ms 3952 KB Output is correct
7 Correct 0 ms 3952 KB Output is correct
8 Correct 0 ms 3952 KB Output is correct
9 Correct 0 ms 3952 KB Output is correct
10 Correct 0 ms 3952 KB Output is correct
11 Correct 0 ms 3952 KB Output is correct
12 Correct 0 ms 3952 KB Output is correct
13 Correct 2 ms 3952 KB Output is correct
14 Correct 18 ms 4160 KB Output is correct
15 Correct 15 ms 4160 KB Output is correct
16 Correct 0 ms 3952 KB Output is correct
17 Correct 3 ms 4088 KB Output is correct
18 Correct 2 ms 3952 KB Output is correct
19 Correct 0 ms 3952 KB Output is correct
20 Correct 0 ms 4084 KB Output is correct
21 Correct 0 ms 3952 KB Output is correct
22 Correct 1 ms 3952 KB Output is correct
23 Correct 0 ms 4084 KB Output is correct
24 Correct 4 ms 4084 KB Output is correct
25 Correct 0 ms 3952 KB Output is correct
26 Correct 0 ms 4084 KB Output is correct
27 Correct 2 ms 4084 KB Output is correct
28 Correct 6 ms 4612 KB Output is correct
29 Correct 38 ms 6768 KB Output is correct
30 Correct 5 ms 4744 KB Output is correct
31 Correct 19 ms 5536 KB Output is correct
32 Correct 8 ms 4680 KB Output is correct
33 Correct 88 ms 8576 KB Output is correct
34 Correct 50 ms 6196 KB Output is correct

Subtask #4
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3952 KB Output is correct
2 Correct 0 ms 3952 KB Output is correct
3 Correct 0 ms 3952 KB Output is correct
4 Correct 0 ms 3952 KB Output is correct
5 Correct 0 ms 3952 KB Output is correct
6 Correct 0 ms 3952 KB Output is correct
7 Correct 0 ms 3952 KB Output is correct
8 Correct 0 ms 3952 KB Output is correct
9 Correct 0 ms 3952 KB Output is correct
10 Correct 0 ms 3952 KB Output is correct
11 Correct 1 ms 3952 KB Output is correct
12 Correct 2 ms 3952 KB Output is correct
13 Correct 2 ms 3952 KB Output is correct
14 Correct 17 ms 4160 KB Output is correct
15 Correct 12 ms 4160 KB Output is correct
16 Correct 0 ms 3952 KB Output is correct
17 Correct 0 ms 4088 KB Output is correct
18 Correct 0 ms 3952 KB Output is correct
19 Correct 0 ms 3952 KB Output is correct
20 Correct 2 ms 4084 KB Output is correct
21 Correct 1 ms 3952 KB Output is correct
22 Correct 0 ms 3952 KB Output is correct
23 Correct 0 ms 4084 KB Output is correct
24 Correct 0 ms 4084 KB Output is correct
25 Correct 0 ms 3952 KB Output is correct
26 Correct 0 ms 4084 KB Output is correct
27 Correct 0 ms 4084 KB Output is correct
28 Correct 3 ms 4612 KB Output is correct
29 Correct 39 ms 6768 KB Output is correct
30 Correct 5 ms 4744 KB Output is correct
31 Correct 16 ms 5536 KB Output is correct
32 Correct 10 ms 4680 KB Output is correct
33 Correct 83 ms 8576 KB Output is correct
34 Correct 52 ms 6196 KB Output is correct
35 Correct 82 ms 5824 KB Output is correct
36 Correct 0 ms 3952 KB Output is correct
37 Correct 40 ms 6844 KB Output is correct
38 Correct 32 ms 4792 KB Output is correct
39 Correct 13 ms 4216 KB Output is correct
40 Correct 13 ms 4216 KB Output is correct
41 Correct 43 ms 5512 KB Output is correct
42 Correct 0 ms 4216 KB Output is correct
43 Correct 9 ms 4216 KB Output is correct
44 Correct 13 ms 4820 KB Output is correct
45 Execution timed out 1000 ms 22700 KB Program timed out
46 Halted 0 ms 0 KB -

Subtask #5
0.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3952 KB Output is correct
2 Correct 0 ms 3952 KB Output is correct
3 Correct 0 ms 3952 KB Output is correct
4 Correct 0 ms 3952 KB Output is correct
5 Correct 0 ms 3952 KB Output is correct
6 Correct 0 ms 3952 KB Output is correct
7 Correct 0 ms 3952 KB Output is correct
8 Correct 0 ms 3952 KB Output is correct
9 Correct 0 ms 3952 KB Output is correct
10 Correct 0 ms 3952 KB Output is correct
11 Correct 0 ms 3952 KB Output is correct
12 Correct 2 ms 3952 KB Output is correct
13 Correct 0 ms 3952 KB Output is correct
14 Correct 14 ms 4160 KB Output is correct
15 Correct 15 ms 4160 KB Output is correct
16 Correct 0 ms 3952 KB Output is correct
17 Correct 0 ms 4088 KB Output is correct
18 Correct 0 ms 3952 KB Output is correct
19 Correct 0 ms 3952 KB Output is correct
20 Correct 0 ms 4084 KB Output is correct
21 Correct 0 ms 3952 KB Output is correct
22 Correct 0 ms 3952 KB Output is correct
23 Correct 0 ms 4084 KB Output is correct
24 Correct 2 ms 4084 KB Output is correct
25 Correct 0 ms 3952 KB Output is correct
26 Correct 0 ms 4084 KB Output is correct
27 Correct 2 ms 4084 KB Output is correct
28 Correct 5 ms 4612 KB Output is correct
29 Correct 35 ms 6768 KB Output is correct
30 Correct 5 ms 4744 KB Output is correct
31 Correct 20 ms 5536 KB Output is correct
32 Correct 8 ms 4680 KB Output is correct
33 Correct 80 ms 8576 KB Output is correct
34 Correct 52 ms 6196 KB Output is correct
35 Correct 73 ms 5824 KB Output is correct
36 Correct 2 ms 3952 KB Output is correct
37 Correct 42 ms 6844 KB Output is correct
38 Correct 32 ms 4792 KB Output is correct
39 Correct 12 ms 4216 KB Output is correct
40 Correct 11 ms 4216 KB Output is correct
41 Correct 42 ms 5512 KB Output is correct
42 Correct 3 ms 4216 KB Output is correct
43 Correct 6 ms 4216 KB Output is correct
44 Correct 0 ms 4820 KB Output is correct
45 Execution timed out 1000 ms 22700 KB Program timed out
46 Halted 0 ms 0 KB -