oj.uz

Submission #166868

# Submission time Handle Problem Language Result Execution time Memory
166868 2019-12-04T12:59:38 Z Hideo Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 822 ms 27756 KB 
// Need to git gud and reach 1900+
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;

#define all(s) s.begin(), s.end()
#define ok puts("ok")
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define pi pair < int, int >
#define prev prev123
#define next next123
#define pow pow123
#define left left123
#define right right123

const int N = 30007;
const int M = 207;
const int INF = 1e9 + 7;

int a[N], b[N];
int d[N][M];
int m, n, s, f;

vector < int > lst[N];

main(){ // If you don't know what to do, check the text box at the bottom
    cin >> m >> n;
    for (int i = 1; i <= n; i++){
        scanf("%d%d", &a[i], &b[i]);
        lst[a[i] + 1].pb(b[i]);
    }
    s = a[1] + 1, f = a[2] + 1;
    priority_queue < pair < int, pi > > pq;
    pq.push(mk(0, mk(s, 0)));
    memset(d, 0x3f3f3f3f, sizeof(d));
    d[s][0] = 0;
    while (!pq.empty()){
        int w = -pq.top().fr, v = pq.top().sc.fr, pw = pq.top().sc.sc;
        pq.pop();
        if (d[v][pw] < w)
            continue;
        if (pw == 0){
            for (int to : lst[v]){
                if (to > 150){
                    int pos = v, c = 0;
                    while (pos + to <= m){
                        pos += to; c++;
                        if (d[pos][0] > d[v][0] + c){
                            d[pos][0] = d[v][0] + c;
                            pq.push(mk(-d[pos][0], mk(pos, 0)));
                        }
                    }
                    pos = v, c = 0;
                    while (pos - to > 0){
                        pos -= to; c++;
                        if (d[pos][0] > d[v][0] + c){
                            d[pos][0] = d[v][0] + c;
                            pq.push(mk(-d[pos][0], mk(pos, 0)));
                        }
                    }
                }
                else {
                    if (d[v][to] > d[v][0]){
                        d[v][to] = d[v][0];
                        pq.push(mk(-d[v][to], mk(v, to)));
                    }
                }
            }
        }
        else {
            if (v + pw <= m && d[v + pw][pw] > d[v][pw] + 1){
                d[v + pw][pw] = d[v][pw] + 1;
                pq.push(mk(-d[v + pw][pw], mk(v + pw, pw)));
            }
            if (v + pw <= m && d[v + pw][0] > d[v][pw] + 1){
                d[v + pw][0] = d[v][pw] + 1;
                pq.push(mk(-d[v + pw][0], mk(v + pw, 0)));
            }
            if (v - pw > 0 && d[v - pw][pw] > d[v][pw] + 1){
                d[v - pw][pw] = d[v][pw] + 1;
                pq.push(mk(-d[v - pw][pw], mk(v - pw, pw)));
            }
            if (v - pw > 0 && d[v - pw][0] > d[v][pw] + 1){
                d[v - pw][0] = d[v][pw] + 1;
                pq.push(mk(-d[v - pw][0], mk(v - pw, 0)));
            }
        }
    }
    if (d[f][0] != d[0][0])
        printf("%d", d[f][0]);
    else
        puts("-1");
}

/*
    Totally not inspired by BenQ's template
    Things you should do:
    1. Look for stupid typos in code e.g 1 instead of -1 etc
    2. Check if there is no infinite loops
    3. "Measure twice, cut once"
    4. Stay focused
*/

Compilation message

skyscraper.cpp:33:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){ // If you don't know what to do, check the text box at the bottom
      ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a[i], &b[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 25336 KB Output is correct
2 Correct 25 ms 25336 KB Output is correct
3 Correct 25 ms 25468 KB Output is correct
4 Correct 25 ms 25336 KB Output is correct
5 Correct 25 ms 25336 KB Output is correct
6 Correct 24 ms 25336 KB Output is correct
7 Correct 25 ms 25384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 25336 KB Output is correct
2 Correct 25 ms 25392 KB Output is correct
3 Correct 25 ms 25336 KB Output is correct
4 Correct 24 ms 25336 KB Output is correct
5 Correct 24 ms 25340 KB Output is correct
6 Correct 24 ms 25336 KB Output is correct
7 Correct 25 ms 25336 KB Output is correct
8 Correct 24 ms 25336 KB Output is correct
9 Correct 24 ms 25336 KB Output is correct
10 Correct 25 ms 25336 KB Output is correct
11 Correct 26 ms 25464 KB Output is correct
12 Correct 25 ms 25336 KB Output is correct
13 Correct 26 ms 25464 KB Output is correct
14 Correct 26 ms 25464 KB Output is correct
15 Correct 26 ms 25464 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 25336 KB Output is correct
2 Correct 25 ms 25352 KB Output is correct
3 Correct 25 ms 25336 KB Output is correct
4 Correct 25 ms 25280 KB Output is correct
5 Correct 25 ms 25336 KB Output is correct
6 Correct 25 ms 25344 KB Output is correct
7 Correct 25 ms 25336 KB Output is correct
8 Correct 26 ms 25308 KB Output is correct
9 Correct 25 ms 25336 KB Output is correct
10 Correct 24 ms 25336 KB Output is correct
11 Correct 26 ms 25400 KB Output is correct
12 Correct 25 ms 25464 KB Output is correct
13 Correct 26 ms 25336 KB Output is correct
14 Correct 27 ms 25464 KB Output is correct
15 Correct 26 ms 25464 KB Output is correct
16 Correct 25 ms 25336 KB Output is correct
17 Correct 28 ms 25472 KB Output is correct
18 Correct 26 ms 25340 KB Output is correct
19 Correct 25 ms 25336 KB Output is correct
20 Correct 30 ms 25464 KB Output is correct
21 Correct 25 ms 25336 KB Output is correct
22 Correct 25 ms 25336 KB Output is correct
23 Correct 26 ms 25308 KB Output is correct
24 Correct 27 ms 25464 KB Output is correct
25 Correct 26 ms 25376 KB Output is correct
26 Correct 27 ms 25464 KB Output is correct
27 Correct 26 ms 25332 KB Output is correct
28 Correct 27 ms 25464 KB Output is correct
29 Correct 33 ms 25336 KB Output is correct
30 Correct 28 ms 25336 KB Output is correct
31 Correct 29 ms 25336 KB Output is correct
32 Correct 28 ms 25336 KB Output is correct
33 Correct 41 ms 25448 KB Output is correct
34 Correct 41 ms 25464 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 25336 KB Output is correct
2 Correct 25 ms 25336 KB Output is correct
3 Correct 24 ms 25268 KB Output is correct
4 Correct 24 ms 25336 KB Output is correct
5 Correct 24 ms 25336 KB Output is correct
6 Correct 24 ms 25336 KB Output is correct
7 Correct 25 ms 25336 KB Output is correct
8 Correct 25 ms 25336 KB Output is correct
9 Correct 25 ms 25336 KB Output is correct
10 Correct 26 ms 25336 KB Output is correct
11 Correct 27 ms 25464 KB Output is correct
12 Correct 25 ms 25336 KB Output is correct
13 Correct 26 ms 25336 KB Output is correct
14 Correct 26 ms 25464 KB Output is correct
15 Correct 27 ms 25464 KB Output is correct
16 Correct 25 ms 25308 KB Output is correct
17 Correct 27 ms 25364 KB Output is correct
18 Correct 25 ms 25464 KB Output is correct
19 Correct 25 ms 25336 KB Output is correct
20 Correct 26 ms 25464 KB Output is correct
21 Correct 25 ms 25336 KB Output is correct
22 Correct 25 ms 25336 KB Output is correct
23 Correct 26 ms 25408 KB Output is correct
24 Correct 27 ms 25464 KB Output is correct
25 Correct 27 ms 25464 KB Output is correct
26 Correct 26 ms 25384 KB Output is correct
27 Correct 26 ms 25316 KB Output is correct
28 Correct 27 ms 25464 KB Output is correct
29 Correct 32 ms 25464 KB Output is correct
30 Correct 27 ms 25340 KB Output is correct
31 Correct 28 ms 25380 KB Output is correct
32 Correct 28 ms 25336 KB Output is correct
33 Correct 41 ms 25464 KB Output is correct
34 Correct 41 ms 25468 KB Output is correct
35 Correct 42 ms 26232 KB Output is correct
36 Correct 28 ms 25592 KB Output is correct
37 Correct 48 ms 25976 KB Output is correct
38 Correct 49 ms 26232 KB Output is correct
39 Correct 48 ms 26232 KB Output is correct
40 Correct 48 ms 26232 KB Output is correct
41 Correct 48 ms 26232 KB Output is correct
42 Correct 32 ms 26104 KB Output is correct
43 Correct 31 ms 26104 KB Output is correct
44 Correct 31 ms 26104 KB Output is correct
45 Correct 77 ms 26424 KB Output is correct
46 Correct 77 ms 26232 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 25336 KB Output is correct
2 Correct 25 ms 25336 KB Output is correct
3 Correct 25 ms 25340 KB Output is correct
4 Correct 25 ms 25336 KB Output is correct
5 Correct 25 ms 25336 KB Output is correct
6 Correct 25 ms 25336 KB Output is correct
7 Correct 25 ms 25336 KB Output is correct
8 Correct 25 ms 25372 KB Output is correct
9 Correct 25 ms 25336 KB Output is correct
10 Correct 25 ms 25360 KB Output is correct
11 Correct 26 ms 25464 KB Output is correct
12 Correct 25 ms 25336 KB Output is correct
13 Correct 25 ms 25424 KB Output is correct
14 Correct 27 ms 25464 KB Output is correct
15 Correct 26 ms 25464 KB Output is correct
16 Correct 25 ms 25308 KB Output is correct
17 Correct 28 ms 25464 KB Output is correct
18 Correct 26 ms 25336 KB Output is correct
19 Correct 27 ms 25336 KB Output is correct
20 Correct 26 ms 25464 KB Output is correct
21 Correct 26 ms 25336 KB Output is correct
22 Correct 25 ms 25336 KB Output is correct
23 Correct 26 ms 25464 KB Output is correct
24 Correct 27 ms 25476 KB Output is correct
25 Correct 26 ms 25348 KB Output is correct
26 Correct 26 ms 25336 KB Output is correct
27 Correct 26 ms 25336 KB Output is correct
28 Correct 28 ms 25464 KB Output is correct
29 Correct 33 ms 25592 KB Output is correct
30 Correct 28 ms 25332 KB Output is correct
31 Correct 29 ms 25336 KB Output is correct
32 Correct 28 ms 25336 KB Output is correct
33 Correct 41 ms 25436 KB Output is correct
34 Correct 41 ms 25436 KB Output is correct
35 Correct 42 ms 26104 KB Output is correct
36 Correct 28 ms 25464 KB Output is correct
37 Correct 48 ms 25976 KB Output is correct
38 Correct 48 ms 26232 KB Output is correct
39 Correct 48 ms 26216 KB Output is correct
40 Correct 48 ms 26232 KB Output is correct
41 Correct 48 ms 26268 KB Output is correct
42 Correct 31 ms 26076 KB Output is correct
43 Correct 31 ms 25976 KB Output is correct
44 Correct 31 ms 25976 KB Output is correct
45 Correct 77 ms 26296 KB Output is correct
46 Correct 77 ms 26232 KB Output is correct
47 Correct 113 ms 26680 KB Output is correct
48 Correct 34 ms 26208 KB Output is correct
49 Correct 33 ms 26028 KB Output is correct
50 Correct 31 ms 25976 KB Output is correct
51 Correct 80 ms 27028 KB Output is correct
52 Correct 87 ms 26808 KB Output is correct
53 Correct 44 ms 26488 KB Output is correct
54 Correct 28 ms 25336 KB Output is correct
55 Correct 28 ms 25336 KB Output is correct
56 Correct 52 ms 26708 KB Output is correct
57 Correct 116 ms 25464 KB Output is correct
58 Correct 50 ms 25868 KB Output is correct
59 Correct 41 ms 26060 KB Output is correct
60 Correct 44 ms 25848 KB Output is correct
61 Correct 42 ms 26104 KB Output is correct
62 Correct 69 ms 26872 KB Output is correct
63 Correct 68 ms 27040 KB Output is correct
64 Correct 71 ms 26936 KB Output is correct
65 Correct 241 ms 27628 KB Output is correct
66 Correct 822 ms 27632 KB Output is correct
67 Correct 793 ms 27756 KB Output is correct