oj.uz

Submission #243881

# Submission time Handle Problem Language Result Execution time Memory
243881 2020-07-02T03:57:19 Z Leonardo_Paes Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 50524 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef pair<int,int> pii;
typedef pair<int,pii> pip;
#define f first
#define s second
const int maxn = 3e4+10, magic = 200, 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;
}

Compilation message

skyscraper.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
skyscraper.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25216 KB Output is correct
2 Correct 19 ms 25216 KB Output is correct
3 Correct 17 ms 25216 KB Output is correct
4 Correct 17 ms 25216 KB Output is correct
5 Correct 17 ms 25216 KB Output is correct
6 Correct 17 ms 25216 KB Output is correct
7 Correct 17 ms 25216 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 25216 KB Output is correct
2 Correct 17 ms 25216 KB Output is correct
3 Correct 18 ms 25216 KB Output is correct
4 Correct 17 ms 25216 KB Output is correct
5 Correct 17 ms 25216 KB Output is correct
6 Correct 18 ms 25216 KB Output is correct
7 Correct 19 ms 25216 KB Output is correct
8 Correct 18 ms 25216 KB Output is correct
9 Correct 17 ms 25216 KB Output is correct
10 Correct 19 ms 25216 KB Output is correct
11 Correct 20 ms 25472 KB Output is correct
12 Correct 19 ms 25344 KB Output is correct
13 Correct 18 ms 25344 KB Output is correct
14 Correct 18 ms 25344 KB Output is correct
15 Correct 20 ms 25344 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 25216 KB Output is correct
2 Correct 17 ms 25216 KB Output is correct
3 Correct 18 ms 25216 KB Output is correct
4 Correct 19 ms 25344 KB Output is correct
5 Correct 19 ms 25216 KB Output is correct
6 Correct 20 ms 25216 KB Output is correct
7 Correct 18 ms 25216 KB Output is correct
8 Correct 17 ms 25216 KB Output is correct
9 Correct 17 ms 25216 KB Output is correct
10 Correct 18 ms 25216 KB Output is correct
11 Correct 18 ms 25344 KB Output is correct
12 Correct 18 ms 25344 KB Output is correct
13 Correct 19 ms 25344 KB Output is correct
14 Correct 19 ms 25344 KB Output is correct
15 Correct 20 ms 25344 KB Output is correct
16 Correct 19 ms 25344 KB Output is correct
17 Correct 21 ms 25344 KB Output is correct
18 Correct 18 ms 25344 KB Output is correct
19 Correct 18 ms 25344 KB Output is correct
20 Correct 21 ms 25344 KB Output is correct
21 Correct 19 ms 25216 KB Output is correct
22 Correct 19 ms 25216 KB Output is correct
23 Correct 19 ms 25344 KB Output is correct
24 Correct 21 ms 25344 KB Output is correct
25 Correct 19 ms 25344 KB Output is correct
26 Correct 19 ms 25344 KB Output is correct
27 Correct 19 ms 25344 KB Output is correct
28 Correct 21 ms 25344 KB Output is correct
29 Correct 25 ms 25216 KB Output is correct
30 Correct 20 ms 25216 KB Output is correct
31 Correct 23 ms 25216 KB Output is correct
32 Correct 20 ms 25216 KB Output is correct
33 Correct 32 ms 25344 KB Output is correct
34 Correct 33 ms 25344 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25216 KB Output is correct
2 Correct 18 ms 25216 KB Output is correct
3 Correct 17 ms 25216 KB Output is correct
4 Correct 18 ms 25216 KB Output is correct
5 Correct 18 ms 25216 KB Output is correct
6 Correct 17 ms 25216 KB Output is correct
7 Correct 19 ms 25216 KB Output is correct
8 Correct 19 ms 25216 KB Output is correct
9 Correct 19 ms 25216 KB Output is correct
10 Correct 18 ms 25344 KB Output is correct
11 Correct 18 ms 25344 KB Output is correct
12 Correct 18 ms 25344 KB Output is correct
13 Correct 19 ms 25344 KB Output is correct
14 Correct 19 ms 25344 KB Output is correct
15 Correct 20 ms 25344 KB Output is correct
16 Correct 17 ms 25216 KB Output is correct
17 Correct 21 ms 25344 KB Output is correct
18 Correct 18 ms 25344 KB Output is correct
19 Correct 17 ms 25216 KB Output is correct
20 Correct 18 ms 25344 KB Output is correct
21 Correct 18 ms 25216 KB Output is correct
22 Correct 19 ms 25216 KB Output is correct
23 Correct 20 ms 25344 KB Output is correct
24 Correct 21 ms 25344 KB Output is correct
25 Correct 19 ms 25344 KB Output is correct
26 Correct 19 ms 25344 KB Output is correct
27 Correct 19 ms 25328 KB Output is correct
28 Correct 20 ms 25344 KB Output is correct
29 Correct 26 ms 25344 KB Output is correct
30 Correct 19 ms 25216 KB Output is correct
31 Correct 23 ms 25344 KB Output is correct
32 Correct 20 ms 25216 KB Output is correct
33 Correct 32 ms 25344 KB Output is correct
34 Correct 34 ms 25344 KB Output is correct
35 Correct 42 ms 26168 KB Output is correct
36 Correct 23 ms 25344 KB Output is correct
37 Correct 55 ms 26484 KB Output is correct
38 Correct 53 ms 26620 KB Output is correct
39 Correct 59 ms 26616 KB Output is correct
40 Correct 59 ms 26612 KB Output is correct
41 Correct 58 ms 26612 KB Output is correct
42 Correct 27 ms 26240 KB Output is correct
43 Correct 27 ms 26240 KB Output is correct
44 Correct 27 ms 26224 KB Output is correct
45 Correct 111 ms 27380 KB Output is correct
46 Correct 115 ms 27384 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 25216 KB Output is correct
2 Correct 18 ms 25216 KB Output is correct
3 Correct 17 ms 25216 KB Output is correct
4 Correct 18 ms 25216 KB Output is correct
5 Correct 17 ms 25216 KB Output is correct
6 Correct 17 ms 25216 KB Output is correct
7 Correct 20 ms 25216 KB Output is correct
8 Correct 17 ms 25216 KB Output is correct
9 Correct 17 ms 25216 KB Output is correct
10 Correct 18 ms 25216 KB Output is correct
11 Correct 19 ms 25344 KB Output is correct
12 Correct 18 ms 25344 KB Output is correct
13 Correct 20 ms 25344 KB Output is correct
14 Correct 20 ms 25344 KB Output is correct
15 Correct 19 ms 25344 KB Output is correct
16 Correct 18 ms 25216 KB Output is correct
17 Correct 20 ms 25344 KB Output is correct
18 Correct 18 ms 25216 KB Output is correct
19 Correct 18 ms 25216 KB Output is correct
20 Correct 18 ms 25344 KB Output is correct
21 Correct 22 ms 25344 KB Output is correct
22 Correct 17 ms 25344 KB Output is correct
23 Correct 19 ms 25344 KB Output is correct
24 Correct 20 ms 25344 KB Output is correct
25 Correct 18 ms 25344 KB Output is correct
26 Correct 19 ms 25344 KB Output is correct
27 Correct 20 ms 25392 KB Output is correct
28 Correct 21 ms 25344 KB Output is correct
29 Correct 24 ms 25344 KB Output is correct
30 Correct 19 ms 25216 KB Output is correct
31 Correct 21 ms 25344 KB Output is correct
32 Correct 21 ms 25216 KB Output is correct
33 Correct 32 ms 25344 KB Output is correct
34 Correct 32 ms 25344 KB Output is correct
35 Correct 41 ms 26176 KB Output is correct
36 Correct 23 ms 25344 KB Output is correct
37 Correct 56 ms 26612 KB Output is correct
38 Correct 55 ms 26612 KB Output is correct
39 Correct 54 ms 26624 KB Output is correct
40 Correct 54 ms 26612 KB Output is correct
41 Correct 55 ms 26612 KB Output is correct
42 Correct 28 ms 26240 KB Output is correct
43 Correct 28 ms 26624 KB Output is correct
44 Correct 27 ms 26224 KB Output is correct
45 Correct 112 ms 27388 KB Output is correct
46 Correct 113 ms 27384 KB Output is correct
47 Correct 189 ms 29036 KB Output is correct
48 Correct 25 ms 25856 KB Output is correct
49 Correct 24 ms 25856 KB Output is correct
50 Correct 22 ms 25728 KB Output is correct
51 Correct 93 ms 27004 KB Output is correct
52 Correct 97 ms 26996 KB Output is correct
53 Correct 34 ms 26112 KB Output is correct
54 Correct 18 ms 25216 KB Output is correct
55 Correct 19 ms 25216 KB Output is correct
56 Correct 28 ms 26368 KB Output is correct
57 Correct 95 ms 25344 KB Output is correct
58 Correct 29 ms 26240 KB Output is correct
59 Correct 35 ms 26240 KB Output is correct
60 Correct 47 ms 26232 KB Output is correct
61 Correct 38 ms 26284 KB Output is correct
62 Correct 65 ms 26496 KB Output is correct
63 Correct 664 ms 38240 KB Output is correct
64 Correct 894 ms 38116 KB Output is correct
65 Execution timed out 1091 ms 50524 KB Time limit exceeded
66 Halted 0 ms 0 KB -