oj.uz

Submission #544583

# Submission time Handle Problem Language Result Execution time Memory
544583 2022-04-02T11:36:58 Z SavicS Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 178 ms 65652 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 30005; 

int n, m;
int B[mxN];
int P[mxN];

vector<pii> g[mxN];
int dist[mxN];

set<int> s[mxN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> m >> n;
    
    int S = 0, T = 0;
    ff(i,0,n - 1){
        int B, P;
        cin >> B >> P;
        if(i == 0)S = B;
        if(i == 1)T = B;
        if(i != 1)s[B].insert(P);
    }

    // desno
    ff(i,0,m - 1){
        for(auto c : s[i]){

            int pos = i + c, cost = 1;
            while(pos < m){
                g[i].pb({pos, cost});
                if(s[pos].count(c) == 1)break;
                pos += c; cost += 1;
            }

        }
    }

    // levo    
    ff(i,0,m - 1){
        for(auto c : s[i]){

            int pos = i - c, cost = 1;
            while(pos >= 0){
                g[i].pb({pos, cost});
                if(s[pos].count(c) == 1)break;
                pos -= c; cost += 1;
            }

        }
    }

    ff(i,0,m - 1)dist[i] = inf;
    priority_queue<pii, vector<pii>, greater<pii>> pq;

    pq.push({dist[S] = 0, S});
    while(sz(pq)){
        pii v = pq.top(); pq.pop();
        if(dist[v.se] < v.fi)continue;
        for(auto c : g[v.se]){
            int u = c.fi;
            int w = c.se;
            if(dist[u] > v.fi + w){
                pq.push({dist[u] = v.fi + w, u});
            }
        }
    }

    cout << (dist[T] == inf ? -1 : dist[T]) << '\n';

    return 0;
}
/*

6 4
4 5
0 3
5 1
4 1

18 10
1 2
0 12
1 17
4 1
3 1
5 13
14 7
5 16
15 6
9 5

51 9
9 1
45 2
42 38
17 9
39 44
35 1
22 41
43 35
3 36
 
22 19
10 10
13 5
1 1
17 17
2 3
3 9
20 22
18 1
3 5
11 16
7 16
2 22
20 4
11 19
7 1
16 1
11 14
8 9
3 18

5 3 
0 2 
1 1 
4 1
 
// probati bojenje sahovski
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 2 ms 2388 KB Output is correct
5 Correct 2 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 1 ms 2388 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 2 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 2 ms 2388 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 1 ms 2388 KB Output is correct
9 Correct 2 ms 2388 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2388 KB Output is correct
13 Correct 1 ms 2388 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct
16 Correct 2 ms 2516 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 2 ms 2516 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 2 ms 2516 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2516 KB Output is correct
27 Correct 2 ms 2516 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 4 ms 3284 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 3 ms 2900 KB Output is correct
32 Correct 2 ms 2772 KB Output is correct
33 Correct 6 ms 3924 KB Output is correct
34 Correct 6 ms 3924 KB Output is correct
35 Correct 15 ms 4716 KB Output is correct
36 Correct 3 ms 2772 KB Output is correct
37 Correct 16 ms 5408 KB Output is correct
38 Correct 19 ms 5612 KB Output is correct
39 Correct 19 ms 5608 KB Output is correct
40 Correct 19 ms 5588 KB Output is correct
41 Correct 19 ms 5588 KB Output is correct
42 Correct 5 ms 2516 KB Output is correct
43 Correct 5 ms 2516 KB Output is correct
44 Correct 5 ms 2516 KB Output is correct
45 Correct 22 ms 8276 KB Output is correct
46 Correct 21 ms 8276 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 ms 2388 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 1 ms 2388 KB Output is correct
8 Correct 1 ms 2388 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 2 ms 2388 KB Output is correct
11 Correct 3 ms 2516 KB Output is correct
12 Correct 2 ms 2340 KB Output is correct
13 Correct 1 ms 2388 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 2 ms 2516 KB Output is correct
16 Correct 2 ms 2516 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 2 ms 2516 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 2 ms 2516 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2516 KB Output is correct
23 Correct 2 ms 2516 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 2 ms 2516 KB Output is correct
27 Correct 2 ms 2516 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 4 ms 3284 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 3 ms 2900 KB Output is correct
32 Correct 3 ms 2772 KB Output is correct
33 Correct 6 ms 3924 KB Output is correct
34 Correct 6 ms 3924 KB Output is correct
35 Correct 15 ms 4692 KB Output is correct
36 Correct 3 ms 2772 KB Output is correct
37 Correct 16 ms 5384 KB Output is correct
38 Correct 19 ms 5588 KB Output is correct
39 Correct 19 ms 5708 KB Output is correct
40 Correct 20 ms 5560 KB Output is correct
41 Correct 20 ms 5552 KB Output is correct
42 Correct 6 ms 2516 KB Output is correct
43 Correct 5 ms 2516 KB Output is correct
44 Correct 5 ms 2516 KB Output is correct
45 Correct 21 ms 8328 KB Output is correct
46 Correct 21 ms 8220 KB Output is correct
47 Correct 39 ms 12868 KB Output is correct
48 Correct 14 ms 5888 KB Output is correct
49 Correct 15 ms 5088 KB Output is correct
50 Correct 10 ms 4692 KB Output is correct
51 Correct 35 ms 7816 KB Output is correct
52 Correct 34 ms 8276 KB Output is correct
53 Correct 12 ms 4712 KB Output is correct
54 Correct 3 ms 2900 KB Output is correct
55 Correct 4 ms 3152 KB Output is correct
56 Correct 10 ms 4820 KB Output is correct
57 Correct 31 ms 11856 KB Output is correct
58 Correct 10 ms 3276 KB Output is correct
59 Correct 9 ms 3844 KB Output is correct
60 Correct 10 ms 4304 KB Output is correct
61 Correct 9 ms 3852 KB Output is correct
62 Correct 19 ms 8788 KB Output is correct
63 Correct 68 ms 25720 KB Output is correct
64 Correct 79 ms 29576 KB Output is correct
65 Correct 97 ms 38900 KB Output is correct
66 Correct 178 ms 65596 KB Output is correct
67 Correct 177 ms 65652 KB Output is correct