oj.uz

Submission #948396

# Submission time Handle Problem Language Result Execution time Memory
948396 2024-03-18T05:15:28 Z steveonalex Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 60372 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];
 
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 ans = INF;
    map<pair<int, int>, int> dis;
    deque<pair<int, int>> q;
    q.push_back(dog0); dis[dog0] = 0;
    while(q.size()){
        pair<int, int> u = q.front(); q.pop_front();
        int d = dis[u];

        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.count(v)) {
                dis[v] = 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.count(v)) {
                        dis[v] = 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 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1168 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1180 KB Output is correct
14 Correct 3 ms 1372 KB Output is correct
15 Correct 2 ms 1304 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1168 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1176 KB Output is correct
14 Correct 3 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1172 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 1 ms 1180 KB Output is correct
22 Correct 1 ms 1368 KB Output is correct
23 Correct 3 ms 1372 KB Output is correct
24 Correct 4 ms 1372 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 9 ms 2388 KB Output is correct
29 Correct 33 ms 4816 KB Output is correct
30 Correct 8 ms 2140 KB Output is correct
31 Correct 16 ms 3164 KB Output is correct
32 Correct 11 ms 2596 KB Output is correct
33 Correct 85 ms 8444 KB Output is correct
34 Correct 35 ms 5212 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1180 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 1556 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 2 ms 1624 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 3 ms 1372 KB Output is correct
24 Correct 4 ms 1372 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 3 ms 1368 KB Output is correct
28 Correct 9 ms 2396 KB Output is correct
29 Correct 32 ms 4948 KB Output is correct
30 Correct 8 ms 2284 KB Output is correct
31 Correct 16 ms 3164 KB Output is correct
32 Correct 11 ms 2652 KB Output is correct
33 Correct 73 ms 8532 KB Output is correct
34 Correct 35 ms 5208 KB Output is correct
35 Correct 16 ms 3160 KB Output is correct
36 Correct 2 ms 1116 KB Output is correct
37 Correct 12 ms 3164 KB Output is correct
38 Correct 12 ms 2908 KB Output is correct
39 Correct 7 ms 1884 KB Output is correct
40 Correct 7 ms 1952 KB Output is correct
41 Correct 9 ms 2140 KB Output is correct
42 Correct 5 ms 1624 KB Output is correct
43 Correct 5 ms 1884 KB Output is correct
44 Correct 4 ms 1628 KB Output is correct
45 Correct 479 ms 31696 KB Output is correct
46 Correct 197 ms 19028 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1180 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1268 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 2 ms 1372 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1196 KB Output is correct
23 Correct 3 ms 1372 KB Output is correct
24 Correct 4 ms 1372 KB Output is correct
25 Correct 1 ms 1192 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 9 ms 2392 KB Output is correct
29 Correct 32 ms 4948 KB Output is correct
30 Correct 8 ms 2140 KB Output is correct
31 Correct 19 ms 3164 KB Output is correct
32 Correct 11 ms 2652 KB Output is correct
33 Correct 73 ms 8640 KB Output is correct
34 Correct 35 ms 5168 KB Output is correct
35 Correct 14 ms 3160 KB Output is correct
36 Correct 2 ms 1244 KB Output is correct
37 Correct 12 ms 3104 KB Output is correct
38 Correct 11 ms 2908 KB Output is correct
39 Correct 7 ms 1648 KB Output is correct
40 Correct 7 ms 1944 KB Output is correct
41 Correct 9 ms 2140 KB Output is correct
42 Correct 5 ms 1628 KB Output is correct
43 Correct 5 ms 1884 KB Output is correct
44 Correct 4 ms 1624 KB Output is correct
45 Correct 474 ms 31960 KB Output is correct
46 Correct 189 ms 19092 KB Output is correct
47 Correct 11 ms 2904 KB Output is correct
48 Correct 6 ms 1884 KB Output is correct
49 Correct 6 ms 1836 KB Output is correct
50 Correct 4 ms 1628 KB Output is correct
51 Correct 32 ms 5204 KB Output is correct
52 Correct 44 ms 6112 KB Output is correct
53 Correct 10 ms 2648 KB Output is correct
54 Correct 5 ms 1884 KB Output is correct
55 Correct 11 ms 2648 KB Output is correct
56 Correct 19 ms 4444 KB Output is correct
57 Correct 1 ms 1112 KB Output is correct
58 Correct 30 ms 5724 KB Output is correct
59 Correct 26 ms 5120 KB Output is correct
60 Correct 27 ms 5184 KB Output is correct
61 Correct 25 ms 4948 KB Output is correct
62 Correct 310 ms 29520 KB Output is correct
63 Execution timed out 1029 ms 60372 KB Time limit exceeded
64 Halted 0 ms 0 KB -