답안 #25700 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
25700	2017-06-23T15:30:34 Z	gabrielsimoes	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	153 ms	8400 KB

skyscraper

#include <cstdio>
#include <vector>
#include <queue>
#include <tuple>
#include <algorithm>
#include <limits>
using namespace std;

vector<int> ps[30000];
int dis[30000];

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    int s, t;
    for(int i = 0; i < m; i++) {
        int b, p;
        scanf("%d %d", &b, &p);
        ps[b].push_back(p);
        if(i == 0)
            s = b;
        else if(i == 1)
            t = b;
    }
    for(int i = 0; i < n; i++) {
        vector<int>& v = ps[i];
        sort(v.begin(), v.end());
        v.erase(unique(v.begin(), v.end()), v.end());
    }

    fill_n(dis, n, numeric_limits<int>::max());
    dis[s] = 0;

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push({0, s});
    while(!pq.empty()) {
        int cost, where;
        tie(cost, where) = pq.top();
        pq.pop();

#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
        if(where == t) {
#pragma GCC diagnostic pop
            printf("%d\n", cost);
            return 0;
        }
        if(dis[where] < cost)
            continue;

        for(int p : ps[where]) {
            for(int i = 1; where + i * p < n; i++) {
                if(dis[where + i * p] > cost + i)
                    pq.push({dis[where + i * p] = cost + i, where + i * p});
                if(binary_search(ps[where + i * p].begin(), ps[where + i * p].end(), p))
                    break;
            }
            for(int i = 1; where - i * p >= 0; i++) {
                if(dis[where - i * p] > cost + i)
                    pq.push({dis[where - i * p] = cost + i, where - i * p});
                if(binary_search(ps[where - i * p].begin(), ps[where - i * p].end(), p))
                    break;
            }
        }
    }

    puts("-1");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:14:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
                           ^
skyscraper.cpp:18:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &b, &p);
                               ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

#	결과	메모리	Grader output
1	Correct	1996 KB	Output is correct
2	Correct	1996 KB	Output is correct
3	Correct	1996 KB	Output is correct
4	Correct	1996 KB	Output is correct
5	Correct	1996 KB	Output is correct
6	Correct	1996 KB	Output is correct
7	Correct	1996 KB	Output is correct
8	Correct	1996 KB	Output is correct
9	Correct	1996 KB	Output is correct
10	Correct	1996 KB	Output is correct
11	Correct	1996 KB	Output is correct
12	Correct	1996 KB	Output is correct
13	Correct	1996 KB	Output is correct
14	Correct	1996 KB	Output is correct
15	Correct	1996 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1996 KB	Output is correct
2	Correct	0 ms	1996 KB	Output is correct
3	Correct	0 ms	1996 KB	Output is correct
4	Correct	0 ms	1996 KB	Output is correct
5	Correct	0 ms	1996 KB	Output is correct
6	Correct	0 ms	1996 KB	Output is correct
7	Correct	0 ms	1996 KB	Output is correct
8	Correct	0 ms	1996 KB	Output is correct
9	Correct	0 ms	1996 KB	Output is correct
10	Correct	0 ms	1996 KB	Output is correct
11	Correct	0 ms	1996 KB	Output is correct
12	Correct	0 ms	1996 KB	Output is correct
13	Correct	0 ms	1996 KB	Output is correct
14	Correct	0 ms	1996 KB	Output is correct
15	Correct	0 ms	1996 KB	Output is correct
16	Correct	0 ms	1996 KB	Output is correct
17	Correct	0 ms	2128 KB	Output is correct
18	Correct	0 ms	1996 KB	Output is correct
19	Correct	0 ms	1996 KB	Output is correct
20	Correct	0 ms	2128 KB	Output is correct
21	Correct	0 ms	1996 KB	Output is correct
22	Correct	0 ms	1996 KB	Output is correct
23	Correct	0 ms	1996 KB	Output is correct
24	Correct	0 ms	2140 KB	Output is correct
25	Correct	0 ms	2128 KB	Output is correct
26	Correct	0 ms	1996 KB	Output is correct
27	Correct	0 ms	1996 KB	Output is correct
28	Correct	0 ms	2128 KB	Output is correct
29	Correct	3 ms	2276 KB	Output is correct
30	Correct	0 ms	2140 KB	Output is correct
31	Correct	0 ms	2140 KB	Output is correct
32	Correct	0 ms	2144 KB	Output is correct
33	Correct	3 ms	2480 KB	Output is correct
34	Correct	3 ms	2480 KB	Output is correct

Subtask #4
21.0 / 21.0

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

Subtask #5
43.0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1996 KB	Output is correct
2	Correct	0 ms	1996 KB	Output is correct
3	Correct	0 ms	1996 KB	Output is correct
4	Correct	0 ms	1996 KB	Output is correct
5	Correct	0 ms	1996 KB	Output is correct
6	Correct	0 ms	1996 KB	Output is correct
7	Correct	0 ms	1996 KB	Output is correct
8	Correct	0 ms	1996 KB	Output is correct
9	Correct	0 ms	1996 KB	Output is correct
10	Correct	0 ms	1996 KB	Output is correct
11	Correct	0 ms	1996 KB	Output is correct
12	Correct	0 ms	1996 KB	Output is correct
13	Correct	0 ms	1996 KB	Output is correct
14	Correct	0 ms	1996 KB	Output is correct
15	Correct	0 ms	1996 KB	Output is correct
16	Correct	0 ms	1996 KB	Output is correct
17	Correct	0 ms	2128 KB	Output is correct
18	Correct	0 ms	1996 KB	Output is correct
19	Correct	0 ms	1996 KB	Output is correct
20	Correct	0 ms	2128 KB	Output is correct
21	Correct	0 ms	1996 KB	Output is correct
22	Correct	0 ms	1996 KB	Output is correct
23	Correct	0 ms	1996 KB	Output is correct
24	Correct	0 ms	2140 KB	Output is correct
25	Correct	0 ms	2128 KB	Output is correct
26	Correct	0 ms	1996 KB	Output is correct
27	Correct	0 ms	1996 KB	Output is correct
28	Correct	0 ms	2128 KB	Output is correct
29	Correct	3 ms	2276 KB	Output is correct
30	Correct	0 ms	2140 KB	Output is correct
31	Correct	0 ms	2140 KB	Output is correct
32	Correct	0 ms	2144 KB	Output is correct
33	Correct	0 ms	2480 KB	Output is correct
34	Correct	3 ms	2480 KB	Output is correct
35	Correct	9 ms	2260 KB	Output is correct
36	Correct	3 ms	2128 KB	Output is correct
37	Correct	6 ms	2260 KB	Output is correct
38	Correct	13 ms	2444 KB	Output is correct
39	Correct	13 ms	2260 KB	Output is correct
40	Correct	6 ms	2260 KB	Output is correct
41	Correct	6 ms	2444 KB	Output is correct
42	Correct	6 ms	2272 KB	Output is correct
43	Correct	13 ms	2272 KB	Output is correct
44	Correct	13 ms	2268 KB	Output is correct
45	Correct	13 ms	2640 KB	Output is correct
46	Correct	9 ms	2648 KB	Output is correct
47	Correct	16 ms	3192 KB	Output is correct
48	Correct	13 ms	2524 KB	Output is correct
49	Correct	16 ms	2524 KB	Output is correct
50	Correct	6 ms	2392 KB	Output is correct
51	Correct	29 ms	3440 KB	Output is correct
52	Correct	29 ms	3444 KB	Output is correct
53	Correct	23 ms	2796 KB	Output is correct
54	Correct	0 ms	2268 KB	Output is correct
55	Correct	0 ms	2268 KB	Output is correct
56	Correct	9 ms	2920 KB	Output is correct
57	Correct	3 ms	2532 KB	Output is correct
58	Correct	6 ms	2336 KB	Output is correct
59	Correct	16 ms	2336 KB	Output is correct
60	Correct	6 ms	2344 KB	Output is correct
61	Correct	9 ms	2352 KB	Output is correct
62	Correct	9 ms	2920 KB	Output is correct
63	Correct	43 ms	5388 KB	Output is correct
64	Correct	49 ms	5348 KB	Output is correct
65	Correct	76 ms	5372 KB	Output is correct
66	Correct	153 ms	8400 KB	Output is correct
67	Correct	86 ms	8400 KB	Output is correct

답안 #25700

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