제출 #1113076

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1113076		adaawf	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	859 ms	2640 KiB

skyscraper

#include <iostream>
#include <vector>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
using namespace std;
vector<int> g[30005];
int f[30005], da[30005];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m, h, k;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        if (i == 1) h = x;
        if (i == 2) k = x;
        g[x].push_back(y);
    }
    for (int i = 0; i < n; i++) f[i] = 1e9;
    f[h] = 0;
    for (int jj = 0; jj < n; jj++) {
        int p, mi = 1e9;
        for (int i = 0; i < n; i++) {
            if (da[i] == 0 && mi > f[i]) {
                mi = f[i];
                p = i;
            }
        }
        if (p == k) break;
        da[p] = 1;
        for (int w : g[p]) {
            int l = 0;
            for (int j = p - w; j >= 0; j -= w) {
                f[j] = min(f[j], f[p] + l + 1);
                l++;
            }
            l = 0;
            for (int j = p + w; j < n; j += w) {
                f[j] = min(f[j], f[p] + l + 1);
                l++;
            }
        }
    }
    if (f[k] == 1e9) cout << -1;
    else cout << f[k];
}

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

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:40:37: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
   40 |                 f[j] = min(f[j], f[p] + l + 1);
      |                                  ~~~^
skyscraper.cpp:30:9: warning: 'k' may be used uninitialized in this function [-Wmaybe-uninitialized]
   30 |         if (p == k) break;
      |         ^~
skyscraper.cpp:21:10: warning: 'h' may be used uninitialized in this function [-Wmaybe-uninitialized]
   21 |     f[h] = 0;
      |     ~~~~~^~~

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