oj.uz

Submission #52630

# Submission time Handle Problem Language Result Execution time Memory
52630 2018-06-26T10:00:39 Z chpipis Jakarta Skyscrapers (APIO15_skyscraper) C++11
57 / 100
 1000 ms 25328 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define iter(v, i) for (__typeof__((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define fast_io_without_cstdio ios_base::sync_with_stdio(false), cin.tie(NULL)
#define all(v) (v).begin(), (v).end()
#define rep(i, s, e) for (int i = s; i < e; i++)

// START for segment tree
#define params int p, int L, int R
#define housekeep int mid = (L + R) >> 1, left = p << 1, right = left | 1
// END

#ifdef __linux__
#define gc getchar_unlocked
#define pc putchar_unlocked
#else
#define gc getchar
#define pc putchar
#endif

#if __cplusplus <= 199711L
template<class BidirIt>
BidirIt prev(BidirIt it, typename iterator_traits<BidirIt>::difference_type n = 1) {
    advance(it, -n);
    return it;
}

template<class ForwardIt>
ForwardIt next(ForwardIt it, typename iterator_traits<ForwardIt>::difference_type n = 1) {
    advance(it, n);
    return it;
}
#endif

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ldouble;

const double EPS = 1e-9;
const double PI = 3.141592653589793238462;

template<typename T>
inline T sq(T a) { return a * a; }

//#ifdef LOCAL_MACHINE
//#endif

const int SIZE = 175;
const int MAXN = 3e4 + 5;
const int INF = 1e9;

int dist[MAXN][SIZE];
priority_queue<pair<int, ii>, vector<pair<int, ii> >, greater<pair<int, ii> > > pq;
vi vec[MAXN];

void relax(int i, int x, int d) {
    if (dist[i][x] <= d) return;
    dist[i][x] = d;
    pq.push(mp(d, mp(i, x)));
}

int main() {
    //freopen("", "r", stdin);
    //freopen("", "w", stdout);
    int n, m, st = -1, en = -1;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < m; i++) {
        int b, p;
        scanf("%d %d", &b, &p);
        vec[b].pb(p);
        if (i == 0) st = b;
        if (i == 1) en = b;
    }
    for (int i = 0; i <= n; i++)
        for (int j = 0; j < SIZE; j++)
            dist[i][j] = INF;
    dist[st][0] = 0;
    pq.push(mp(0, mp(st, 0)));
    int ans = INF;
    while (!pq.empty()) {
        int w = pq.top().fi;
        int u = pq.top().se.fi;
        int x = pq.top().se.se;
        pq.pop();

        if (u == en) {
            ans = min(ans, w);
            continue;
        }
        if (w >= ans) continue;
        if (dist[u][x] < w) continue;

        if (x == 0) {
            for (auto it : vec[u]) {
                if (it < SIZE) {
                    relax(u, it, w);
                } else {
                    for (int v = u + it; v < n; v += it) {
                        relax(v, 0, w + (v - u) / it);
                    }
                    for (int v = u - it; v >= 0; v -= it) {
                        relax(v, 0, w + (u - v) / it);
                    }
                }
            }
        } else {
            relax(u, 0, w);
            if (u + x < n)
                relax(u + x, x, w + 1);
            if (u - x >= 0)
                relax(u - x, x, w + 1);
        }
    }
    //int ans = *min_element(dist[en], dist[en] + SIZE);
    if (ans == INF)
        puts("-1");
    else
        printf("%d\n", ans);
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:75: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:78: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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 2 ms 1168 KB Output is correct
3 Correct 2 ms 1192 KB Output is correct
4 Correct 2 ms 1384 KB Output is correct
5 Correct 2 ms 1384 KB Output is correct
6 Correct 3 ms 1384 KB Output is correct
7 Correct 3 ms 1384 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1408 KB Output is correct
2 Correct 3 ms 1408 KB Output is correct
3 Correct 3 ms 1408 KB Output is correct
4 Correct 2 ms 1408 KB Output is correct
5 Correct 2 ms 1408 KB Output is correct
6 Correct 3 ms 1408 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1408 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 3 ms 1408 KB Output is correct
12 Correct 4 ms 1508 KB Output is correct
13 Correct 3 ms 1508 KB Output is correct
14 Correct 4 ms 1508 KB Output is correct
15 Correct 4 ms 1508 KB Output is correct
16 Correct 3 ms 1508 KB Output is correct
17 Correct 3 ms 1788 KB Output is correct
18 Correct 4 ms 2428 KB Output is correct
19 Correct 5 ms 2684 KB Output is correct
20 Correct 5 ms 2684 KB Output is correct
21 Correct 3 ms 2684 KB Output is correct
22 Correct 5 ms 2684 KB Output is correct
23 Correct 6 ms 2684 KB Output is correct
24 Correct 6 ms 2684 KB Output is correct
25 Correct 6 ms 2684 KB Output is correct
26 Correct 4 ms 2684 KB Output is correct
27 Correct 5 ms 2776 KB Output is correct
28 Correct 5 ms 2776 KB Output is correct
29 Correct 13 ms 2776 KB Output is correct
30 Correct 7 ms 2776 KB Output is correct
31 Correct 9 ms 2776 KB Output is correct
32 Correct 8 ms 2776 KB Output is correct
33 Correct 22 ms 2776 KB Output is correct
34 Correct 15 ms 2776 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2776 KB Output is correct
2 Correct 2 ms 2776 KB Output is correct
3 Correct 3 ms 2776 KB Output is correct
4 Correct 3 ms 2776 KB Output is correct
5 Correct 3 ms 2776 KB Output is correct
6 Correct 3 ms 2776 KB Output is correct
7 Correct 3 ms 2776 KB Output is correct
8 Correct 3 ms 2776 KB Output is correct
9 Correct 3 ms 2776 KB Output is correct
10 Correct 3 ms 2776 KB Output is correct
11 Correct 3 ms 2776 KB Output is correct
12 Correct 3 ms 2776 KB Output is correct
13 Correct 4 ms 2776 KB Output is correct
14 Correct 5 ms 2776 KB Output is correct
15 Correct 4 ms 2776 KB Output is correct
16 Correct 3 ms 2776 KB Output is correct
17 Correct 6 ms 2776 KB Output is correct
18 Correct 4 ms 2776 KB Output is correct
19 Correct 4 ms 2776 KB Output is correct
20 Correct 4 ms 2776 KB Output is correct
21 Correct 3 ms 2776 KB Output is correct
22 Correct 4 ms 2776 KB Output is correct
23 Correct 5 ms 2776 KB Output is correct
24 Correct 5 ms 2776 KB Output is correct
25 Correct 6 ms 2776 KB Output is correct
26 Correct 5 ms 2776 KB Output is correct
27 Correct 4 ms 2808 KB Output is correct
28 Correct 6 ms 2808 KB Output is correct
29 Correct 11 ms 2808 KB Output is correct
30 Correct 5 ms 2808 KB Output is correct
31 Correct 11 ms 2808 KB Output is correct
32 Correct 7 ms 2808 KB Output is correct
33 Correct 22 ms 2812 KB Output is correct
34 Correct 14 ms 2812 KB Output is correct
35 Correct 12 ms 2812 KB Output is correct
36 Correct 5 ms 2812 KB Output is correct
37 Correct 12 ms 2940 KB Output is correct
38 Correct 13 ms 3068 KB Output is correct
39 Correct 13 ms 3068 KB Output is correct
40 Correct 12 ms 3068 KB Output is correct
41 Correct 13 ms 3068 KB Output is correct
42 Correct 9 ms 3068 KB Output is correct
43 Correct 9 ms 3068 KB Output is correct
44 Correct 9 ms 3068 KB Output is correct
45 Correct 73 ms 3388 KB Output is correct
46 Correct 39 ms 3388 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3388 KB Output is correct
2 Correct 3 ms 3388 KB Output is correct
3 Correct 2 ms 3388 KB Output is correct
4 Correct 2 ms 3388 KB Output is correct
5 Correct 3 ms 3388 KB Output is correct
6 Correct 3 ms 3388 KB Output is correct
7 Correct 3 ms 3388 KB Output is correct
8 Correct 3 ms 3388 KB Output is correct
9 Correct 3 ms 3388 KB Output is correct
10 Correct 3 ms 3388 KB Output is correct
11 Correct 4 ms 3388 KB Output is correct
12 Correct 3 ms 3388 KB Output is correct
13 Correct 4 ms 3388 KB Output is correct
14 Correct 4 ms 3388 KB Output is correct
15 Correct 4 ms 3388 KB Output is correct
16 Correct 4 ms 3388 KB Output is correct
17 Correct 5 ms 3388 KB Output is correct
18 Correct 5 ms 3388 KB Output is correct
19 Correct 4 ms 3388 KB Output is correct
20 Correct 4 ms 3388 KB Output is correct
21 Correct 3 ms 3388 KB Output is correct
22 Correct 5 ms 3388 KB Output is correct
23 Correct 4 ms 3388 KB Output is correct
24 Correct 5 ms 3388 KB Output is correct
25 Correct 5 ms 3388 KB Output is correct
26 Correct 5 ms 3388 KB Output is correct
27 Correct 6 ms 3388 KB Output is correct
28 Correct 6 ms 3388 KB Output is correct
29 Correct 11 ms 3388 KB Output is correct
30 Correct 8 ms 3388 KB Output is correct
31 Correct 8 ms 3388 KB Output is correct
32 Correct 7 ms 3388 KB Output is correct
33 Correct 19 ms 3388 KB Output is correct
34 Correct 14 ms 3388 KB Output is correct
35 Correct 13 ms 3388 KB Output is correct
36 Correct 4 ms 3388 KB Output is correct
37 Correct 13 ms 3388 KB Output is correct
38 Correct 15 ms 3388 KB Output is correct
39 Correct 12 ms 3388 KB Output is correct
40 Correct 11 ms 3388 KB Output is correct
41 Correct 12 ms 3388 KB Output is correct
42 Correct 9 ms 3388 KB Output is correct
43 Correct 10 ms 3388 KB Output is correct
44 Correct 9 ms 3388 KB Output is correct
45 Correct 64 ms 3388 KB Output is correct
46 Correct 46 ms 3388 KB Output is correct
47 Correct 25 ms 10624 KB Output is correct
48 Correct 27 ms 17664 KB Output is correct
49 Correct 25 ms 19112 KB Output is correct
50 Correct 23 ms 20732 KB Output is correct
51 Correct 44 ms 23016 KB Output is correct
52 Correct 54 ms 23016 KB Output is correct
53 Correct 41 ms 23016 KB Output is correct
54 Correct 21 ms 23016 KB Output is correct
55 Correct 29 ms 23016 KB Output is correct
56 Correct 32 ms 23016 KB Output is correct
57 Correct 20 ms 23016 KB Output is correct
58 Correct 29 ms 23016 KB Output is correct
59 Correct 30 ms 23016 KB Output is correct
60 Correct 30 ms 23016 KB Output is correct
61 Correct 37 ms 23016 KB Output is correct
62 Correct 73 ms 23016 KB Output is correct
63 Correct 73 ms 23744 KB Output is correct
64 Correct 84 ms 23744 KB Output is correct
65 Correct 450 ms 23744 KB Output is correct
66 Execution timed out 1088 ms 25328 KB Time limit exceeded
67 Halted 0 ms 0 KB -