oj.uz

Submission #249702

# Submission time Handle Problem Language Result Execution time Memory
249702 2020-07-15T14:56:56 Z receed Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 513 ms 262148 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;

const int N = 30001, M = 7500000;
map<pair<int, int>, vector<int>> li;
vector<int> g[M];
int d[M], used[M];

void adde(int u, int v, bool w) {
    g[u].push_back(v * 2 + w);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m, cb, cp, s, t;
    cin >> n >> m;
    rep(i, m) {
        cin >> cb >> cp;
        if (i == 0)
            s = cb;
        else if (i == 1)
            t = cb;
        li[{cp, cb % cp}].push_back(cb);
    }
    int cs = n;
    for (auto &pp : li) {
        auto p = pp.first;
        int ck = (n - p.second + p.first - 1) / p.first;
        rep(i, ck - 1) {
            adde(cs + i, cs + i + 1, 1);
            adde(cs + i + 1, cs + i, 1);
        }
        rep(i, ck)
            adde(cs + i, p.second + i * p.first, 0);
        for (int i : pp.second)
            adde(i, cs + (i - p.second) / p.first, 0);
        rep(i, ck)
            g[cs + i].shrink_to_fit();
        cs += ck;
        assert(cs < M);
    }
    deque<int> q {s};
    rep(i, cs)
        d[i] = M;
    d[s] = 0;
    while (!q.empty()) {
        int v = q.front();
        q.pop_front();
        if (used[v])
            continue;
        used[v] = 1;
        for (int p : g[v]) {
            int u = p / 2;
            if (p % 2) {
                if (d[u] > d[v] + 1) {
                    d[u] = d[v] + 1;
                    q.push_back(u);
                }
            }
            else if (d[u] > d[v]) {
                d[u] = d[v];
                q.push_front(u);
            }
        }
    }
    if (d[t] == M)
        cout << -1;
    else
        cout << d[t];
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:90:12: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if (d[t] == M)
         ~~~^
skyscraper.cpp:69:10: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
     d[s] = 0;
     ~~~~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 176504 KB Output is correct
2 Correct 98 ms 176504 KB Output is correct
3 Correct 98 ms 176504 KB Output is correct
4 Correct 97 ms 176504 KB Output is correct
5 Correct 100 ms 176816 KB Output is correct
6 Correct 98 ms 176504 KB Output is correct
7 Correct 99 ms 176460 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 176504 KB Output is correct
2 Correct 99 ms 176504 KB Output is correct
3 Correct 107 ms 176504 KB Output is correct
4 Correct 100 ms 176504 KB Output is correct
5 Correct 103 ms 176504 KB Output is correct
6 Correct 107 ms 176504 KB Output is correct
7 Correct 100 ms 176504 KB Output is correct
8 Correct 99 ms 176508 KB Output is correct
9 Correct 99 ms 176504 KB Output is correct
10 Correct 98 ms 176504 KB Output is correct
11 Correct 106 ms 176888 KB Output is correct
12 Correct 101 ms 176520 KB Output is correct
13 Correct 99 ms 176504 KB Output is correct
14 Correct 105 ms 176888 KB Output is correct
15 Correct 99 ms 177016 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 176504 KB Output is correct
2 Correct 98 ms 176504 KB Output is correct
3 Correct 100 ms 176504 KB Output is correct
4 Correct 99 ms 176504 KB Output is correct
5 Correct 100 ms 176504 KB Output is correct
6 Correct 99 ms 176632 KB Output is correct
7 Correct 99 ms 176504 KB Output is correct
8 Correct 100 ms 176508 KB Output is correct
9 Correct 98 ms 176504 KB Output is correct
10 Correct 99 ms 176508 KB Output is correct
11 Correct 103 ms 177016 KB Output is correct
12 Correct 100 ms 176504 KB Output is correct
13 Correct 98 ms 176632 KB Output is correct
14 Correct 101 ms 177016 KB Output is correct
15 Correct 101 ms 177124 KB Output is correct
16 Correct 98 ms 176632 KB Output is correct
17 Correct 101 ms 177276 KB Output is correct
18 Correct 98 ms 176892 KB Output is correct
19 Correct 98 ms 176760 KB Output is correct
20 Correct 111 ms 176684 KB Output is correct
21 Correct 99 ms 176760 KB Output is correct
22 Correct 99 ms 176776 KB Output is correct
23 Correct 103 ms 176888 KB Output is correct
24 Correct 110 ms 177308 KB Output is correct
25 Correct 102 ms 177016 KB Output is correct
26 Correct 103 ms 176760 KB Output is correct
27 Correct 98 ms 176764 KB Output is correct
28 Correct 105 ms 177912 KB Output is correct
29 Correct 112 ms 178936 KB Output is correct
30 Correct 101 ms 177144 KB Output is correct
31 Correct 104 ms 177784 KB Output is correct
32 Correct 111 ms 177400 KB Output is correct
33 Correct 134 ms 181368 KB Output is correct
34 Correct 132 ms 181496 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 176508 KB Output is correct
2 Correct 101 ms 176504 KB Output is correct
3 Correct 107 ms 176504 KB Output is correct
4 Correct 107 ms 176504 KB Output is correct
5 Correct 102 ms 176504 KB Output is correct
6 Correct 100 ms 176504 KB Output is correct
7 Correct 105 ms 176676 KB Output is correct
8 Correct 98 ms 176404 KB Output is correct
9 Correct 98 ms 176504 KB Output is correct
10 Correct 99 ms 176504 KB Output is correct
11 Correct 101 ms 176888 KB Output is correct
12 Correct 97 ms 176504 KB Output is correct
13 Correct 97 ms 176504 KB Output is correct
14 Correct 100 ms 176888 KB Output is correct
15 Correct 100 ms 176888 KB Output is correct
16 Correct 103 ms 176888 KB Output is correct
17 Correct 101 ms 177272 KB Output is correct
18 Correct 99 ms 176892 KB Output is correct
19 Correct 98 ms 176760 KB Output is correct
20 Correct 101 ms 176604 KB Output is correct
21 Correct 99 ms 176760 KB Output is correct
22 Correct 103 ms 176760 KB Output is correct
23 Correct 103 ms 176888 KB Output is correct
24 Correct 105 ms 177272 KB Output is correct
25 Correct 103 ms 177156 KB Output is correct
26 Correct 100 ms 176764 KB Output is correct
27 Correct 101 ms 176760 KB Output is correct
28 Correct 108 ms 177656 KB Output is correct
29 Correct 113 ms 178936 KB Output is correct
30 Correct 103 ms 177144 KB Output is correct
31 Correct 106 ms 177912 KB Output is correct
32 Correct 105 ms 177400 KB Output is correct
33 Correct 128 ms 181368 KB Output is correct
34 Correct 134 ms 181368 KB Output is correct
35 Correct 148 ms 183800 KB Output is correct
36 Correct 106 ms 177784 KB Output is correct
37 Correct 160 ms 185592 KB Output is correct
38 Correct 165 ms 186616 KB Output is correct
39 Correct 163 ms 186616 KB Output is correct
40 Correct 163 ms 186616 KB Output is correct
41 Correct 172 ms 186748 KB Output is correct
42 Correct 104 ms 177276 KB Output is correct
43 Correct 106 ms 177272 KB Output is correct
44 Correct 107 ms 177144 KB Output is correct
45 Correct 285 ms 199160 KB Output is correct
46 Correct 279 ms 199032 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 176504 KB Output is correct
2 Correct 100 ms 176504 KB Output is correct
3 Correct 97 ms 176504 KB Output is correct
4 Correct 97 ms 176504 KB Output is correct
5 Correct 97 ms 176504 KB Output is correct
6 Correct 96 ms 176504 KB Output is correct
7 Correct 102 ms 176516 KB Output is correct
8 Correct 96 ms 176504 KB Output is correct
9 Correct 97 ms 176504 KB Output is correct
10 Correct 100 ms 176504 KB Output is correct
11 Correct 99 ms 176888 KB Output is correct
12 Correct 101 ms 176504 KB Output is correct
13 Correct 99 ms 176504 KB Output is correct
14 Correct 99 ms 176888 KB Output is correct
15 Correct 105 ms 176888 KB Output is correct
16 Correct 109 ms 176760 KB Output is correct
17 Correct 103 ms 177272 KB Output is correct
18 Correct 107 ms 176888 KB Output is correct
19 Correct 98 ms 176712 KB Output is correct
20 Correct 98 ms 176632 KB Output is correct
21 Correct 99 ms 176760 KB Output is correct
22 Correct 99 ms 176836 KB Output is correct
23 Correct 100 ms 176888 KB Output is correct
24 Correct 102 ms 177144 KB Output is correct
25 Correct 103 ms 177144 KB Output is correct
26 Correct 103 ms 176760 KB Output is correct
27 Correct 100 ms 176760 KB Output is correct
28 Correct 104 ms 177656 KB Output is correct
29 Correct 114 ms 179064 KB Output is correct
30 Correct 104 ms 177144 KB Output is correct
31 Correct 112 ms 177788 KB Output is correct
32 Correct 109 ms 177504 KB Output is correct
33 Correct 131 ms 181368 KB Output is correct
34 Correct 131 ms 181368 KB Output is correct
35 Correct 139 ms 183528 KB Output is correct
36 Correct 108 ms 177912 KB Output is correct
37 Correct 170 ms 185464 KB Output is correct
38 Correct 167 ms 186360 KB Output is correct
39 Correct 171 ms 186360 KB Output is correct
40 Correct 166 ms 186360 KB Output is correct
41 Correct 175 ms 186360 KB Output is correct
42 Correct 104 ms 177016 KB Output is correct
43 Correct 104 ms 177016 KB Output is correct
44 Correct 103 ms 176888 KB Output is correct
45 Correct 289 ms 199032 KB Output is correct
46 Correct 276 ms 198904 KB Output is correct
47 Correct 376 ms 208632 KB Output is correct
48 Correct 156 ms 187768 KB Output is correct
49 Correct 140 ms 184440 KB Output is correct
50 Correct 134 ms 183672 KB Output is correct
51 Correct 216 ms 193020 KB Output is correct
52 Correct 220 ms 194168 KB Output is correct
53 Correct 141 ms 184056 KB Output is correct
54 Correct 106 ms 177744 KB Output is correct
55 Correct 116 ms 178680 KB Output is correct
56 Correct 121 ms 178936 KB Output is correct
57 Correct 227 ms 193784 KB Output is correct
58 Correct 116 ms 179576 KB Output is correct
59 Correct 126 ms 180672 KB Output is correct
60 Correct 133 ms 181880 KB Output is correct
61 Correct 132 ms 181496 KB Output is correct
62 Correct 220 ms 200184 KB Output is correct
63 Runtime error 513 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
64 Halted 0 ms 0 KB -