Submission #109945

#	Time	Username	Problem	Language	Result	Execution time	Memory
109945		PeppaPig	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	0 / 100	4 ms	1196 KiB

skyscraper

#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 3e4+5;
const int M = 2e3+5;

int n, m, st, en;
int d[N], chk[N][M];
vector<int> B[N];

int main() {
    fill_n(d, N, 1e9);
    scanf("%d %d", &n, &m);
    for(int i = 0, b, p; i < m; i++) {
        scanf("%d %d", &b, &p); 
        B[b].emplace_back(p);
        if(i == 0) st = b;
        if(i == 1) en = b;
    }
    for(int i = 0; i < n; i++) {
        sort(B[i].begin(), B[i].end());
        B[i].resize(unique(B[i].begin(), B[i].end()) - B[i].begin());
    }
    priority_queue<pii, vector<pii>, greater<pii> > Q;
    Q.emplace(d[st] = 0, st);
    while(!Q.empty()) {
        pii now = Q.top(); Q.pop();
        if(d[now.y] != now.x) continue;
        int u = now.y;
        for(int p : B[u]) {
            if(p < M && chk[u][p]) continue;
            for(int i = u + p, cnt = 1; i < n; i += p, ++cnt) {
                if(d[i] > d[u] + cnt) {
                    Q.emplace(d[i] = d[u] + cnt, i);
                    if(p < M) chk[i][p] = true;
                }
            }
            for(int i = u - p, cnt = 1; i >= 0; i -= p, ++cnt) {
                if(d[i] > d[u] + cnt) {
                    Q.emplace(d[i] = d[u] + cnt, i);
                    if(p < M) chk[i][p] = true;
                }
            }
        }
    }
    printf("%d\n", d[en]);

    return 0;
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &b, &p); 
         ~~~~~^~~~~~~~~~~~~~~~~

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