oj.uz

Submission #948402

# Submission time Handle Problem Language Result Execution time Memory
948402 2024-03-18T05:20:04 Z steveonalex Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 80112 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];
map<int, int> dis[N];
 
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;
    }

    pair<int, int> dog0 = dog[0], dog1 = dog[1];

    remove_dup(dog);

    for(auto i: dog) a[i.first].push_back(i.second);

    int o_cnt = 0;
    int ans = INF;
    deque<pair<int, int>> q;
    q.push_back(dog0); dis[dog0.first][dog0.second] = 0;
    while(q.size()){
        pair<int, int> u = q.front(); q.pop_front();
        int d = dis[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;
            if (!dis[v.first].count(v.second)) {
                dis[v.first][v.second] = 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;
                    if (!dis[v.first].count(v.second)) {
                        dis[v.first][v.second] = d + 1;
                        q.push_back(v);
                    }
                }
            }
        }
    }

    if (ans == INF) cout << -1 << "\n";
    else cout << ans << "\n";

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 2392 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

# Verdict Execution time Memory 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 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 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2600 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2320 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 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 3 ms 2804 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 2396 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 1 ms 2648 KB Output is correct
23 Correct 3 ms 2648 KB Output is correct
24 Correct 2 ms 2904 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 2808 KB Output is correct
28 Correct 4 ms 3420 KB Output is correct
29 Correct 11 ms 5212 KB Output is correct
30 Correct 3 ms 3164 KB Output is correct
31 Correct 6 ms 3932 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 26 ms 7988 KB Output is correct
34 Correct 13 ms 5468 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 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 2396 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 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 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 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 2396 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2908 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 4 ms 3420 KB Output is correct
29 Correct 11 ms 5212 KB Output is correct
30 Correct 3 ms 3164 KB Output is correct
31 Correct 6 ms 3932 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 25 ms 8088 KB Output is correct
34 Correct 12 ms 5720 KB Output is correct
35 Correct 10 ms 4188 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 8 ms 3932 KB Output is correct
38 Correct 9 ms 3596 KB Output is correct
39 Correct 7 ms 2908 KB Output is correct
40 Correct 7 ms 3164 KB Output is correct
41 Correct 8 ms 3164 KB Output is correct
42 Correct 4 ms 2908 KB Output is correct
43 Correct 5 ms 2908 KB Output is correct
44 Correct 5 ms 2908 KB Output is correct
45 Correct 201 ms 25480 KB Output is correct
46 Correct 83 ms 15904 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory 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 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 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 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2908 KB Output is correct
25 Correct 2 ms 2536 KB Output is correct
26 Correct 2 ms 2648 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 4 ms 3420 KB Output is correct
29 Correct 11 ms 5284 KB Output is correct
30 Correct 3 ms 3164 KB Output is correct
31 Correct 6 ms 3932 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 25 ms 8192 KB Output is correct
34 Correct 13 ms 5464 KB Output is correct
35 Correct 10 ms 4188 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 8 ms 4020 KB Output is correct
38 Correct 9 ms 3676 KB Output is correct
39 Correct 8 ms 2908 KB Output is correct
40 Correct 7 ms 3160 KB Output is correct
41 Correct 8 ms 3164 KB Output is correct
42 Correct 4 ms 2908 KB Output is correct
43 Correct 5 ms 2908 KB Output is correct
44 Correct 5 ms 2908 KB Output is correct
45 Correct 212 ms 25424 KB Output is correct
46 Correct 88 ms 15864 KB Output is correct
47 Correct 9 ms 3932 KB Output is correct
48 Correct 6 ms 3128 KB Output is correct
49 Correct 6 ms 3164 KB Output is correct
50 Correct 4 ms 2908 KB Output is correct
51 Correct 15 ms 5636 KB Output is correct
52 Correct 17 ms 5980 KB Output is correct
53 Correct 9 ms 3676 KB Output is correct
54 Correct 2 ms 3164 KB Output is correct
55 Correct 3 ms 3676 KB Output is correct
56 Correct 11 ms 4956 KB Output is correct
57 Correct 2 ms 2652 KB Output is correct
58 Correct 9 ms 5744 KB Output is correct
59 Correct 9 ms 5468 KB Output is correct
60 Correct 9 ms 5468 KB Output is correct
61 Correct 9 ms 5212 KB Output is correct
62 Correct 113 ms 24024 KB Output is correct
63 Execution timed out 1035 ms 80112 KB Time limit exceeded
64 Halted 0 ms 0 KB -