oj.uz

Submission #948411

# Submission time Handle Problem Language Result Execution time Memory
948411 2024-03-18T05:27:43 Z steveonalex Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 3 ms 4748 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;
    }

    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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2464 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 3 ms 4748 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2564 KB Output is correct
4 Runtime error 3 ms 4696 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Runtime error 3 ms 4700 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory 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 Runtime error 3 ms 4700 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

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 2392 KB Output is correct
4 Runtime error 3 ms 4696 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -