oj.uz

Submission #14540

# Submission time Handle Problem Language Result Execution time Memory
14540 2015-05-19T14:03:57 Z dohyun0324 Jakarta Skyscrapers (APIO15_skyscraper) C++
10 / 100
 1 ms 49836 KB 
#include<stdio.h>
#include<math.h>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
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,d[30010][200],s,pos,ch[30010][200];
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=1;i<=n;i++){
        for(j=1;j<=root;j++){
            d[i][j]=2147483647;
        }
    }
    for(i=0;i<m;i++){scanf("%d %d",&a[i].x,&a[i].p); con[a[i].x].push_back(a[i].p);}
    d[a[0].x][a[0].p]=0;
    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;
        if(x+y<=n)
        {
            d[x+y][y]=min(d[x+y][y],val+1);
            b.val=val+1; b.x=x+y; b.y=y; q.push(b);
        }
        if(x-y>=0)
        {
            d[x-y][y]=min(d[x-y][y],val+1);
            b.val=val+1; b.x=x-y; b.y=y; q.push(b);
        }
        for(i=0;x+y<=n && i<con[x+y].size();i++)
        {
            b.val=val+1; b.x=x+y; b.y=con[x+y][i];
            q.push(b);
        }
        for(i=0;x-y>=0 && i<con[x-y].size();i++)
        {
            b.val=val+1; b.x=x-y; b.y=con[x-y][i];
            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 49432 KB Output is correct
2 Correct 0 ms 49432 KB Output is correct
3 Correct 0 ms 49432 KB Output is correct
4 Correct 0 ms 49432 KB Output is correct
5 Correct 0 ms 49432 KB Output is correct
6 Correct 0 ms 49432 KB Output is correct
7 Correct 0 ms 49432 KB Output is correct

Subtask #2
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 49432 KB Output is correct
2 Correct 0 ms 49432 KB Output is correct
3 Correct 0 ms 49432 KB Output is correct
4 Correct 0 ms 49432 KB Output is correct
5 Correct 1 ms 49432 KB Output is correct
6 Correct 0 ms 49432 KB Output is correct
7 Correct 0 ms 49432 KB Output is correct
8 Correct 0 ms 49432 KB Output is correct
9 Correct 0 ms 49432 KB Output is correct
10 Correct 0 ms 49432 KB Output is correct
11 Incorrect 0 ms 49836 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 49432 KB Output is correct
2 Correct 0 ms 49432 KB Output is correct
3 Correct 0 ms 49432 KB Output is correct
4 Correct 0 ms 49432 KB Output is correct
5 Correct 0 ms 49432 KB Output is correct
6 Correct 0 ms 49432 KB Output is correct
7 Correct 0 ms 49432 KB Output is correct
8 Correct 0 ms 49432 KB Output is correct
9 Correct 0 ms 49432 KB Output is correct
10 Correct 0 ms 49432 KB Output is correct
11 Incorrect 0 ms 49836 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 49432 KB Output is correct
2 Correct 0 ms 49432 KB Output is correct
3 Correct 0 ms 49432 KB Output is correct
4 Correct 0 ms 49432 KB Output is correct
5 Correct 0 ms 49432 KB Output is correct
6 Correct 0 ms 49432 KB Output is correct
7 Correct 1 ms 49432 KB Output is correct
8 Correct 0 ms 49432 KB Output is correct
9 Correct 0 ms 49432 KB Output is correct
10 Correct 0 ms 49432 KB Output is correct
11 Incorrect 1 ms 49836 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 49432 KB Output is correct
2 Correct 0 ms 49432 KB Output is correct
3 Correct 0 ms 49432 KB Output is correct
4 Correct 0 ms 49432 KB Output is correct
5 Correct 0 ms 49432 KB Output is correct
6 Correct 0 ms 49432 KB Output is correct
7 Correct 0 ms 49432 KB Output is correct
8 Correct 0 ms 49432 KB Output is correct
9 Correct 0 ms 49432 KB Output is correct
10 Correct 0 ms 49432 KB Output is correct
11 Incorrect 0 ms 49836 KB Output isn't correct
12 Halted 0 ms 0 KB -