제출 #658166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
658166		ssense	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1086 ms	2732 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]-pref[l-1];}};//mesanu

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n, vector<int>());
    vint p(m);
    vector<int> dist(n, MX);
    int fin = 0;
    deque<int> changed;
    for(int i = 0; i < m; i++)
    {
        int x, b;
        cin >> x >> b;
        p[i] = b;
        a[x].pb(i);
        if(i == 0)
        {
            changed.pb(x);
            dist[x] = 0;
        }
        if(i == 1)
        {
            fin = x;
        }
    }
    for(int bruh = 0; bruh <= n; bruh++)
    {
        int nr = changed.size();
        for(int lrn = 0; lrn < changed.size(); lrn++)
        {
            int i = changed.front();
            for(int j = 0; j < a[i].size(); j++)
            {
                if(j == 0 || p[a[i][j]] != p[a[i][j-1]])
                {
                    for(int now = i%p[a[i][j]]; now < n; now+=p[a[i][j]])
                    {
                        if(dist[i]+abs(now-i)/p[a[i][j]] < dist[now])
                        {
                            changed.push_back(now);
                            dist[now] = dist[i]+abs(now-i)/p[a[i][j]];
                        }
                    }
                }
            }
            changed.pop_front();
        }
        if(changed.size() == 0)
        {
            break;
        }
    }
    if(dist[fin] == MX)
    {
        cout << -1 << endl;
    }
    else
    {
        cout << dist[fin] << 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<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]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:50:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         for(int lrn = 0; lrn < changed.size(); lrn++)
      |                          ~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:53:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             for(int j = 0; j < a[i].size(); j++)
      |                            ~~^~~~~~~~~~~~~
skyscraper.cpp:49:13: warning: unused variable 'nr' [-Wunused-variable]
   49 |         int nr = changed.size();
      |             ^~

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 21 / 21
• Subtask 5: 0 / 43