oj.uz

Submission #544551

# Submission time Handle Problem Language Result Execution time Memory
544551 2022-04-02T09:45:33 Z SavicS Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 430 ms 34960 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 = 100005; 

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

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

map<int,int> mp[mxN];

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){
        int pos = B[i] + P[i], cost = 1;
        while(pos < m){
            g[B[i]].pb({pos, cost}); cost += 1;
            if(mp[pos].count(P[i]) == 1)break;
            mp[pos][P[i]] = 1;
            pos += P[i];
        }
    }    

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

    ff(i,0,n - 1){
        int pos = B[i] - P[i], cost = 1;
        while(pos >= 0){
            g[B[i]].pb({pos, cost}); cost += 1;
            if(mp[pos].count(P[i]) == 1)break;
            mp[pos][P[i]] = 1;
            pos -= P[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;
}
/*
 
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 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7456 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 3 ms 7272 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 5 ms 7508 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7636 KB Output is correct
15 Correct 5 ms 7636 KB Output is correct
16 Correct 5 ms 7508 KB Output is correct
17 Correct 7 ms 7892 KB Output is correct
18 Correct 5 ms 7508 KB Output is correct
19 Correct 4 ms 7552 KB Output is correct
20 Correct 4 ms 7508 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 5 ms 7508 KB Output is correct
24 Correct 6 ms 7764 KB Output is correct
25 Correct 6 ms 7636 KB Output is correct
26 Correct 5 ms 7764 KB Output is correct
27 Correct 4 ms 7636 KB Output is correct
28 Correct 6 ms 8020 KB Output is correct
29 Correct 17 ms 10836 KB Output is correct
30 Correct 7 ms 8404 KB Output is correct
31 Correct 10 ms 9300 KB Output is correct
32 Correct 8 ms 8660 KB Output is correct
33 Correct 33 ms 13984 KB Output is correct
34 Correct 34 ms 14048 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 4 ms 7352 KB Output is correct
8 Correct 6 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 5 ms 7380 KB Output is correct
11 Correct 5 ms 7508 KB Output is correct
12 Correct 5 ms 7380 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7636 KB Output is correct
15 Correct 5 ms 7636 KB Output is correct
16 Correct 5 ms 7508 KB Output is correct
17 Correct 6 ms 7892 KB Output is correct
18 Correct 5 ms 7508 KB Output is correct
19 Correct 5 ms 7508 KB Output is correct
20 Correct 5 ms 7636 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 5 ms 7508 KB Output is correct
24 Correct 6 ms 7764 KB Output is correct
25 Correct 5 ms 7728 KB Output is correct
26 Correct 5 ms 7764 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 7 ms 8020 KB Output is correct
29 Correct 17 ms 10872 KB Output is correct
30 Correct 6 ms 8404 KB Output is correct
31 Correct 11 ms 9252 KB Output is correct
32 Correct 9 ms 8732 KB Output is correct
33 Correct 45 ms 14028 KB Output is correct
34 Correct 39 ms 14112 KB Output is correct
35 Correct 27 ms 10596 KB Output is correct
36 Correct 7 ms 7892 KB Output is correct
37 Correct 47 ms 13640 KB Output is correct
38 Correct 47 ms 12776 KB Output is correct
39 Correct 41 ms 12876 KB Output is correct
40 Correct 42 ms 12748 KB Output is correct
41 Correct 42 ms 12800 KB Output is correct
42 Correct 9 ms 8500 KB Output is correct
43 Correct 12 ms 8344 KB Output is correct
44 Correct 10 ms 8312 KB Output is correct
45 Correct 291 ms 32932 KB Output is correct
46 Correct 262 ms 32920 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 5 ms 7252 KB Output is correct
6 Correct 5 ms 7332 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7348 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 5 ms 7508 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7636 KB Output is correct
15 Correct 5 ms 7636 KB Output is correct
16 Correct 5 ms 7508 KB Output is correct
17 Correct 7 ms 7892 KB Output is correct
18 Correct 5 ms 7508 KB Output is correct
19 Correct 4 ms 7508 KB Output is correct
20 Correct 5 ms 7624 KB Output is correct
21 Correct 4 ms 7444 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 6 ms 7600 KB Output is correct
24 Correct 5 ms 7764 KB Output is correct
25 Correct 5 ms 7636 KB Output is correct
26 Correct 5 ms 7764 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 8 ms 8020 KB Output is correct
29 Correct 20 ms 10852 KB Output is correct
30 Correct 8 ms 8404 KB Output is correct
31 Correct 11 ms 9300 KB Output is correct
32 Correct 9 ms 8728 KB Output is correct
33 Correct 44 ms 13956 KB Output is correct
34 Correct 32 ms 14032 KB Output is correct
35 Correct 27 ms 10572 KB Output is correct
36 Correct 7 ms 7892 KB Output is correct
37 Correct 47 ms 13680 KB Output is correct
38 Correct 41 ms 12716 KB Output is correct
39 Correct 41 ms 12820 KB Output is correct
40 Correct 41 ms 12764 KB Output is correct
41 Correct 45 ms 12784 KB Output is correct
42 Correct 9 ms 8528 KB Output is correct
43 Correct 9 ms 8344 KB Output is correct
44 Correct 11 ms 8312 KB Output is correct
45 Correct 321 ms 32936 KB Output is correct
46 Correct 264 ms 32928 KB Output is correct
47 Correct 430 ms 34960 KB Output is correct
48 Correct 53 ms 15216 KB Output is correct
49 Correct 29 ms 11836 KB Output is correct
50 Correct 27 ms 12252 KB Output is correct
51 Correct 92 ms 18884 KB Output is correct
52 Correct 108 ms 20220 KB Output is correct
53 Correct 26 ms 11348 KB Output is correct
54 Correct 10 ms 9080 KB Output is correct
55 Correct 14 ms 10448 KB Output is correct
56 Correct 29 ms 11068 KB Output is correct
57 Incorrect 226 ms 33908 KB Output isn't correct
58 Halted 0 ms 0 KB -