oj.uz

Submission #761726

# Submission time Handle Problem Language Result Execution time Memory
761726 2023-06-20T07:54:27 Z ByeWorld Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 136384 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define ll long long
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
const int MAXN = 3e4+10;
const double SMALL = 1e-6;
const ll INF = 1e18+10;
const int MOD = 1e9+7;
typedef pair<int,int> pii;
typedef pair<ll, pii> ipii;

bitset <MAXN> ma[MAXN];
int b[MAXN], p[MAXN];
bitset <MAXN> vis;
unordered_map <int, ll> tot[MAXN];
vector <int> ed[MAXN];
int n, m;
priority_queue <ipii, vector<ipii>, greater<ipii>> pq;

void dji(){
    tot[b[0]][p[0]] = -INF;
    pq.push(ipii(-INF, pii(b[0], p[0])));
    
    while(!pq.empty()){
        ll dis = pq.top().fi; int nw = pq.top().se.fi; int jump = pq.top().se.se;
        //cout << dis << ' ' << nw << ' ' << jump << "p\n";
        pq.pop();
        if(dis != tot[nw][jump]) continue;
        
        if(!vis[nw]){
            vis[nw] = 1;
            for(auto nx : ed[nw]){ // ke k lain
                if(tot[nw][nx] > dis){ //gk nambah lompat 
                    tot[nw][nx] = dis;
                    pq.push(ipii(dis, pii(nw, nx)));
                }
            }
        }
        
        if(nw-jump >= 0 && tot[nw-jump][jump] > dis+1){
            tot[nw-jump][jump] = dis+1;
            pq.push(ipii(dis+1, pii(nw-jump, jump)));
        }
        if(nw+jump <= n-1 && tot[nw+jump][jump] > dis+1){
            tot[nw+jump][jump] = dis+1;
            pq.push(ipii(dis+1, pii(nw+jump, jump)));
        }
            
    }
    
    ll ans = INF;
    for(int i=1; i<=30000; i++) ans = min(ans, tot[b[1]][i]+INF);
    if(ans != INF) cout << ans << '\n';
    else cout << "-1\n";
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for(int i=0; i<=m-1; i++){ 
        cin >> b[i] >> p[i];
    }
    for(int i=0; i<=m-1; i++){ 
        if(ma[b[i]][p[i]] ==  1) continue;
        ma[b[i]][p[i]] = 1;
        ed[b[i]].pb(p[i]);
    }
    dji();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3888 KB Output is correct
2 Correct 3 ms 3888 KB Output is correct
3 Correct 3 ms 3888 KB Output is correct
4 Correct 3 ms 3888 KB Output is correct
5 Correct 3 ms 3888 KB Output is correct
6 Correct 3 ms 3888 KB Output is correct
7 Correct 3 ms 3888 KB Output is correct
8 Correct 3 ms 4016 KB Output is correct
9 Correct 3 ms 4016 KB Output is correct
10 Correct 3 ms 4400 KB Output is correct
11 Correct 5 ms 4456 KB Output is correct
12 Correct 3 ms 4016 KB Output is correct
13 Correct 3 ms 4272 KB Output is correct
14 Correct 4 ms 4528 KB Output is correct
15 Correct 4 ms 4528 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3888 KB Output is correct
2 Correct 3 ms 3888 KB Output is correct
3 Correct 3 ms 3888 KB Output is correct
4 Correct 3 ms 3888 KB Output is correct
5 Correct 3 ms 3888 KB Output is correct
6 Correct 3 ms 3888 KB Output is correct
7 Correct 3 ms 3888 KB Output is correct
8 Correct 3 ms 4016 KB Output is correct
9 Correct 3 ms 4052 KB Output is correct
10 Correct 3 ms 4400 KB Output is correct
11 Correct 4 ms 4528 KB Output is correct
12 Correct 3 ms 4016 KB Output is correct
13 Correct 3 ms 4272 KB Output is correct
14 Correct 4 ms 4528 KB Output is correct
15 Correct 4 ms 4528 KB Output is correct
16 Correct 4 ms 4656 KB Output is correct
17 Correct 8 ms 7216 KB Output is correct
18 Correct 5 ms 6960 KB Output is correct
19 Correct 4 ms 5852 KB Output is correct
20 Correct 8 ms 11568 KB Output is correct
21 Correct 4 ms 5296 KB Output is correct
22 Correct 4 ms 6192 KB Output is correct
23 Correct 6 ms 7088 KB Output is correct
24 Correct 11 ms 9136 KB Output is correct
25 Correct 10 ms 9244 KB Output is correct
26 Correct 5 ms 4656 KB Output is correct
27 Correct 4 ms 4528 KB Output is correct
28 Correct 10 ms 12336 KB Output is correct
29 Correct 14 ms 6832 KB Output is correct
30 Correct 5 ms 4784 KB Output is correct
31 Correct 9 ms 5572 KB Output is correct
32 Correct 6 ms 5028 KB Output is correct
33 Correct 26 ms 9648 KB Output is correct
34 Correct 26 ms 9648 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3888 KB Output is correct
2 Correct 3 ms 3888 KB Output is correct
3 Correct 3 ms 3888 KB Output is correct
4 Correct 3 ms 3888 KB Output is correct
5 Correct 3 ms 3888 KB Output is correct
6 Correct 4 ms 3888 KB Output is correct
7 Correct 3 ms 3888 KB Output is correct
8 Correct 3 ms 4016 KB Output is correct
9 Correct 3 ms 4016 KB Output is correct
10 Correct 4 ms 4400 KB Output is correct
11 Correct 4 ms 4528 KB Output is correct
12 Correct 3 ms 4016 KB Output is correct
13 Correct 3 ms 4272 KB Output is correct
14 Correct 4 ms 4528 KB Output is correct
15 Correct 4 ms 4528 KB Output is correct
16 Correct 4 ms 4656 KB Output is correct
17 Correct 9 ms 7216 KB Output is correct
18 Correct 5 ms 6960 KB Output is correct
19 Correct 4 ms 5808 KB Output is correct
20 Correct 7 ms 11568 KB Output is correct
21 Correct 4 ms 5296 KB Output is correct
22 Correct 4 ms 6192 KB Output is correct
23 Correct 6 ms 7088 KB Output is correct
24 Correct 8 ms 9136 KB Output is correct
25 Correct 7 ms 9264 KB Output is correct
26 Correct 4 ms 4656 KB Output is correct
27 Correct 4 ms 4528 KB Output is correct
28 Correct 10 ms 12392 KB Output is correct
29 Correct 14 ms 6848 KB Output is correct
30 Correct 7 ms 4764 KB Output is correct
31 Correct 9 ms 5680 KB Output is correct
32 Correct 6 ms 5040 KB Output is correct
33 Correct 25 ms 9648 KB Output is correct
34 Correct 34 ms 9636 KB Output is correct
35 Correct 36 ms 14392 KB Output is correct
36 Correct 9 ms 8752 KB Output is correct
37 Correct 56 ms 18988 KB Output is correct
38 Correct 54 ms 19128 KB Output is correct
39 Correct 60 ms 19080 KB Output is correct
40 Correct 56 ms 19124 KB Output is correct
41 Correct 57 ms 19156 KB Output is correct
42 Correct 7 ms 4912 KB Output is correct
43 Correct 7 ms 4740 KB Output is correct
44 Correct 10 ms 11824 KB Output is correct
45 Correct 110 ms 24788 KB Output is correct
46 Correct 110 ms 24820 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3888 KB Output is correct
2 Correct 3 ms 3888 KB Output is correct
3 Correct 3 ms 3888 KB Output is correct
4 Correct 3 ms 3888 KB Output is correct
5 Correct 3 ms 3888 KB Output is correct
6 Correct 3 ms 3948 KB Output is correct
7 Correct 3 ms 3888 KB Output is correct
8 Correct 3 ms 4016 KB Output is correct
9 Correct 3 ms 4016 KB Output is correct
10 Correct 3 ms 4400 KB Output is correct
11 Correct 4 ms 4528 KB Output is correct
12 Correct 3 ms 4016 KB Output is correct
13 Correct 3 ms 4272 KB Output is correct
14 Correct 4 ms 4528 KB Output is correct
15 Correct 4 ms 4528 KB Output is correct
16 Correct 3 ms 4656 KB Output is correct
17 Correct 7 ms 7216 KB Output is correct
18 Correct 4 ms 6960 KB Output is correct
19 Correct 4 ms 5808 KB Output is correct
20 Correct 7 ms 11568 KB Output is correct
21 Correct 4 ms 5352 KB Output is correct
22 Correct 5 ms 6192 KB Output is correct
23 Correct 7 ms 7088 KB Output is correct
24 Correct 12 ms 9128 KB Output is correct
25 Correct 7 ms 9264 KB Output is correct
26 Correct 6 ms 4692 KB Output is correct
27 Correct 4 ms 4528 KB Output is correct
28 Correct 15 ms 12396 KB Output is correct
29 Correct 17 ms 6836 KB Output is correct
30 Correct 5 ms 4784 KB Output is correct
31 Correct 13 ms 5680 KB Output is correct
32 Correct 6 ms 5040 KB Output is correct
33 Correct 27 ms 9620 KB Output is correct
34 Correct 25 ms 9656 KB Output is correct
35 Correct 36 ms 14380 KB Output is correct
36 Correct 10 ms 8752 KB Output is correct
37 Correct 65 ms 18988 KB Output is correct
38 Correct 77 ms 19116 KB Output is correct
39 Correct 58 ms 19108 KB Output is correct
40 Correct 54 ms 19136 KB Output is correct
41 Correct 56 ms 19120 KB Output is correct
42 Correct 7 ms 4912 KB Output is correct
43 Correct 6 ms 4784 KB Output is correct
44 Correct 10 ms 11852 KB Output is correct
45 Correct 118 ms 24832 KB Output is correct
46 Correct 110 ms 24784 KB Output is correct
47 Correct 420 ms 77244 KB Output is correct
48 Correct 48 ms 59944 KB Output is correct
49 Correct 50 ms 60180 KB Output is correct
50 Correct 29 ms 49544 KB Output is correct
51 Correct 143 ms 91828 KB Output is correct
52 Correct 139 ms 93240 KB Output is correct
53 Correct 68 ms 83476 KB Output is correct
54 Correct 5 ms 6064 KB Output is correct
55 Correct 6 ms 6832 KB Output is correct
56 Correct 70 ms 119412 KB Output is correct
57 Correct 140 ms 33844 KB Output is correct
58 Correct 16 ms 9520 KB Output is correct
59 Correct 17 ms 10616 KB Output is correct
60 Correct 23 ms 12420 KB Output is correct
61 Correct 26 ms 12568 KB Output is correct
62 Correct 162 ms 136384 KB Output is correct
63 Execution timed out 1091 ms 94708 KB Time limit exceeded
64 Halted 0 ms 0 KB -