oj.uz

Submission #658309

# Submission time Handle Problem Language Result Execution time Memory
658309 2022-11-12T19:23:56 Z ssense Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 347 ms 262144 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r+1]-pref[l];}};//mesanu

int mp[35000][500];
vector<vector<pair<int, int>>> adj;
void cnn(int first, int second)
{
    vector<pair<int, int>> a;
    mp[first][second] = adj.size();
    adj.pb(a);
}

int dijkstra(int s, int e)
{
    int n = adj.size();
        vector<int> d(n, MX);

        d[s] = 0;
        set<pair<int, int>> q;
        q.insert({0, s});
        while (!q.empty()) {
            int v = q.begin()->second;
            q.erase(q.begin());

            for (auto edge : adj[v]) {
                int to = edge.first;
                int len = edge.second;

                if (d[v] + len < d[to]) {
                    q.erase({d[to], to});
                    d[to] = d[v] + len;
                    q.insert({d[to], to});
                }
            }
        }
    return d[e];
}

void solve()
{
    int n, m;
    cin >> n >> m;
    int start = -1;
    int end = -1;
    int th = sqrt(n);
    vector<pair<int, int>> ph;
    adj.pb(ph);
    for(int i = 0; i < n; i++)
    {
        cnn(i, 0);
    }
    for(int sky = 0; sky < n; sky++)
    {
        for(int power = 1; power <= th; power++)
        {
            cnn(sky, power);
        }
    }
    for(int sky = 0; sky < n; sky++)
    {
        for(int power = 1; power <= th; power++)
        {
            adj[mp[sky][power]].pb({mp[sky][0], 0});
            if(sky-power >= 0)
            {
                adj[mp[sky][power]].pb({mp[sky-power][power], 1});
            }
            if(sky+power < n)
            {
                adj[mp[sky][power]].pb({mp[sky+power][power], 1});
            }
        }
    }
    for(int i = 0; i < m; i++)
    {
        int sky, power;
        cin >> sky >> power;
        if(i == 0)
        {
            start = sky;
        }
        if(i == 1)
        {
            end = sky;
        }
        if(power <= th)
        {
            adj[mp[sky][0]].pb({mp[sky][power], 0});
        }
        else
        {
            for(int j = sky%power; j < n; j+=power)
            {
                adj[mp[sky][0]].pb({mp[j][0], abs(sky-j)/power});
            }
        }
    }
    int dist = dijkstra(mp[start][0], mp[end][0]);
    if(dist == MX)
    {
        cout << -1 << endl;
    }
    else
    {
        cout << dist << endl;
    }
}

int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}


/*
5 3
0 2
1 1
4 1
 */

Compilation message

skyscraper.cpp: In member function 'void prefix_sum::build(std::vector<int>)':
skyscraper.cpp:20:667: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r+1]-pref[l];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 552 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 8 ms 3384 KB Output is correct
18 Correct 12 ms 9072 KB Output is correct
19 Correct 14 ms 10820 KB Output is correct
20 Correct 14 ms 10832 KB Output is correct
21 Correct 2 ms 1684 KB Output is correct
22 Correct 12 ms 9372 KB Output is correct
23 Correct 11 ms 8136 KB Output is correct
24 Correct 15 ms 10260 KB Output is correct
25 Correct 14 ms 10820 KB Output is correct
26 Correct 14 ms 10820 KB Output is correct
27 Correct 13 ms 10768 KB Output is correct
28 Correct 15 ms 10856 KB Output is correct
29 Correct 24 ms 10820 KB Output is correct
30 Correct 16 ms 10808 KB Output is correct
31 Correct 19 ms 10796 KB Output is correct
32 Correct 18 ms 11040 KB Output is correct
33 Correct 29 ms 11332 KB Output is correct
34 Correct 27 ms 11332 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 5 ms 3404 KB Output is correct
18 Correct 11 ms 9156 KB Output is correct
19 Correct 13 ms 10840 KB Output is correct
20 Correct 15 ms 10820 KB Output is correct
21 Correct 2 ms 1684 KB Output is correct
22 Correct 12 ms 9340 KB Output is correct
23 Correct 10 ms 8136 KB Output is correct
24 Correct 15 ms 10180 KB Output is correct
25 Correct 14 ms 10820 KB Output is correct
26 Correct 14 ms 10812 KB Output is correct
27 Correct 17 ms 10852 KB Output is correct
28 Correct 16 ms 10948 KB Output is correct
29 Correct 29 ms 10784 KB Output is correct
30 Correct 19 ms 10820 KB Output is correct
31 Correct 21 ms 10832 KB Output is correct
32 Correct 16 ms 10948 KB Output is correct
33 Correct 30 ms 11292 KB Output is correct
34 Correct 28 ms 11300 KB Output is correct
35 Correct 21 ms 8064 KB Output is correct
36 Correct 8 ms 5324 KB Output is correct
37 Correct 40 ms 12024 KB Output is correct
38 Correct 37 ms 12240 KB Output is correct
39 Correct 40 ms 12276 KB Output is correct
40 Correct 34 ms 12288 KB Output is correct
41 Correct 46 ms 12264 KB Output is correct
42 Correct 19 ms 11260 KB Output is correct
43 Correct 22 ms 11264 KB Output is correct
44 Correct 17 ms 11204 KB Output is correct
45 Correct 38 ms 15192 KB Output is correct
46 Correct 41 ms 15136 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 5 ms 3404 KB Output is correct
18 Correct 11 ms 9156 KB Output is correct
19 Correct 13 ms 10820 KB Output is correct
20 Correct 14 ms 10872 KB Output is correct
21 Correct 2 ms 1684 KB Output is correct
22 Correct 12 ms 9412 KB Output is correct
23 Correct 11 ms 8152 KB Output is correct
24 Correct 14 ms 10180 KB Output is correct
25 Correct 15 ms 10820 KB Output is correct
26 Correct 14 ms 10836 KB Output is correct
27 Correct 14 ms 10820 KB Output is correct
28 Correct 15 ms 10880 KB Output is correct
29 Correct 24 ms 10820 KB Output is correct
30 Correct 17 ms 10820 KB Output is correct
31 Correct 19 ms 10848 KB Output is correct
32 Correct 17 ms 10948 KB Output is correct
33 Correct 30 ms 11304 KB Output is correct
34 Correct 30 ms 11308 KB Output is correct
35 Correct 25 ms 8040 KB Output is correct
36 Correct 9 ms 5320 KB Output is correct
37 Correct 35 ms 12064 KB Output is correct
38 Correct 35 ms 12184 KB Output is correct
39 Correct 36 ms 12216 KB Output is correct
40 Correct 41 ms 12236 KB Output is correct
41 Correct 36 ms 12228 KB Output is correct
42 Correct 18 ms 11240 KB Output is correct
43 Correct 17 ms 11232 KB Output is correct
44 Correct 17 ms 11248 KB Output is correct
45 Correct 40 ms 15264 KB Output is correct
46 Correct 40 ms 15036 KB Output is correct
47 Correct 347 ms 131404 KB Output is correct
48 Runtime error 346 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -