oj.uz

Submission #112118

# Submission time Handle Problem Language Result Execution time Memory
112118 2019-05-17T12:46:40 Z Runtime_error_ Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 48 ms 39960 KB 
#include <bits/stdc++.h>
using namespace std;
const int inf=2e3+9;
int n,m;
int building[inf],speed[inf],dis[inf][inf][2];//dis[building][speed]
bool vis[inf][inf][2];
vector<int> dogs[inf];
struct State{

    int B,S;
    bool Pass;
};
deque<State>q;

int main(){

    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
        scanf("%d%d",building+i,speed+i),building[i]++,dogs[building[i]].push_back(i);

    memset(dis,21,sizeof(dis));

    int goal=building[2];

    dis[building[1]][speed[1]][0]=0;
    q.push_front({building[1],speed[1],0});

    while(!q.empty()){
        State cur=q.front();
        q.pop_front();

        if(vis[cur.B][cur.S][cur.Pass])
            continue;
        vis[cur.B][cur.S][cur.Pass]=1;
        if(cur.B==goal)
            printf("%d\n",dis[cur.B][cur.S][cur.Pass]),exit(0);

        if(!cur.Pass){
            dis[cur.B][cur.S][1]=dis[cur.B][cur.S][0];
            q.push_front({cur.B,cur.S,1});

            for(auto o:dogs[cur.B])
                if(dis[ building[o] ][ speed[o] ] [1] >= dis[ cur.B ] [ cur.S ] [cur.Pass] )
                    dis[ building[o] ][ speed[o] ] [1] = dis[ cur.B ] [ cur.S ] [cur.Pass],
                    q.push_front(  {building[o],speed[o],1} );
            continue;
        }

        if(cur.B+cur.S<=n && dis[ cur.B+cur.S ][ cur.S ][0]> dis[cur.B][cur.S][cur.Pass]+1 )
            dis[ cur.B+cur.S ][ cur.S ][0] = dis[cur.B][cur.S][cur.Pass]+1,
            q.push_back({cur.B+cur.S , cur.S , 0});

        if(cur.B - cur.S >=1 && dis[cur.B-cur.S] [ cur.S ][0] > dis[cur.B] [cur.S] [cur.Pass]+1)
            dis[cur.B-cur.S] [ cur.S ][0] = dis[cur.B] [cur.S] [cur.Pass]+1,
            q.push_back({cur.B-cur.S , cur.S , 0});
    }

    printf("-1\n");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:19:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",building+i,speed+i),building[i]++,dogs[building[i]].push_back(i);
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 32000 KB Output is correct
2 Correct 23 ms 32000 KB Output is correct
3 Correct 24 ms 32000 KB Output is correct
4 Correct 27 ms 31992 KB Output is correct
5 Correct 24 ms 32000 KB Output is correct
6 Correct 24 ms 32000 KB Output is correct
7 Correct 26 ms 31992 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 32036 KB Output is correct
2 Correct 23 ms 32000 KB Output is correct
3 Correct 24 ms 31972 KB Output is correct
4 Correct 29 ms 31992 KB Output is correct
5 Correct 25 ms 32000 KB Output is correct
6 Correct 27 ms 32000 KB Output is correct
7 Correct 24 ms 31992 KB Output is correct
8 Correct 23 ms 32068 KB Output is correct
9 Correct 25 ms 32128 KB Output is correct
10 Correct 26 ms 32256 KB Output is correct
11 Correct 24 ms 32000 KB Output is correct
12 Correct 24 ms 32256 KB Output is correct
13 Correct 24 ms 32384 KB Output is correct
14 Correct 25 ms 32376 KB Output is correct
15 Correct 24 ms 32384 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 32120 KB Output is correct
2 Correct 27 ms 32000 KB Output is correct
3 Correct 25 ms 31972 KB Output is correct
4 Correct 29 ms 32000 KB Output is correct
5 Correct 26 ms 32000 KB Output is correct
6 Correct 25 ms 31992 KB Output is correct
7 Correct 28 ms 31992 KB Output is correct
8 Correct 23 ms 32000 KB Output is correct
9 Correct 26 ms 32124 KB Output is correct
10 Correct 27 ms 32256 KB Output is correct
11 Correct 27 ms 32120 KB Output is correct
12 Correct 25 ms 32384 KB Output is correct
13 Correct 25 ms 32384 KB Output is correct
14 Correct 26 ms 32376 KB Output is correct
15 Correct 26 ms 32248 KB Output is correct
16 Correct 24 ms 32000 KB Output is correct
17 Correct 26 ms 33912 KB Output is correct
18 Correct 24 ms 31972 KB Output is correct
19 Correct 24 ms 32120 KB Output is correct
20 Correct 32 ms 39960 KB Output is correct
21 Correct 23 ms 32000 KB Output is correct
22 Correct 24 ms 32068 KB Output is correct
23 Correct 29 ms 37760 KB Output is correct
24 Correct 32 ms 39032 KB Output is correct
25 Correct 28 ms 33572 KB Output is correct
26 Correct 36 ms 38596 KB Output is correct
27 Correct 32 ms 39160 KB Output is correct
28 Correct 35 ms 39944 KB Output is correct
29 Correct 37 ms 39928 KB Output is correct
30 Correct 32 ms 39800 KB Output is correct
31 Correct 34 ms 39928 KB Output is correct
32 Correct 34 ms 39800 KB Output is correct
33 Correct 48 ms 39928 KB Output is correct
34 Correct 44 ms 39928 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31996 KB Output is correct
2 Correct 26 ms 31992 KB Output is correct
3 Correct 20 ms 32000 KB Output is correct
4 Correct 26 ms 32000 KB Output is correct
5 Correct 25 ms 32120 KB Output is correct
6 Correct 26 ms 32120 KB Output is correct
7 Correct 31 ms 32000 KB Output is correct
8 Correct 26 ms 32000 KB Output is correct
9 Correct 33 ms 32124 KB Output is correct
10 Correct 28 ms 32264 KB Output is correct
11 Correct 27 ms 32072 KB Output is correct
12 Correct 45 ms 32376 KB Output is correct
13 Correct 24 ms 32384 KB Output is correct
14 Correct 25 ms 32376 KB Output is correct
15 Correct 24 ms 32376 KB Output is correct
16 Correct 24 ms 32012 KB Output is correct
17 Correct 28 ms 33912 KB Output is correct
18 Correct 24 ms 32000 KB Output is correct
19 Correct 27 ms 32120 KB Output is correct
20 Correct 36 ms 39900 KB Output is correct
21 Correct 24 ms 31992 KB Output is correct
22 Correct 25 ms 32000 KB Output is correct
23 Correct 30 ms 37752 KB Output is correct
24 Correct 32 ms 39040 KB Output is correct
25 Correct 25 ms 33664 KB Output is correct
26 Correct 31 ms 38656 KB Output is correct
27 Correct 31 ms 39104 KB Output is correct
28 Correct 34 ms 39928 KB Output is correct
29 Correct 37 ms 39928 KB Output is correct
30 Correct 31 ms 39808 KB Output is correct
31 Correct 33 ms 39800 KB Output is correct
32 Correct 34 ms 39804 KB Output is correct
33 Correct 42 ms 39928 KB Output is correct
34 Correct 38 ms 39932 KB Output is correct
35 Incorrect 25 ms 32120 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 32000 KB Output is correct
2 Correct 24 ms 32012 KB Output is correct
3 Correct 23 ms 32000 KB Output is correct
4 Correct 23 ms 32000 KB Output is correct
5 Correct 23 ms 32000 KB Output is correct
6 Correct 27 ms 32000 KB Output is correct
7 Correct 26 ms 31992 KB Output is correct
8 Correct 26 ms 32000 KB Output is correct
9 Correct 28 ms 32128 KB Output is correct
10 Correct 26 ms 32256 KB Output is correct
11 Correct 26 ms 32000 KB Output is correct
12 Correct 28 ms 32248 KB Output is correct
13 Correct 24 ms 32440 KB Output is correct
14 Correct 24 ms 32512 KB Output is correct
15 Correct 24 ms 32384 KB Output is correct
16 Correct 23 ms 32000 KB Output is correct
17 Correct 26 ms 33912 KB Output is correct
18 Correct 24 ms 32000 KB Output is correct
19 Correct 24 ms 32128 KB Output is correct
20 Correct 32 ms 39928 KB Output is correct
21 Correct 26 ms 32000 KB Output is correct
22 Correct 23 ms 32000 KB Output is correct
23 Correct 29 ms 37760 KB Output is correct
24 Correct 31 ms 39004 KB Output is correct
25 Correct 28 ms 33532 KB Output is correct
26 Correct 31 ms 38656 KB Output is correct
27 Correct 31 ms 39160 KB Output is correct
28 Correct 41 ms 39880 KB Output is correct
29 Correct 39 ms 39948 KB Output is correct
30 Correct 35 ms 39800 KB Output is correct
31 Correct 38 ms 39800 KB Output is correct
32 Correct 37 ms 39808 KB Output is correct
33 Correct 46 ms 39928 KB Output is correct
34 Correct 37 ms 39936 KB Output is correct
35 Incorrect 27 ms 32120 KB Output isn't correct
36 Halted 0 ms 0 KB -