oj.uz

답안 #791201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791201 2023-07-23T15:14:52 Z ThMinh_ Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 57464 KB 
#include<bits/stdc++.h>
#define forin(i, a, b) for(int i = a; i <= b; ++i)
#define ii pair<int, int>
#define iii pair<int, ii>
using namespace std;
const int N = 3e4 + 10, T = 180;
int n, m, inf;
int b[N], p[N], d[T + 10][N];
vector<int> walk[N];
vector<ii> tele[N];
priority_queue<iii, vector<iii>, greater<iii> > pq;
int main () {
    cin.tie(0)->sync_with_stdio(0);
    if(fopen("Task.inp","r")) {
        freopen("Task.inp","r",stdin);
        freopen("WA.out","w",stdout);
    }
    cin>>n>>m;
    int s = sqrt(n);
    forin(i, 1, m) {
        cin>>b[i]>>p[i];
        if(p[i] > s) {
            int pos = b[i], d = 0;
            do {
                if(d) tele[b[i]].push_back({pos, d});
                pos += p[i];
                d++;
            } while(pos < n);
            pos = b[i]; d = 0;
            do {
                if(d) tele[b[i]].push_back({pos, d});
                pos -= p[i];
                d++;
            } while(pos >= 0);
        }
        else walk[b[i]].push_back(p[i]);
    }
    memset(d, 60, sizeof(d));
    inf = d[0][0];
    d[0][b[1]] = 0;
    pq.push({0, {b[1], 0}});
    while(!pq.empty()) {
        int kc = pq.top().first;
        int u, l; tie(u, l) = pq.top().second;
        pq.pop();
        if(d[l][u] != kc) continue;
        if(l) walk[u].push_back(l);
        for(auto e : tele[u]) {
            int v, w; tie(v, w) = e;
            if(d[0][v] <= kc + w) continue;
            d[0][v] = kc + w;
            pq.push({d[0][v], {v, 0}});
        }
        for(auto w : walk[u]) {
            if(u - w >= 0) {
                if(d[w][u - w] <= kc + 1) continue;
                d[w][u - w] = kc + 1;
                pq.push({d[w][u - w], {u - w, w}});
            }
        }
        for(auto w : walk[u]) {
            if(u + w < n) {
                if(d[w][u + w] <= kc + 1) continue;
                d[w][u + w] = kc + 1;
                pq.push({d[w][u + w], {u + w, w}});
            }
        }
        if(l) walk[u].pop_back();
    }
    int ans = inf;
    forin(i, 0, T) ans = min(ans, d[i][b[2]]);
    if(ans == inf) cout<<-1;
    else cout<<ans;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:15:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         freopen("Task.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:16:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         freopen("WA.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24020 KB Output is correct
2 Correct 9 ms 24016 KB Output is correct
3 Correct 9 ms 24044 KB Output is correct
4 Correct 9 ms 24020 KB Output is correct
5 Correct 9 ms 23960 KB Output is correct
6 Correct 10 ms 24012 KB Output is correct
7 Correct 11 ms 24020 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 24020 KB Output is correct
2 Correct 9 ms 24020 KB Output is correct
3 Correct 9 ms 24052 KB Output is correct
4 Correct 9 ms 24020 KB Output is correct
5 Correct 9 ms 23944 KB Output is correct
6 Correct 9 ms 24008 KB Output is correct
7 Correct 10 ms 24020 KB Output is correct
8 Correct 10 ms 24020 KB Output is correct
9 Correct 10 ms 24012 KB Output is correct
10 Correct 9 ms 24016 KB Output is correct
11 Correct 11 ms 24020 KB Output is correct
12 Correct 10 ms 24016 KB Output is correct
13 Correct 10 ms 24020 KB Output is correct
14 Correct 12 ms 24148 KB Output is correct
15 Correct 10 ms 24152 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23952 KB Output is correct
2 Correct 9 ms 24020 KB Output is correct
3 Correct 10 ms 24020 KB Output is correct
4 Correct 9 ms 24056 KB Output is correct
5 Correct 9 ms 24020 KB Output is correct
6 Correct 9 ms 24020 KB Output is correct
7 Correct 10 ms 23952 KB Output is correct
8 Correct 9 ms 24020 KB Output is correct
9 Correct 9 ms 24020 KB Output is correct
10 Correct 9 ms 24020 KB Output is correct
11 Correct 10 ms 24096 KB Output is correct
12 Correct 9 ms 24020 KB Output is correct
13 Correct 9 ms 24020 KB Output is correct
14 Correct 11 ms 24156 KB Output is correct
15 Correct 9 ms 24148 KB Output is correct
16 Correct 9 ms 24020 KB Output is correct
17 Correct 11 ms 24212 KB Output is correct
18 Correct 9 ms 24020 KB Output is correct
19 Correct 9 ms 24020 KB Output is correct
20 Correct 9 ms 24148 KB Output is correct
21 Correct 10 ms 24020 KB Output is correct
22 Correct 9 ms 24016 KB Output is correct
23 Correct 11 ms 24148 KB Output is correct
24 Correct 13 ms 24212 KB Output is correct
25 Correct 11 ms 24092 KB Output is correct
26 Correct 10 ms 24088 KB Output is correct
27 Correct 10 ms 24148 KB Output is correct
28 Correct 10 ms 24236 KB Output is correct
29 Correct 15 ms 24080 KB Output is correct
30 Correct 12 ms 24136 KB Output is correct
31 Correct 13 ms 24136 KB Output is correct
32 Correct 11 ms 24268 KB Output is correct
33 Correct 20 ms 24788 KB Output is correct
34 Correct 21 ms 24660 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 24016 KB Output is correct
2 Correct 9 ms 24020 KB Output is correct
3 Correct 9 ms 24012 KB Output is correct
4 Correct 10 ms 24012 KB Output is correct
5 Correct 9 ms 24020 KB Output is correct
6 Correct 9 ms 24040 KB Output is correct
7 Correct 10 ms 24024 KB Output is correct
8 Correct 9 ms 24020 KB Output is correct
9 Correct 9 ms 24016 KB Output is correct
10 Correct 10 ms 24020 KB Output is correct
11 Correct 10 ms 24056 KB Output is correct
12 Correct 10 ms 24020 KB Output is correct
13 Correct 9 ms 24028 KB Output is correct
14 Correct 10 ms 24148 KB Output is correct
15 Correct 10 ms 24148 KB Output is correct
16 Correct 9 ms 23992 KB Output is correct
17 Correct 11 ms 24148 KB Output is correct
18 Correct 10 ms 24020 KB Output is correct
19 Correct 9 ms 24020 KB Output is correct
20 Correct 10 ms 24076 KB Output is correct
21 Correct 9 ms 24020 KB Output is correct
22 Correct 9 ms 24020 KB Output is correct
23 Correct 10 ms 24148 KB Output is correct
24 Correct 11 ms 24164 KB Output is correct
25 Correct 12 ms 24148 KB Output is correct
26 Correct 12 ms 24148 KB Output is correct
27 Correct 9 ms 24160 KB Output is correct
28 Correct 11 ms 24160 KB Output is correct
29 Correct 15 ms 24092 KB Output is correct
30 Correct 10 ms 24020 KB Output is correct
31 Correct 13 ms 24144 KB Output is correct
32 Correct 15 ms 24236 KB Output is correct
33 Correct 22 ms 24772 KB Output is correct
34 Correct 21 ms 24736 KB Output is correct
35 Correct 19 ms 25172 KB Output is correct
36 Correct 11 ms 24200 KB Output is correct
37 Correct 26 ms 25728 KB Output is correct
38 Correct 24 ms 25680 KB Output is correct
39 Correct 24 ms 25684 KB Output is correct
40 Correct 23 ms 25772 KB Output is correct
41 Correct 23 ms 25788 KB Output is correct
42 Correct 13 ms 24660 KB Output is correct
43 Correct 12 ms 24660 KB Output is correct
44 Correct 12 ms 24736 KB Output is correct
45 Correct 39 ms 28620 KB Output is correct
46 Correct 42 ms 28664 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 24020 KB Output is correct
2 Correct 9 ms 24020 KB Output is correct
3 Correct 10 ms 23960 KB Output is correct
4 Correct 9 ms 24020 KB Output is correct
5 Correct 9 ms 24020 KB Output is correct
6 Correct 12 ms 24020 KB Output is correct
7 Correct 10 ms 24016 KB Output is correct
8 Correct 10 ms 23932 KB Output is correct
9 Correct 9 ms 24020 KB Output is correct
10 Correct 10 ms 24020 KB Output is correct
11 Correct 9 ms 24020 KB Output is correct
12 Correct 10 ms 24020 KB Output is correct
13 Correct 11 ms 24020 KB Output is correct
14 Correct 9 ms 24156 KB Output is correct
15 Correct 11 ms 24156 KB Output is correct
16 Correct 10 ms 24056 KB Output is correct
17 Correct 13 ms 24148 KB Output is correct
18 Correct 14 ms 24024 KB Output is correct
19 Correct 9 ms 24020 KB Output is correct
20 Correct 10 ms 24148 KB Output is correct
21 Correct 9 ms 24088 KB Output is correct
22 Correct 9 ms 24020 KB Output is correct
23 Correct 10 ms 24092 KB Output is correct
24 Correct 11 ms 24240 KB Output is correct
25 Correct 10 ms 24160 KB Output is correct
26 Correct 10 ms 24148 KB Output is correct
27 Correct 10 ms 24148 KB Output is correct
28 Correct 10 ms 24148 KB Output is correct
29 Correct 15 ms 24124 KB Output is correct
30 Correct 10 ms 24020 KB Output is correct
31 Correct 12 ms 24148 KB Output is correct
32 Correct 10 ms 24268 KB Output is correct
33 Correct 20 ms 24716 KB Output is correct
34 Correct 21 ms 24664 KB Output is correct
35 Correct 18 ms 25116 KB Output is correct
36 Correct 11 ms 24276 KB Output is correct
37 Correct 25 ms 25752 KB Output is correct
38 Correct 24 ms 25684 KB Output is correct
39 Correct 25 ms 25720 KB Output is correct
40 Correct 24 ms 25804 KB Output is correct
41 Correct 24 ms 25684 KB Output is correct
42 Correct 13 ms 24768 KB Output is correct
43 Correct 13 ms 24660 KB Output is correct
44 Correct 12 ms 24680 KB Output is correct
45 Correct 39 ms 28628 KB Output is correct
46 Correct 40 ms 28736 KB Output is correct
47 Correct 90 ms 29284 KB Output is correct
48 Correct 16 ms 25556 KB Output is correct
49 Correct 14 ms 25404 KB Output is correct
50 Correct 13 ms 25072 KB Output is correct
51 Correct 48 ms 27400 KB Output is correct
52 Correct 51 ms 27340 KB Output is correct
53 Correct 17 ms 25556 KB Output is correct
54 Correct 11 ms 24528 KB Output is correct
55 Correct 10 ms 24660 KB Output is correct
56 Correct 16 ms 25444 KB Output is correct
57 Correct 58 ms 24920 KB Output is correct
58 Correct 17 ms 25436 KB Output is correct
59 Correct 19 ms 25620 KB Output is correct
60 Correct 27 ms 25824 KB Output is correct
61 Correct 19 ms 25812 KB Output is correct
62 Correct 35 ms 27916 KB Output is correct
63 Correct 61 ms 49584 KB Output is correct
64 Correct 69 ms 57464 KB Output is correct
65 Correct 321 ms 56008 KB Output is correct
66 Execution timed out 1054 ms 51456 KB Time limit exceeded
67 Halted 0 ms 0 KB -