제출 #658280

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
658280		ssense	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	0 / 100	1 ms	212 KiB

skyscraper

#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

map<pair<int, int> , int> mp;
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 u = q.begin()->second;
        q.erase(q.begin());
        for(auto v : adj[u])
        {
            if(d[v.fr] > d[u]+v.sc)
            {
                q.erase({d[v.fr], v.fr});
                d[v.fr] = d[u]+v.sc;
                q.insert({d[u]+v.sc, v.fr});
            }
        }
    }
    return d[e];
}

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

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


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

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
skyscraper.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long 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: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43