답안 #1019183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019183	2024-07-10T14:54:10 Z	amine_aroua	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	821 ms	41340 KB

skyscraper

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
int sz;
vector<vector<int>> p;
vector<vector<int>> dist;
vector<vector<bool>> vis;
priority_queue<tuple<int ,int , int>, vector<tuple<int ,int , int>> , greater<tuple<int,int ,int>>> q;
vector<bool> reach;
int n ;
void process(int P , int tp , int last)
{
    if(P == 0)
        return;
    if(P > sz)
    {
        for(int k = 1 ; tp + k * P < n || tp - k * P >= 0 ; k++)
        {
            if(k*P + tp < n && reach[k * P + tp] && dist[k * P + tp][0] > dist[tp][last] + k)
            {
                dist[k * P + tp][0] = dist[tp][last] + k;
                q.push({dist[k * P + tp][0] , k * P + tp , 0});
            }
            if(tp - k * P >= 0 && reach[tp - k * P] &&dist[tp - k * P][0] > dist[tp][last] + k)
            {
                dist[tp - k * P][0] = dist[tp][last] + k;
                q.push({dist[tp - k * P][0] , tp - k * P , 0});
            }
        }
    }
    else
    {
        if(P + tp < n)
        {
            if(dist[P + tp][P] > dist[tp][last] + 1)
            {
                dist[P + tp][P] = dist[tp][last] + 1;
                q.push({dist[P + tp][P] , P + tp , P});
            }
        }
        if(tp - P >= 0)
        {
            if(dist[tp - P][P] > dist[tp][last] + 1)
            {
                dist[tp - P][P] = dist[tp][last] + 1;
                q.push({dist[tp - P][P] , tp - P , P});
            }
        }
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int  m;
    cin>>n>>m;
    sz = 300;
    reach.assign(n , 0);
    p = vector<vector<int>> (n);
    dist = vector<vector<int>> (n , vector<int>(sz +1 , INT32_MAX));
    vis = vector<vector<bool>> (n , vector<bool>(sz + 1 , 0));
    int trg = 0;
    for(int i = 0 ; i < m; i++)
    {
        int a , b;
        cin>>a>>b;
        reach[a] = 1;
        if(i == 0)
        {
            dist[a][0] = 0;
            q.push({0 , a , 0});
        }
        if(i == 1)
        {
            trg = a;
        }
        p[a].push_back(b);
    }
    while(!q.empty())
    {
        auto [d , tp , last] = q.top();
        q.pop();
        if(vis[tp][last])
            continue;
        vis[tp][last] = 1;
        for(auto P : p[tp])
        {
            process(P , tp , last);
        }
        process(last , tp , last);
    }
    int mn = INT32_MAX;
    for(int i = 0 ; i <= sz ; i++)
    {
        mn = min(mn , dist[trg][i]);
    }
    cout<<(mn == INT32_MAX ? -1 : mn);
}

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	504 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	360 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	604 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	3 ms	588 KB	Output is correct
15	Correct	2 ms	604 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	3 ms	1372 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	2 ms	2908 KB	Output is correct
20	Correct	2 ms	3164 KB	Output is correct
21	Correct	1 ms	860 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	2 ms	2396 KB	Output is correct
24	Correct	3 ms	2908 KB	Output is correct
25	Correct	2 ms	2908 KB	Output is correct
26	Correct	2 ms	2908 KB	Output is correct
27	Correct	2 ms	2908 KB	Output is correct
28	Correct	3 ms	3160 KB	Output is correct
29	Correct	6 ms	2904 KB	Output is correct
30	Correct	2 ms	2908 KB	Output is correct
31	Correct	4 ms	2904 KB	Output is correct
32	Correct	3 ms	2908 KB	Output is correct
33	Correct	12 ms	3212 KB	Output is correct
34	Correct	12 ms	3164 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	856 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	0 ms	604 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	0 ms	604 KB	Output is correct
17	Correct	3 ms	1372 KB	Output is correct
18	Correct	1 ms	2652 KB	Output is correct
19	Correct	1 ms	2908 KB	Output is correct
20	Correct	2 ms	3164 KB	Output is correct
21	Correct	1 ms	860 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	2 ms	2396 KB	Output is correct
24	Correct	3 ms	3024 KB	Output is correct
25	Correct	2 ms	2908 KB	Output is correct
26	Correct	3 ms	2908 KB	Output is correct
27	Correct	2 ms	2908 KB	Output is correct
28	Correct	2 ms	3164 KB	Output is correct
29	Correct	7 ms	3156 KB	Output is correct
30	Correct	2 ms	2908 KB	Output is correct
31	Correct	4 ms	3136 KB	Output is correct
32	Correct	3 ms	2908 KB	Output is correct
33	Correct	12 ms	3208 KB	Output is correct
34	Correct	12 ms	3216 KB	Output is correct
35	Correct	23 ms	2652 KB	Output is correct
36	Correct	3 ms	1884 KB	Output is correct
37	Correct	35 ms	3452 KB	Output is correct
38	Correct	33 ms	3612 KB	Output is correct
39	Correct	34 ms	3612 KB	Output is correct
40	Correct	33 ms	3608 KB	Output is correct
41	Correct	33 ms	3612 KB	Output is correct
42	Correct	5 ms	3164 KB	Output is correct
43	Correct	4 ms	3164 KB	Output is correct
44	Correct	4 ms	3164 KB	Output is correct
45	Correct	87 ms	4184 KB	Output is correct
46	Correct	103 ms	4184 KB	Output is correct

Subtask #5
43.0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	600 KB	Output is correct
14	Correct	2 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	0 ms	604 KB	Output is correct
17	Correct	3 ms	1372 KB	Output is correct
18	Correct	1 ms	2628 KB	Output is correct
19	Correct	2 ms	2908 KB	Output is correct
20	Correct	2 ms	3164 KB	Output is correct
21	Correct	1 ms	860 KB	Output is correct
22	Correct	1 ms	2652 KB	Output is correct
23	Correct	2 ms	2396 KB	Output is correct
24	Correct	3 ms	2908 KB	Output is correct
25	Correct	2 ms	2908 KB	Output is correct
26	Correct	2 ms	2908 KB	Output is correct
27	Correct	2 ms	2908 KB	Output is correct
28	Correct	2 ms	2908 KB	Output is correct
29	Correct	6 ms	2908 KB	Output is correct
30	Correct	2 ms	2908 KB	Output is correct
31	Correct	4 ms	2908 KB	Output is correct
32	Correct	3 ms	2940 KB	Output is correct
33	Correct	12 ms	3160 KB	Output is correct
34	Correct	12 ms	3160 KB	Output is correct
35	Correct	22 ms	2740 KB	Output is correct
36	Correct	3 ms	1880 KB	Output is correct
37	Correct	35 ms	3420 KB	Output is correct
38	Correct	33 ms	3496 KB	Output is correct
39	Correct	36 ms	3612 KB	Output is correct
40	Correct	35 ms	3608 KB	Output is correct
41	Correct	39 ms	3612 KB	Output is correct
42	Correct	6 ms	3164 KB	Output is correct
43	Correct	4 ms	3164 KB	Output is correct
44	Correct	4 ms	3164 KB	Output is correct
45	Correct	88 ms	4172 KB	Output is correct
46	Correct	86 ms	4184 KB	Output is correct
47	Correct	151 ms	17492 KB	Output is correct
48	Correct	18 ms	31576 KB	Output is correct
49	Correct	20 ms	34396 KB	Output is correct
50	Correct	20 ms	37724 KB	Output is correct
51	Correct	63 ms	40976 KB	Output is correct
52	Correct	79 ms	40984 KB	Output is correct
53	Correct	27 ms	40612 KB	Output is correct
54	Correct	19 ms	40028 KB	Output is correct
55	Correct	19 ms	40100 KB	Output is correct
56	Correct	26 ms	40944 KB	Output is correct
57	Correct	70 ms	40232 KB	Output is correct
58	Correct	30 ms	40284 KB	Output is correct
59	Correct	25 ms	40280 KB	Output is correct
60	Correct	30 ms	40232 KB	Output is correct
61	Correct	26 ms	40284 KB	Output is correct
62	Correct	50 ms	41040 KB	Output is correct
63	Correct	154 ms	40280 KB	Output is correct
64	Correct	254 ms	40284 KB	Output is correct
65	Correct	575 ms	40724 KB	Output is correct
66	Correct	821 ms	41172 KB	Output is correct
67	Correct	814 ms	41340 KB	Output is correct

답안 #1019183

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