답안 #45500 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45500	2018-04-14T17:20:34 Z	dqhungdl	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1000 ms	78900 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
int n,m,S,T;
bool Visited[30005];
map<int,int> d[30005];
map<int,bool> Free[30005];
vector<int> g[30005];
queue<ii> Q;

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("TEST.INP","r",stdin);
    cin>>n>>m;
    int pos,step;
    for(int i=1;i<=m;i++)
    {
        cin>>pos>>step;
        g[pos+1].push_back(step);
        if(i==1)
            S=pos+1;
        if(i==2)
            T=pos+1;
    }
    for(int i=0; i<g[S].size(); i++)
    {
        Free[S][g[S][i]]=true;
        Q.push(ii(S,g[S][i]));
    }
    while(Q.size()>0)
    {
        int u=Q.front().first;
        int v=Q.front().second;
        Q.pop();
        if(u==T)
        {
            cout<<d[u][v];
            return 0;
        }
        if(Visited[u]==false)
        {
            Visited[u]=true;
            for(int i=0; i<g[u].size(); i++)
            {
                if(u-g[u][i]>=1&&Free[u-g[u][i]][g[u][i]]==false)
                {
                    Free[u-g[u][i]][g[u][i]]=true;
                    d[u-g[u][i]][g[u][i]]=d[u][v]+1;
                    Q.push(ii(u-g[u][i],g[u][i]));
                }
                if(u+g[u][i]<=n&&Free[u+g[u][i]][g[u][i]]==false)
                {
                    Free[u+g[u][i]][g[u][i]]=true;
                    d[u+g[u][i]][g[u][i]]=d[u][v]+1;
                    Q.push(ii(u+g[u][i],g[u][i]));
                }
            }
        }
        if(u-v>=1&&Free[u-v][v]==false)
        {
            Free[u-v][v]=true;
            d[u-v][v]=d[u][v]+1;
            Q.push(ii(u-v,v));
        }
        if(u+v<=n&&Free[u+v][v]==false)
        {
            Free[u+v][v]=true;
            d[u+v][v]=d[u][v]+1;
            Q.push(ii(u+v,v));
        }
    }
    cout<<-1;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:27:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<g[S].size(); i++)
                  ~^~~~~~~~~~~~
skyscraper.cpp:45:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0; i<g[u].size(); i++)
                          ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	4020 KB	Output is correct
2	Correct	4 ms	4020 KB	Output is correct
3	Correct	4 ms	4068 KB	Output is correct
4	Correct	4 ms	4068 KB	Output is correct
5	Correct	4 ms	4068 KB	Output is correct
6	Correct	5 ms	4076 KB	Output is correct
7	Correct	4 ms	4080 KB	Output is correct
8	Correct	4 ms	4080 KB	Output is correct
9	Correct	4 ms	4092 KB	Output is correct
10	Correct	5 ms	4092 KB	Output is correct
11	Correct	5 ms	4096 KB	Output is correct
12	Correct	5 ms	4096 KB	Output is correct
13	Correct	5 ms	4096 KB	Output is correct
14	Correct	8 ms	4604 KB	Output is correct
15	Correct	6 ms	4604 KB	Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	15420 KB	Output is correct
2	Correct	5 ms	15420 KB	Output is correct
3	Correct	5 ms	15420 KB	Output is correct
4	Correct	5 ms	15420 KB	Output is correct
5	Correct	5 ms	15420 KB	Output is correct
6	Correct	4 ms	15420 KB	Output is correct
7	Correct	5 ms	15420 KB	Output is correct
8	Correct	5 ms	15420 KB	Output is correct
9	Correct	4 ms	15420 KB	Output is correct
10	Correct	5 ms	15420 KB	Output is correct
11	Correct	5 ms	15420 KB	Output is correct
12	Correct	5 ms	15420 KB	Output is correct
13	Correct	5 ms	15420 KB	Output is correct
14	Correct	8 ms	15420 KB	Output is correct
15	Correct	7 ms	15420 KB	Output is correct
16	Correct	5 ms	15420 KB	Output is correct
17	Correct	7 ms	15420 KB	Output is correct
18	Correct	5 ms	15420 KB	Output is correct
19	Correct	5 ms	15420 KB	Output is correct
20	Correct	5 ms	15420 KB	Output is correct
21	Correct	5 ms	15420 KB	Output is correct
22	Correct	5 ms	15420 KB	Output is correct
23	Correct	7 ms	15420 KB	Output is correct
24	Correct	8 ms	15420 KB	Output is correct
25	Correct	5 ms	15420 KB	Output is correct
26	Correct	5 ms	15420 KB	Output is correct
27	Correct	6 ms	15420 KB	Output is correct
28	Correct	14 ms	15420 KB	Output is correct
29	Correct	51 ms	15420 KB	Output is correct
30	Correct	11 ms	15420 KB	Output is correct
31	Correct	23 ms	15420 KB	Output is correct
32	Correct	15 ms	15420 KB	Output is correct
33	Correct	120 ms	15420 KB	Output is correct
34	Correct	54 ms	15420 KB	Output is correct
35	Correct	29 ms	15420 KB	Output is correct
36	Correct	6 ms	15420 KB	Output is correct
37	Correct	19 ms	15420 KB	Output is correct
38	Correct	29 ms	15420 KB	Output is correct
39	Correct	13 ms	15420 KB	Output is correct
40	Correct	13 ms	15420 KB	Output is correct
41	Correct	15 ms	15420 KB	Output is correct
42	Correct	11 ms	15420 KB	Output is correct
43	Correct	11 ms	15420 KB	Output is correct
44	Correct	12 ms	15420 KB	Output is correct
45	Correct	733 ms	49532 KB	Output is correct
46	Correct	398 ms	49532 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	49532 KB	Output is correct
2	Correct	4 ms	49532 KB	Output is correct
3	Correct	4 ms	49532 KB	Output is correct
4	Correct	5 ms	49532 KB	Output is correct
5	Correct	4 ms	49532 KB	Output is correct
6	Correct	5 ms	49532 KB	Output is correct
7	Correct	4 ms	49532 KB	Output is correct
8	Correct	4 ms	49532 KB	Output is correct
9	Correct	5 ms	49532 KB	Output is correct
10	Correct	4 ms	49532 KB	Output is correct
11	Correct	5 ms	49532 KB	Output is correct
12	Correct	5 ms	49532 KB	Output is correct
13	Correct	5 ms	49532 KB	Output is correct
14	Correct	8 ms	49532 KB	Output is correct
15	Correct	6 ms	49532 KB	Output is correct
16	Correct	5 ms	49532 KB	Output is correct
17	Correct	7 ms	49532 KB	Output is correct
18	Correct	5 ms	49532 KB	Output is correct
19	Correct	5 ms	49532 KB	Output is correct
20	Correct	7 ms	49532 KB	Output is correct
21	Correct	6 ms	49532 KB	Output is correct
22	Correct	5 ms	49532 KB	Output is correct
23	Correct	8 ms	49532 KB	Output is correct
24	Correct	10 ms	49532 KB	Output is correct
25	Correct	5 ms	49532 KB	Output is correct
26	Correct	5 ms	49532 KB	Output is correct
27	Correct	6 ms	49532 KB	Output is correct
28	Correct	19 ms	49532 KB	Output is correct
29	Correct	51 ms	49532 KB	Output is correct
30	Correct	11 ms	49532 KB	Output is correct
31	Correct	23 ms	49532 KB	Output is correct
32	Correct	16 ms	49532 KB	Output is correct
33	Correct	132 ms	49532 KB	Output is correct
34	Correct	55 ms	49532 KB	Output is correct
35	Correct	28 ms	49532 KB	Output is correct
36	Correct	6 ms	49532 KB	Output is correct
37	Correct	20 ms	49532 KB	Output is correct
38	Correct	28 ms	49532 KB	Output is correct
39	Correct	12 ms	49532 KB	Output is correct
40	Correct	13 ms	49532 KB	Output is correct
41	Correct	14 ms	49532 KB	Output is correct
42	Correct	10 ms	49532 KB	Output is correct
43	Correct	11 ms	49532 KB	Output is correct
44	Correct	11 ms	49532 KB	Output is correct
45	Correct	729 ms	49532 KB	Output is correct
46	Correct	391 ms	49532 KB	Output is correct
47	Correct	18 ms	49532 KB	Output is correct
48	Correct	19 ms	49532 KB	Output is correct
49	Correct	13 ms	49532 KB	Output is correct
50	Correct	10 ms	49532 KB	Output is correct
51	Correct	43 ms	49532 KB	Output is correct
52	Correct	58 ms	49532 KB	Output is correct
53	Correct	18 ms	49532 KB	Output is correct
54	Correct	8 ms	49532 KB	Output is correct
55	Correct	11 ms	49532 KB	Output is correct
56	Correct	24 ms	49532 KB	Output is correct
57	Correct	6 ms	49532 KB	Output is correct
58	Correct	31 ms	49532 KB	Output is correct
59	Correct	27 ms	49532 KB	Output is correct
60	Correct	26 ms	49532 KB	Output is correct
61	Correct	27 ms	49532 KB	Output is correct
62	Correct	635 ms	49532 KB	Output is correct
63	Execution timed out	1092 ms	78900 KB	Time limit exceeded
64	Halted	0 ms	0 KB	-

답안 #45500

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0