답안 #45506 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45506	2018-04-14T19:20:24 Z	dqhungdl	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	592 ms	162532 KB

skyscraper

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

const int lim=1e3;
typedef pair<int,int> ii;
int n,m,S,T,d[30005][1005];
bool Visited[30005],Free[30005][1005];
map<int,int> dd[30005];
map<int,bool> FFree[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++)
    {
        if(g[S][i]<=lim)
            Free[S][g[S][i]]=true;
        else
            FFree[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;
        int w;
        if(v<=lim)
            w=d[u][v];
        else
            w=dd[u][v];
        Q.pop();
        if(u==T)
        {
            cout<<w;
            return 0;
        }
        if(Visited[u]==false)
        {
            Visited[u]=true;
            for(int i=0; i<g[u].size(); i++)
            {
                if(u-g[u][i]>=1)
                {
                    if(g[u][i]<=lim&&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]]=w+1;
                        Q.push(ii(u-g[u][i],g[u][i]));
                    }
                    else
                    if(g[u][i]>lim&&FFree[u-g[u][i]][g[u][i]]==false)
                    {
                        FFree[u-g[u][i]][g[u][i]]=true;
                        dd[u-g[u][i]][g[u][i]]=w+1;
                        Q.push(ii(u-g[u][i],g[u][i]));
                    }
                }
                if(u+g[u][i]<=n)
                {
                    if(g[u][i]<=lim&&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]]=w+1;
                        Q.push(ii(u+g[u][i],g[u][i]));
                    }
                    else
                    if(g[u][i]>lim&&FFree[u+g[u][i]][g[u][i]]==false)
                    {
                        FFree[u+g[u][i]][g[u][i]]=true;
                        dd[u+g[u][i]][g[u][i]]=w+1;
                        Q.push(ii(u+g[u][i],g[u][i]));
                    }
                }
            }
        }
        if(u-v>=1)
        {
            if(v<=lim&&Free[u-v][v]==false)
            {
                Free[u-v][v]=true;
                d[u-v][v]=w+1;
                Q.push(ii(u-v,v));
            }
            else
            if(v>lim&&FFree[u-v][v]==false)
            {
                FFree[u-v][v]=true;
                dd[u-v][v]=w+1;
                Q.push(ii(u-v,v));
            }
        }
        if(u+v<=n)
        {
            if(v<=lim&&Free[u+v][v]==false)
            {
                Free[u+v][v]=true;
                d[u+v][v]=w+1;
                Q.push(ii(u+v,v));
            }
            else
            if(v>lim&&FFree[u+v][v]==false)
            {
                FFree[u+v][v]=true;
                dd[u+v][v]=w+1;
                Q.push(ii(u+v,v));
            }
        }
    }
    cout<<-1;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<g[S].size(); i++)
                  ~^~~~~~~~~~~~
skyscraper.cpp:54: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	4 ms	3832 KB	Output is correct
2	Correct	4 ms	3832 KB	Output is correct
3	Correct	4 ms	4104 KB	Output is correct
4	Correct	5 ms	4104 KB	Output is correct
5	Correct	4 ms	4104 KB	Output is correct
6	Correct	4 ms	4152 KB	Output is correct
7	Correct	4 ms	4176 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	4176 KB	Output is correct
2	Correct	4 ms	4176 KB	Output is correct
3	Correct	4 ms	4176 KB	Output is correct
4	Correct	4 ms	4176 KB	Output is correct
5	Correct	4 ms	4176 KB	Output is correct
6	Correct	4 ms	4176 KB	Output is correct
7	Correct	4 ms	4220 KB	Output is correct
8	Correct	4 ms	4220 KB	Output is correct
9	Correct	5 ms	4348 KB	Output is correct
10	Correct	4 ms	4604 KB	Output is correct
11	Correct	5 ms	4604 KB	Output is correct
12	Correct	5 ms	4604 KB	Output is correct
13	Correct	6 ms	4604 KB	Output is correct
14	Correct	5 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	4 ms	4604 KB	Output is correct
2	Correct	4 ms	4604 KB	Output is correct
3	Correct	5 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	4 ms	4604 KB	Output is correct
7	Correct	4 ms	4604 KB	Output is correct
8	Correct	4 ms	4604 KB	Output is correct
9	Correct	4 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	5 ms	4604 KB	Output is correct
13	Correct	5 ms	4604 KB	Output is correct
14	Correct	5 ms	4604 KB	Output is correct
15	Correct	5 ms	4604 KB	Output is correct
16	Correct	4 ms	4604 KB	Output is correct
17	Correct	8 ms	7804 KB	Output is correct
18	Correct	5 ms	7804 KB	Output is correct
19	Correct	5 ms	7804 KB	Output is correct
20	Correct	12 ms	14076 KB	Output is correct
21	Correct	4 ms	14076 KB	Output is correct
22	Correct	4 ms	14076 KB	Output is correct
23	Correct	10 ms	14076 KB	Output is correct
24	Correct	12 ms	14076 KB	Output is correct
25	Correct	6 ms	14076 KB	Output is correct
26	Correct	11 ms	14076 KB	Output is correct
27	Correct	12 ms	14076 KB	Output is correct
28	Correct	13 ms	14076 KB	Output is correct
29	Correct	14 ms	14076 KB	Output is correct
30	Correct	12 ms	14076 KB	Output is correct
31	Correct	13 ms	14076 KB	Output is correct
32	Correct	13 ms	14076 KB	Output is correct
33	Correct	16 ms	14076 KB	Output is correct
34	Correct	14 ms	14076 KB	Output is correct

Subtask #4
21.0 / 21.0

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

Subtask #5
43.0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	14972 KB	Output is correct
2	Correct	4 ms	14972 KB	Output is correct
3	Correct	5 ms	14972 KB	Output is correct
4	Correct	4 ms	14972 KB	Output is correct
5	Correct	4 ms	14972 KB	Output is correct
6	Correct	4 ms	14972 KB	Output is correct
7	Correct	4 ms	14972 KB	Output is correct
8	Correct	4 ms	14972 KB	Output is correct
9	Correct	4 ms	14972 KB	Output is correct
10	Correct	5 ms	14972 KB	Output is correct
11	Correct	5 ms	14972 KB	Output is correct
12	Correct	5 ms	14972 KB	Output is correct
13	Correct	5 ms	14972 KB	Output is correct
14	Correct	5 ms	14972 KB	Output is correct
15	Correct	5 ms	14972 KB	Output is correct
16	Correct	4 ms	14972 KB	Output is correct
17	Correct	9 ms	14972 KB	Output is correct
18	Correct	5 ms	14972 KB	Output is correct
19	Correct	5 ms	14972 KB	Output is correct
20	Correct	12 ms	14972 KB	Output is correct
21	Correct	5 ms	14972 KB	Output is correct
22	Correct	5 ms	14972 KB	Output is correct
23	Correct	11 ms	14972 KB	Output is correct
24	Correct	13 ms	14972 KB	Output is correct
25	Correct	7 ms	14972 KB	Output is correct
26	Correct	11 ms	14972 KB	Output is correct
27	Correct	12 ms	14972 KB	Output is correct
28	Correct	14 ms	14972 KB	Output is correct
29	Correct	13 ms	14972 KB	Output is correct
30	Correct	13 ms	14972 KB	Output is correct
31	Correct	12 ms	14972 KB	Output is correct
32	Correct	13 ms	14972 KB	Output is correct
33	Correct	20 ms	14972 KB	Output is correct
34	Correct	14 ms	14972 KB	Output is correct
35	Correct	19 ms	14972 KB	Output is correct
36	Correct	9 ms	14972 KB	Output is correct
37	Correct	18 ms	14972 KB	Output is correct
38	Correct	23 ms	14992 KB	Output is correct
39	Correct	13 ms	14992 KB	Output is correct
40	Correct	15 ms	14992 KB	Output is correct
41	Correct	19 ms	14992 KB	Output is correct
42	Correct	17 ms	14992 KB	Output is correct
43	Correct	16 ms	14992 KB	Output is correct
44	Correct	17 ms	14992 KB	Output is correct
45	Correct	37 ms	14992 KB	Output is correct
46	Correct	28 ms	14992 KB	Output is correct
47	Correct	39 ms	33052 KB	Output is correct
48	Correct	12 ms	33052 KB	Output is correct
49	Correct	12 ms	33052 KB	Output is correct
50	Correct	10 ms	33052 KB	Output is correct
51	Correct	70 ms	41468 KB	Output is correct
52	Correct	86 ms	51068 KB	Output is correct
53	Correct	27 ms	51068 KB	Output is correct
54	Correct	75 ms	93820 KB	Output is correct
55	Correct	86 ms	113148 KB	Output is correct
56	Correct	119 ms	152624 KB	Output is correct
57	Correct	7 ms	152624 KB	Output is correct
58	Correct	123 ms	152624 KB	Output is correct
59	Correct	123 ms	152624 KB	Output is correct
60	Correct	120 ms	152624 KB	Output is correct
61	Correct	115 ms	152624 KB	Output is correct
62	Correct	254 ms	162532 KB	Output is correct
63	Correct	452 ms	162532 KB	Output is correct
64	Correct	499 ms	162532 KB	Output is correct
65	Correct	560 ms	162532 KB	Output is correct
66	Correct	592 ms	162532 KB	Output is correct
67	Correct	351 ms	162532 KB	Output is correct

답안 #45506

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 43.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
43.0 / 43.0