oj.uz

답안 #243879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
243879 2020-07-02T03:53:33 Z Leonardo_Paes Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 49360 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> pip;
#define f first
#define s second
const int maxn = 3e4+10, magic = 190, inf = 0x3f3f3f3f;
int b[maxn], p[maxn], dist1[maxn], dist2[maxn][magic+5];
vector<int> doges[maxn];
bool mark[maxn];
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n, m;
    cin >> n >> m;
    for(int i=0; i<m; i++){
        cin >> b[i] >> p[i];
        doges[b[i]].push_back(i);
    }
    priority_queue<pip, vector<pip>, greater<pip>> fila;
    memset(dist1, inf, sizeof dist1);
    memset(dist2, inf, sizeof dist2);
    fila.push({0, {b[0], 0}});
    while(!fila.empty()){
        int d = fila.top().f, u = fila.top().s.f, id = fila.top().s.s, power = p[fila.top().s.s];
        fila.pop();
        if(power <= magic){
            if(dist2[u][power] == inf) dist2[u][power] = d;
            if(u + power < n and dist2[u + power][power] == inf){
                fila.push({d + 1, {u + power, id}});
                dist2[u + power][power] = d + 1;
            }
            if(u - power >= 0 and dist2[u - power][power] == inf){
                fila.push({d + 1, {u - power, id}});
                dist2[u - power][power] = d + 1;
            }
        }
        else{
            if(dist1[u] == inf) dist1[u] = d;
            if(!mark[id]){
                mark[id] = 1;
                for(int v=u+power, qtd=1; v<n; v+=power, qtd++) fila.push({d + qtd, {v, id}});
                for(int v=u-power, qtd=1; v>=0; v-=power, qtd++) fila.push({d + qtd, {v, id}});
            }
        }
        if(!doges[u].empty()){
            for(auto v : doges[u]) fila.push({d, {u, v}});
            doges[u].clear();
        }
    }
    int ans = dist1[b[1]];
    for(int i=1; i<=magic; i++) ans = min(ans, dist2[b[1]][i]);
    cout << (ans == inf ? -1 : ans) << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24064 KB Output is correct
2 Correct 17 ms 24064 KB Output is correct
3 Correct 17 ms 24064 KB Output is correct
4 Correct 17 ms 24064 KB Output is correct
5 Correct 17 ms 24064 KB Output is correct
6 Correct 17 ms 24064 KB Output is correct
7 Correct 17 ms 24064 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24064 KB Output is correct
2 Correct 16 ms 24064 KB Output is correct
3 Correct 18 ms 24064 KB Output is correct
4 Correct 17 ms 24064 KB Output is correct
5 Correct 17 ms 24064 KB Output is correct
6 Correct 18 ms 24064 KB Output is correct
7 Correct 17 ms 24064 KB Output is correct
8 Correct 18 ms 24064 KB Output is correct
9 Correct 17 ms 24064 KB Output is correct
10 Correct 17 ms 24064 KB Output is correct
11 Correct 18 ms 24192 KB Output is correct
12 Correct 18 ms 24192 KB Output is correct
13 Correct 18 ms 24192 KB Output is correct
14 Correct 18 ms 24192 KB Output is correct
15 Correct 20 ms 24192 KB Output is correct
16 Correct 19 ms 24064 KB Output is correct
17 Correct 19 ms 24192 KB Output is correct
18 Correct 18 ms 24064 KB Output is correct
19 Correct 17 ms 24064 KB Output is correct
20 Correct 19 ms 24192 KB Output is correct
21 Correct 17 ms 24064 KB Output is correct
22 Correct 17 ms 24064 KB Output is correct
23 Correct 18 ms 24064 KB Output is correct
24 Correct 20 ms 24192 KB Output is correct
25 Correct 18 ms 24064 KB Output is correct
26 Correct 18 ms 24192 KB Output is correct
27 Correct 17 ms 24192 KB Output is correct
28 Correct 19 ms 24192 KB Output is correct
29 Correct 23 ms 24064 KB Output is correct
30 Correct 19 ms 24064 KB Output is correct
31 Correct 20 ms 24064 KB Output is correct
32 Correct 19 ms 24064 KB Output is correct
33 Correct 31 ms 24192 KB Output is correct
34 Correct 34 ms 24192 KB Output is correct
35 Correct 39 ms 25024 KB Output is correct
36 Correct 21 ms 24192 KB Output is correct
37 Correct 53 ms 25332 KB Output is correct
38 Correct 56 ms 25460 KB Output is correct
39 Correct 53 ms 25464 KB Output is correct
40 Correct 53 ms 25468 KB Output is correct
41 Correct 55 ms 25460 KB Output is correct
42 Correct 27 ms 25088 KB Output is correct
43 Correct 29 ms 25080 KB Output is correct
44 Correct 29 ms 25064 KB Output is correct
45 Correct 109 ms 26236 KB Output is correct
46 Correct 109 ms 26224 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 24064 KB Output is correct
2 Correct 18 ms 24064 KB Output is correct
3 Correct 19 ms 24192 KB Output is correct
4 Correct 19 ms 24064 KB Output is correct
5 Correct 17 ms 24064 KB Output is correct
6 Correct 17 ms 24064 KB Output is correct
7 Correct 17 ms 24064 KB Output is correct
8 Correct 17 ms 24064 KB Output is correct
9 Correct 17 ms 24064 KB Output is correct
10 Correct 17 ms 24064 KB Output is correct
11 Correct 18 ms 24192 KB Output is correct
12 Correct 18 ms 24320 KB Output is correct
13 Correct 17 ms 24320 KB Output is correct
14 Correct 19 ms 24192 KB Output is correct
15 Correct 19 ms 24192 KB Output is correct
16 Correct 17 ms 24064 KB Output is correct
17 Correct 21 ms 24192 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 17 ms 24064 KB Output is correct
20 Correct 18 ms 24192 KB Output is correct
21 Correct 18 ms 24192 KB Output is correct
22 Correct 17 ms 24064 KB Output is correct
23 Correct 19 ms 24064 KB Output is correct
24 Correct 21 ms 24192 KB Output is correct
25 Correct 18 ms 24192 KB Output is correct
26 Correct 18 ms 24192 KB Output is correct
27 Correct 18 ms 24192 KB Output is correct
28 Correct 19 ms 24192 KB Output is correct
29 Correct 23 ms 24192 KB Output is correct
30 Correct 18 ms 24064 KB Output is correct
31 Correct 21 ms 24064 KB Output is correct
32 Correct 19 ms 24064 KB Output is correct
33 Correct 31 ms 24192 KB Output is correct
34 Correct 31 ms 24192 KB Output is correct
35 Correct 42 ms 25024 KB Output is correct
36 Correct 21 ms 24192 KB Output is correct
37 Correct 54 ms 25340 KB Output is correct
38 Correct 54 ms 25460 KB Output is correct
39 Correct 53 ms 25472 KB Output is correct
40 Correct 54 ms 25460 KB Output is correct
41 Correct 57 ms 25588 KB Output is correct
42 Correct 27 ms 25088 KB Output is correct
43 Correct 26 ms 25088 KB Output is correct
44 Correct 26 ms 25072 KB Output is correct
45 Correct 111 ms 26236 KB Output is correct
46 Correct 110 ms 26232 KB Output is correct
47 Correct 202 ms 27884 KB Output is correct
48 Correct 24 ms 24704 KB Output is correct
49 Correct 23 ms 24704 KB Output is correct
50 Correct 21 ms 24576 KB Output is correct
51 Correct 92 ms 25844 KB Output is correct
52 Correct 103 ms 25852 KB Output is correct
53 Correct 33 ms 24960 KB Output is correct
54 Correct 18 ms 24064 KB Output is correct
55 Correct 18 ms 24064 KB Output is correct
56 Correct 27 ms 25216 KB Output is correct
57 Correct 93 ms 24192 KB Output is correct
58 Correct 29 ms 25088 KB Output is correct
59 Correct 32 ms 25080 KB Output is correct
60 Correct 45 ms 25080 KB Output is correct
61 Correct 41 ms 25080 KB Output is correct
62 Correct 63 ms 25336 KB Output is correct
63 Correct 712 ms 37092 KB Output is correct
64 Correct 886 ms 36960 KB Output is correct
65 Execution timed out 1101 ms 49360 KB Time limit exceeded
66 Halted 0 ms 0 KB -