답안 #1019158

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019158	2024-07-10T14:22:44 Z	amine_aroua	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1000 ms	26580 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;
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n , m;
    cin>>n>>m;
    int sz = (int)sqrt(n);
    vector<vector<int>> p(n);
    vector<vector<int>> dist(n , vector<int>(sz +1 , INT32_MAX));
    vector<vector<bool>> vis(n , vector<bool>(sz + 1 , 0));
    priority_queue<tuple<int ,int , int>, vector<tuple<int ,int , int>> , greater<tuple<int,int ,int>>> q;
    int trg = 0;
    for(int i = 0 ; i < m; i++)
    {
        int a , b;
        cin>>a>>b;
        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;
        vector<int> all = p[tp];
        all.push_back(last);
        for(auto P : all)
        {
            if(P == 0)
                continue;
            if(P > sz)
            {
                for(int k = 1 ; tp + k * P < n ; k++)
                {
                    if(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});
                    }
                }
                for(int k = 1 ; tp - k * P >= 0 ; k++)
                {
                    if(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});
                    }
                }
            }
        }
    }
    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	344 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	348 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 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	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	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	1 ms	860 KB	Output is correct
19	Correct	1 ms	860 KB	Output is correct
20	Correct	1 ms	1116 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	860 KB	Output is correct
23	Correct	2 ms	860 KB	Output is correct
24	Correct	2 ms	860 KB	Output is correct
25	Correct	2 ms	860 KB	Output is correct
26	Correct	2 ms	860 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	3 ms	1116 KB	Output is correct
29	Correct	9 ms	1116 KB	Output is correct
30	Correct	3 ms	860 KB	Output is correct
31	Correct	7 ms	1116 KB	Output is correct
32	Correct	3 ms	1116 KB	Output is correct
33	Correct	22 ms	1264 KB	Output is correct
34	Correct	22 ms	1260 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	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	412 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	3 ms	604 KB	Output is correct
18	Correct	1 ms	860 KB	Output is correct
19	Correct	1 ms	860 KB	Output is correct
20	Correct	1 ms	1112 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	860 KB	Output is correct
23	Correct	2 ms	860 KB	Output is correct
24	Correct	3 ms	1096 KB	Output is correct
25	Correct	2 ms	860 KB	Output is correct
26	Correct	2 ms	860 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	3 ms	1112 KB	Output is correct
29	Correct	9 ms	860 KB	Output is correct
30	Correct	3 ms	860 KB	Output is correct
31	Correct	6 ms	1120 KB	Output is correct
32	Correct	3 ms	1112 KB	Output is correct
33	Correct	22 ms	1272 KB	Output is correct
34	Correct	28 ms	1116 KB	Output is correct
35	Correct	27 ms	1116 KB	Output is correct
36	Correct	5 ms	788 KB	Output is correct
37	Correct	41 ms	1112 KB	Output is correct
38	Correct	39 ms	1380 KB	Output is correct
39	Correct	42 ms	1368 KB	Output is correct
40	Correct	40 ms	1372 KB	Output is correct
41	Correct	37 ms	1368 KB	Output is correct
42	Correct	5 ms	1368 KB	Output is correct
43	Correct	5 ms	1428 KB	Output is correct
44	Correct	4 ms	1372 KB	Output is correct
45	Correct	114 ms	1448 KB	Output is correct
46	Correct	115 ms	1368 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 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	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	1 ms	856 KB	Output is correct
19	Correct	1 ms	860 KB	Output is correct
20	Correct	1 ms	1116 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	860 KB	Output is correct
23	Correct	1 ms	860 KB	Output is correct
24	Correct	3 ms	860 KB	Output is correct
25	Correct	2 ms	860 KB	Output is correct
26	Correct	2 ms	860 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	3 ms	1116 KB	Output is correct
29	Correct	9 ms	1112 KB	Output is correct
30	Correct	3 ms	860 KB	Output is correct
31	Correct	6 ms	1112 KB	Output is correct
32	Correct	3 ms	1116 KB	Output is correct
33	Correct	22 ms	1268 KB	Output is correct
34	Correct	22 ms	1256 KB	Output is correct
35	Correct	23 ms	952 KB	Output is correct
36	Correct	3 ms	604 KB	Output is correct
37	Correct	41 ms	1320 KB	Output is correct
38	Correct	37 ms	1244 KB	Output is correct
39	Correct	38 ms	1368 KB	Output is correct
40	Correct	37 ms	1368 KB	Output is correct
41	Correct	42 ms	1372 KB	Output is correct
42	Correct	5 ms	1368 KB	Output is correct
43	Correct	5 ms	1372 KB	Output is correct
44	Correct	4 ms	1372 KB	Output is correct
45	Correct	123 ms	1444 KB	Output is correct
46	Correct	114 ms	1448 KB	Output is correct
47	Correct	175 ms	8276 KB	Output is correct
48	Correct	15 ms	17752 KB	Output is correct
49	Correct	14 ms	20060 KB	Output is correct
50	Correct	15 ms	22872 KB	Output is correct
51	Correct	70 ms	25688 KB	Output is correct
52	Correct	78 ms	25596 KB	Output is correct
53	Correct	26 ms	25180 KB	Output is correct
54	Correct	15 ms	24412 KB	Output is correct
55	Correct	15 ms	24560 KB	Output is correct
56	Correct	21 ms	25516 KB	Output is correct
57	Correct	96 ms	24728 KB	Output is correct
58	Correct	28 ms	24988 KB	Output is correct
59	Correct	25 ms	24924 KB	Output is correct
60	Correct	33 ms	25064 KB	Output is correct
61	Correct	28 ms	24924 KB	Output is correct
62	Correct	67 ms	25436 KB	Output is correct
63	Correct	59 ms	26580 KB	Output is correct
64	Correct	62 ms	26324 KB	Output is correct
65	Execution timed out	1002 ms	26396 KB	Time limit exceeded
66	Halted	0 ms	0 KB	-

답안 #1019158

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