oj.uz

Submission #544577

# Submission time Handle Problem Language Result Execution time Memory
544577 2022-04-02T11:31:16 Z SavicS Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 115732 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];

unordered_map<int,int> mp[mxN];

int id[mxN];
bool cmp(int s1, int s2){
    return B[s1] < B[s2];
}

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

    cin >> m >> n;
    ff(i,0,n - 1)cin >> B[i] >> P[i];

    int S = B[0];
    int T = B[1];

    ff(i,0,n - 1)id[i] = i;
    sort(id, id + n, cmp);

    ff(i,0,n - 1){
        if(id[i] == 1)continue;
        int pos = B[id[i]] + P[id[i]], cost = 1;
        while(pos < m){
            g[B[id[i]]].pb({pos, cost}); cost += 1;
            if(mp[pos].count(P[id[i]]) == 1)break;
            mp[pos][P[id[i]]] = 1;
            pos += P[id[i]];
        }
    }    

    ff(i,0,m - 1)mp[i].clear();

    ff(i,0,n - 1){
        if(id[i] == 1)continue;
        int pos = B[id[i]] - P[id[i]], cost = 1;
        while(pos >= 0){
            g[B[id[i]]].pb({pos, cost}); cost += 1;
            if(mp[pos].count(P[id[i]]) == 1)break;
            mp[pos][P[id[i]]] = 1;
            pos -= P[id[i]];
        }
    }

    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 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 3 ms 3028 KB Output is correct
19 Correct 3 ms 2900 KB Output is correct
20 Correct 3 ms 3156 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 3 ms 3028 KB Output is correct
23 Correct 3 ms 3028 KB Output is correct
24 Correct 4 ms 3284 KB Output is correct
25 Correct 3 ms 3156 KB Output is correct
26 Correct 3 ms 3156 KB Output is correct
27 Correct 4 ms 3156 KB Output is correct
28 Correct 4 ms 3412 KB Output is correct
29 Correct 13 ms 6100 KB Output is correct
30 Correct 4 ms 3668 KB Output is correct
31 Correct 8 ms 4564 KB Output is correct
32 Correct 5 ms 3796 KB Output is correct
33 Correct 24 ms 9420 KB Output is correct
34 Correct 29 ms 9300 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 4 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 3 ms 2900 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 3 ms 3040 KB Output is correct
19 Correct 2 ms 2900 KB Output is correct
20 Correct 3 ms 3156 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 2 ms 3028 KB Output is correct
23 Correct 3 ms 3028 KB Output is correct
24 Correct 4 ms 3284 KB Output is correct
25 Correct 3 ms 3156 KB Output is correct
26 Correct 3 ms 3156 KB Output is correct
27 Correct 3 ms 3156 KB Output is correct
28 Correct 4 ms 3412 KB Output is correct
29 Correct 13 ms 6068 KB Output is correct
30 Correct 4 ms 3668 KB Output is correct
31 Correct 7 ms 4564 KB Output is correct
32 Correct 5 ms 3924 KB Output is correct
33 Correct 23 ms 9328 KB Output is correct
34 Correct 25 ms 9408 KB Output is correct
35 Correct 20 ms 6116 KB Output is correct
36 Correct 5 ms 3284 KB Output is correct
37 Correct 38 ms 9292 KB Output is correct
38 Correct 34 ms 8368 KB Output is correct
39 Correct 37 ms 8428 KB Output is correct
40 Correct 37 ms 8388 KB Output is correct
41 Correct 40 ms 8396 KB Output is correct
42 Correct 8 ms 3920 KB Output is correct
43 Correct 11 ms 3932 KB Output is correct
44 Correct 9 ms 3948 KB Output is correct
45 Correct 163 ms 25212 KB Output is correct
46 Correct 137 ms 25328 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 3 ms 2748 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 2 ms 3028 KB Output is correct
19 Correct 3 ms 2900 KB Output is correct
20 Correct 3 ms 3156 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 2 ms 3028 KB Output is correct
23 Correct 3 ms 3028 KB Output is correct
24 Correct 4 ms 3284 KB Output is correct
25 Correct 3 ms 3156 KB Output is correct
26 Correct 3 ms 3156 KB Output is correct
27 Correct 3 ms 3156 KB Output is correct
28 Correct 4 ms 3412 KB Output is correct
29 Correct 12 ms 6044 KB Output is correct
30 Correct 4 ms 3668 KB Output is correct
31 Correct 7 ms 4564 KB Output is correct
32 Correct 6 ms 3928 KB Output is correct
33 Correct 23 ms 9300 KB Output is correct
34 Correct 29 ms 9504 KB Output is correct
35 Correct 21 ms 6144 KB Output is correct
36 Correct 5 ms 3284 KB Output is correct
37 Correct 36 ms 9284 KB Output is correct
38 Correct 34 ms 8408 KB Output is correct
39 Correct 33 ms 8524 KB Output is correct
40 Correct 33 ms 8452 KB Output is correct
41 Correct 38 ms 8388 KB Output is correct
42 Correct 8 ms 4004 KB Output is correct
43 Correct 8 ms 3944 KB Output is correct
44 Correct 8 ms 4048 KB Output is correct
45 Correct 138 ms 25112 KB Output is correct
46 Correct 142 ms 25224 KB Output is correct
47 Correct 289 ms 30932 KB Output is correct
48 Correct 51 ms 11508 KB Output is correct
49 Correct 32 ms 9076 KB Output is correct
50 Correct 31 ms 9604 KB Output is correct
51 Correct 93 ms 15432 KB Output is correct
52 Correct 104 ms 16560 KB Output is correct
53 Correct 19 ms 8656 KB Output is correct
54 Correct 5 ms 5204 KB Output is correct
55 Correct 10 ms 8144 KB Output is correct
56 Correct 22 ms 10312 KB Output is correct
57 Correct 229 ms 29872 KB Output is correct
58 Correct 17 ms 9288 KB Output is correct
59 Correct 30 ms 10756 KB Output is correct
60 Correct 36 ms 11240 KB Output is correct
61 Correct 29 ms 9904 KB Output is correct
62 Correct 117 ms 18100 KB Output is correct
63 Execution timed out 1102 ms 115732 KB Time limit exceeded
64 Halted 0 ms 0 KB -