oj.uz

답안 #544550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544550 2022-04-02T09:44:14 Z SavicS Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 344 ms 30388 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 ll inf = 1e18 + 5;
const int mxN = 30005; 

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

vector<pii> g[mxN];
ll 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<pll, vector<pll>, greater<pll>> pq;

    pq.push({dist[S] = 0, S});
    while(sz(pq)){
        pll 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 2516 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 3 ms 2644 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 2 ms 2388 KB Output is correct
7 Correct 2 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 1 ms 2388 KB Output is correct
11 Correct 2 ms 2516 KB Output is correct
12 Correct 1 ms 2516 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 3 ms 2644 KB Output is correct
16 Correct 2 ms 2516 KB Output is correct
17 Correct 4 ms 3028 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 3 ms 2516 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 3 ms 2644 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 3 ms 2900 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 4 ms 3028 KB Output is correct
29 Correct 14 ms 6228 KB Output is correct
30 Correct 4 ms 3540 KB Output is correct
31 Correct 8 ms 4436 KB Output is correct
32 Correct 5 ms 3796 KB Output is correct
33 Correct 30 ms 9260 KB Output is correct
34 Correct 29 ms 9292 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 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 2 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 2516 KB Output is correct
13 Correct 1 ms 2516 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2516 KB Output is correct
17 Correct 4 ms 2968 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 3 ms 2644 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 3 ms 2900 KB Output is correct
27 Correct 3 ms 2772 KB Output is correct
28 Correct 4 ms 3028 KB Output is correct
29 Correct 15 ms 6104 KB Output is correct
30 Correct 4 ms 3540 KB Output is correct
31 Correct 8 ms 4436 KB Output is correct
32 Correct 5 ms 3796 KB Output is correct
33 Correct 33 ms 9296 KB Output is correct
34 Correct 30 ms 9368 KB Output is correct
35 Correct 22 ms 5708 KB Output is correct
36 Correct 5 ms 3028 KB Output is correct
37 Correct 43 ms 8756 KB Output is correct
38 Correct 39 ms 7872 KB Output is correct
39 Correct 39 ms 8040 KB Output is correct
40 Correct 40 ms 7976 KB Output is correct
41 Correct 39 ms 7940 KB Output is correct
42 Correct 7 ms 3500 KB Output is correct
43 Correct 7 ms 3420 KB Output is correct
44 Correct 6 ms 3448 KB Output is correct
45 Correct 254 ms 28044 KB Output is correct
46 Correct 262 ms 28004 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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 2 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 2516 KB Output is correct
13 Correct 1 ms 2516 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 3 ms 2644 KB Output is correct
16 Correct 2 ms 2516 KB Output is correct
17 Correct 4 ms 2960 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2516 KB Output is correct
20 Correct 3 ms 2644 KB Output is correct
21 Correct 2 ms 2516 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 3 ms 2900 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 3 ms 2900 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 4 ms 3152 KB Output is correct
29 Correct 15 ms 6076 KB Output is correct
30 Correct 5 ms 3540 KB Output is correct
31 Correct 8 ms 4436 KB Output is correct
32 Correct 6 ms 3796 KB Output is correct
33 Correct 29 ms 9268 KB Output is correct
34 Correct 30 ms 9292 KB Output is correct
35 Correct 24 ms 5660 KB Output is correct
36 Correct 4 ms 3028 KB Output is correct
37 Correct 48 ms 8764 KB Output is correct
38 Correct 37 ms 7924 KB Output is correct
39 Correct 40 ms 8036 KB Output is correct
40 Correct 38 ms 8012 KB Output is correct
41 Correct 39 ms 8012 KB Output is correct
42 Correct 9 ms 3536 KB Output is correct
43 Correct 6 ms 3420 KB Output is correct
44 Correct 6 ms 3448 KB Output is correct
45 Correct 256 ms 28032 KB Output is correct
46 Correct 281 ms 27904 KB Output is correct
47 Correct 344 ms 30388 KB Output is correct
48 Correct 46 ms 10316 KB Output is correct
49 Correct 24 ms 6988 KB Output is correct
50 Correct 26 ms 7428 KB Output is correct
51 Correct 93 ms 14488 KB Output is correct
52 Correct 102 ms 15892 KB Output is correct
53 Correct 18 ms 7024 KB Output is correct
54 Correct 5 ms 4308 KB Output is correct
55 Correct 9 ms 5852 KB Output is correct
56 Correct 17 ms 6480 KB Output is correct
57 Incorrect 226 ms 30176 KB Output isn't correct
58 Halted 0 ms 0 KB -