oj.uz

답안 #948592

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948592 2024-03-18T08:08:42 Z steveonalex Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 35836 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) - pos[j].begin();
    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()) {
        vector<int> sigma = pos[i]; pos[i].clear();
        remove_dup(sigma);
 
        for(int j: sigma){
            for(int k = j; k < n; k += i) {
                pos[i].push_back(k);
            }
        }
        sort(ALL(pos[i]));
        dis[i].resize(pos[i].size(), 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 > 6e6) 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 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 2472 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 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 2648 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 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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2392 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 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 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 2 ms 2396 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2596 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 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 3 ms 2652 KB Output is correct
24 Correct 3 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 5 ms 2836 KB Output is correct
29 Correct 15 ms 3096 KB Output is correct
30 Correct 5 ms 2648 KB Output is correct
31 Correct 10 ms 2676 KB Output is correct
32 Correct 7 ms 2652 KB Output is correct
33 Correct 29 ms 3420 KB Output is correct
34 Correct 18 ms 3416 KB Output is correct

Subtask #4
21.0 / 21.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 2392 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 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 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 2692 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 1 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 2652 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 3 ms 2652 KB Output is correct
25 Correct 2 ms 2584 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 6 ms 2652 KB Output is correct
29 Correct 15 ms 2908 KB Output is correct
30 Correct 5 ms 2652 KB Output is correct
31 Correct 8 ms 2868 KB Output is correct
32 Correct 6 ms 2784 KB Output is correct
33 Correct 29 ms 3420 KB Output is correct
34 Correct 18 ms 3420 KB Output is correct
35 Correct 11 ms 3932 KB Output is correct
36 Correct 3 ms 2652 KB Output is correct
37 Correct 13 ms 4528 KB Output is correct
38 Correct 14 ms 4700 KB Output is correct
39 Correct 13 ms 4444 KB Output is correct
40 Correct 13 ms 4552 KB Output is correct
41 Correct 13 ms 4444 KB Output is correct
42 Correct 5 ms 2648 KB Output is correct
43 Correct 5 ms 2652 KB Output is correct
44 Correct 5 ms 2908 KB Output is correct
45 Correct 118 ms 7372 KB Output is correct
46 Correct 70 ms 7252 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2392 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 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 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 1 ms 2396 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 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 2 ms 2648 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 3 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2648 KB Output is correct
28 Correct 5 ms 2652 KB Output is correct
29 Correct 15 ms 2908 KB Output is correct
30 Correct 5 ms 2724 KB Output is correct
31 Correct 8 ms 2648 KB Output is correct
32 Correct 6 ms 2648 KB Output is correct
33 Correct 29 ms 3420 KB Output is correct
34 Correct 18 ms 3624 KB Output is correct
35 Correct 11 ms 3932 KB Output is correct
36 Correct 3 ms 2648 KB Output is correct
37 Correct 13 ms 4696 KB Output is correct
38 Correct 14 ms 4700 KB Output is correct
39 Correct 14 ms 4512 KB Output is correct
40 Correct 13 ms 4604 KB Output is correct
41 Correct 14 ms 4444 KB Output is correct
42 Correct 5 ms 2652 KB Output is correct
43 Correct 5 ms 2652 KB Output is correct
44 Correct 5 ms 2908 KB Output is correct
45 Correct 117 ms 7172 KB Output is correct
46 Correct 69 ms 7376 KB Output is correct
47 Correct 32 ms 10064 KB Output is correct
48 Correct 15 ms 5724 KB Output is correct
49 Correct 11 ms 4884 KB Output is correct
50 Correct 9 ms 4700 KB Output is correct
51 Correct 27 ms 7080 KB Output is correct
52 Correct 25 ms 7236 KB Output is correct
53 Correct 11 ms 4188 KB Output is correct
54 Correct 5 ms 2648 KB Output is correct
55 Correct 5 ms 2908 KB Output is correct
56 Correct 15 ms 4100 KB Output is correct
57 Correct 18 ms 5980 KB Output is correct
58 Correct 14 ms 3160 KB Output is correct
59 Correct 13 ms 3420 KB Output is correct
60 Correct 13 ms 3932 KB Output is correct
61 Correct 14 ms 3696 KB Output is correct
62 Correct 90 ms 8532 KB Output is correct
63 Correct 697 ms 22612 KB Output is correct
64 Correct 915 ms 26608 KB Output is correct
65 Execution timed out 1064 ms 35836 KB Time limit exceeded
66 Halted 0 ms 0 KB -