oj.uz

답안 #948670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948670 2024-03-18T10:21:52 Z steveonalex Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 415 ms 32160 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
const int N = 3e4;
const int INF = 1e9 + 69;
 
int n, m;
vector<int> a[N];
bool activated[N];
vector<int> pos[N];
vector<int> dis[N];
 
int& get(int i, int j){
    int idx = lower_bound(ALL(pos[j]), i % j) - pos[j].begin();
    idx += pos[j].size() * (i / j);
    return dis[j][idx];
}
 
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    cin >> n >> m;
    vector<pair<int, int>> dog(m);
    for(int i = 0; i<m; ++i){
        cin >> dog[i].first >> dog[i].second;
        minimize(dog[i].second, n);
    }
 
    pair<int, int> dog0 = dog[0], dog1 = dog[1];
 
    remove_dup(dog);
 
    for(auto i: dog) {
        a[i.first].push_back(i.second);
        pos[i.second].push_back(i.first % i.second);
    }
 
    for(int i = 1; i<=n; ++i) if (pos[i].size()) {
        remove_dup(pos[i]);
        dis[i].resize(pos[i].size() * (n / i + 1), INF);
    }
 
    int o_cnt = 0;
    int ans = INF;
    deque<pair<int, int>> q;
    q.push_back(dog0); 
    get(dog0.first, dog0.second) = 0;
    while(q.size()){
        pair<int, int> u = q.front(); q.pop_front();
        int &d = get(u.first,u.second);
 
        o_cnt++;
        if (o_cnt > 1e7) exit(1);
 
        if (u.first == dog1.first) {
            minimize(ans, d);
            break;
        }
 
        for(int i = -u.second; i <= u.second; i += u.second * 2) {
            pair<int, int> v = {u.first + i, u.second};
            if (v.first < 0 || v.first >= n) continue;
            int &cu = get(v.first, v.second);
            if (minimize(cu, d + 1)) {
                q.push_back(v);
            }
        }
        if (!activated[u.first]){
            activated[u.first] = true;
            for(int j: a[u.first]){
                for(int i = -j; i <= j; i += j * 2) {
                    pair<int, int> v = {u.first + i, j};
                    if (v.first < 0 || v.first >= n) continue;
                    int &cu = get(v.first, v.second);
                    if (minimize(cu, d + 1)) {
                        q.push_back(v);
                    }
                }
            }
        }
    }
 
    if (ans == INF) cout << -1 << "\n";
    else cout << ans << "\n";
 
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2568 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2568 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2576 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2580 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 4 ms 2652 KB Output is correct
30 Correct 2 ms 2648 KB Output is correct
31 Correct 3 ms 2648 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 6 ms 2908 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2576 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2580 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 6 ms 3140 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 8 ms 3668 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 7 ms 3872 KB Output is correct
38 Correct 10 ms 4188 KB Output is correct
39 Correct 9 ms 4188 KB Output is correct
40 Correct 9 ms 4184 KB Output is correct
41 Correct 9 ms 4188 KB Output is correct
42 Correct 5 ms 3024 KB Output is correct
43 Correct 5 ms 2904 KB Output is correct
44 Correct 5 ms 2908 KB Output is correct
45 Correct 34 ms 5816 KB Output is correct
46 Correct 22 ms 5720 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 1 ms 2584 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2580 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2580 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2392 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 3 ms 2648 KB Output is correct
29 Correct 3 ms 2652 KB Output is correct
30 Correct 2 ms 2648 KB Output is correct
31 Correct 3 ms 2808 KB Output is correct
32 Correct 2 ms 2648 KB Output is correct
33 Correct 6 ms 2908 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 8 ms 3652 KB Output is correct
36 Correct 3 ms 2652 KB Output is correct
37 Correct 7 ms 3928 KB Output is correct
38 Correct 9 ms 4188 KB Output is correct
39 Correct 9 ms 4188 KB Output is correct
40 Correct 9 ms 4188 KB Output is correct
41 Correct 9 ms 4188 KB Output is correct
42 Correct 5 ms 3028 KB Output is correct
43 Correct 5 ms 2908 KB Output is correct
44 Correct 5 ms 3100 KB Output is correct
45 Correct 39 ms 5720 KB Output is correct
46 Correct 22 ms 5724 KB Output is correct
47 Correct 10 ms 6492 KB Output is correct
48 Correct 9 ms 5048 KB Output is correct
49 Correct 9 ms 4444 KB Output is correct
50 Correct 7 ms 4188 KB Output is correct
51 Correct 15 ms 5976 KB Output is correct
52 Correct 15 ms 6164 KB Output is correct
53 Correct 10 ms 4444 KB Output is correct
54 Correct 2 ms 2648 KB Output is correct
55 Correct 2 ms 2652 KB Output is correct
56 Correct 9 ms 4188 KB Output is correct
57 Correct 3 ms 4184 KB Output is correct
58 Correct 6 ms 3160 KB Output is correct
59 Correct 6 ms 3420 KB Output is correct
60 Correct 6 ms 3420 KB Output is correct
61 Correct 7 ms 3580 KB Output is correct
62 Correct 21 ms 6236 KB Output is correct
63 Correct 188 ms 12572 KB Output is correct
64 Correct 223 ms 14564 KB Output is correct
65 Correct 348 ms 19500 KB Output is correct
66 Correct 415 ms 32160 KB Output is correct
67 Correct 239 ms 32156 KB Output is correct