oj.uz

Submission #249695

# Submission time Handle Problem Language Result Execution time Memory
249695 2020-07-15T14:49:26 Z receed Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 386 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 = 9000000;
map<pair<int, int>, vector<int>> li;
vector<pair<int, bool>> g[M];
int d[M], used[M];

void adde(int u, int v, bool w) {
    g[u].push_back({v, 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);
        cs += ck;
    }
    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 (auto &p : g[v]) {
            if (p.second) {
                if (d[p.first] > d[v] + 1) {
                    d[p.first] = d[v] + 1;
                    q.push_back(p.first);
                }
            }
            else if (d[p.first] > d[v]) {
                d[p.first] = d[v];
                q.push_front(p.first);
            }
        }
    }
    if (d[t] == M)
        cout << -1;
    else
        cout << d[t];
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:86:12: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if (d[t] == M)
         ~~~^
skyscraper.cpp:66: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 114 ms 211704 KB Output is correct
2 Correct 115 ms 211704 KB Output is correct
3 Correct 115 ms 211704 KB Output is correct
4 Correct 119 ms 211832 KB Output is correct
5 Correct 117 ms 211704 KB Output is correct
6 Correct 119 ms 211704 KB Output is correct
7 Correct 116 ms 211704 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 211704 KB Output is correct
2 Correct 115 ms 211704 KB Output is correct
3 Correct 118 ms 211704 KB Output is correct
4 Correct 117 ms 211704 KB Output is correct
5 Correct 116 ms 211752 KB Output is correct
6 Correct 115 ms 211760 KB Output is correct
7 Correct 117 ms 211704 KB Output is correct
8 Correct 116 ms 211704 KB Output is correct
9 Correct 114 ms 211704 KB Output is correct
10 Correct 119 ms 211832 KB Output is correct
11 Correct 121 ms 212088 KB Output is correct
12 Correct 121 ms 211704 KB Output is correct
13 Correct 122 ms 211832 KB Output is correct
14 Correct 117 ms 212216 KB Output is correct
15 Correct 116 ms 212216 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 211704 KB Output is correct
2 Correct 115 ms 211704 KB Output is correct
3 Correct 119 ms 211704 KB Output is correct
4 Correct 114 ms 211832 KB Output is correct
5 Correct 119 ms 211704 KB Output is correct
6 Correct 115 ms 211644 KB Output is correct
7 Correct 117 ms 211736 KB Output is correct
8 Correct 119 ms 211704 KB Output is correct
9 Correct 118 ms 211704 KB Output is correct
10 Correct 117 ms 211832 KB Output is correct
11 Correct 123 ms 212244 KB Output is correct
12 Correct 115 ms 211704 KB Output is correct
13 Correct 115 ms 211704 KB Output is correct
14 Correct 117 ms 212252 KB Output is correct
15 Correct 123 ms 212216 KB Output is correct
16 Correct 119 ms 211960 KB Output is correct
17 Correct 118 ms 212728 KB Output is correct
18 Correct 118 ms 212216 KB Output is correct
19 Correct 115 ms 212088 KB Output is correct
20 Correct 137 ms 211832 KB Output is correct
21 Correct 117 ms 211960 KB Output is correct
22 Correct 115 ms 212088 KB Output is correct
23 Correct 117 ms 212232 KB Output is correct
24 Correct 121 ms 212600 KB Output is correct
25 Correct 120 ms 212344 KB Output is correct
26 Correct 118 ms 212216 KB Output is correct
27 Correct 117 ms 212212 KB Output is correct
28 Correct 119 ms 213240 KB Output is correct
29 Correct 125 ms 215076 KB Output is correct
30 Correct 121 ms 212696 KB Output is correct
31 Correct 124 ms 213544 KB Output is correct
32 Correct 127 ms 212984 KB Output is correct
33 Correct 142 ms 218488 KB Output is correct
34 Correct 141 ms 218488 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 211704 KB Output is correct
2 Correct 119 ms 211704 KB Output is correct
3 Correct 118 ms 211704 KB Output is correct
4 Correct 116 ms 211704 KB Output is correct
5 Correct 114 ms 211704 KB Output is correct
6 Correct 114 ms 211704 KB Output is correct
7 Correct 115 ms 211744 KB Output is correct
8 Correct 114 ms 211704 KB Output is correct
9 Correct 114 ms 211704 KB Output is correct
10 Correct 115 ms 211832 KB Output is correct
11 Correct 119 ms 212088 KB Output is correct
12 Correct 119 ms 211756 KB Output is correct
13 Correct 116 ms 211704 KB Output is correct
14 Correct 115 ms 212216 KB Output is correct
15 Correct 121 ms 212352 KB Output is correct
16 Correct 124 ms 211960 KB Output is correct
17 Correct 124 ms 212728 KB Output is correct
18 Correct 114 ms 212220 KB Output is correct
19 Correct 121 ms 212216 KB Output is correct
20 Correct 118 ms 211960 KB Output is correct
21 Correct 116 ms 211960 KB Output is correct
22 Correct 117 ms 212088 KB Output is correct
23 Correct 118 ms 212216 KB Output is correct
24 Correct 118 ms 212600 KB Output is correct
25 Correct 117 ms 212344 KB Output is correct
26 Correct 114 ms 212220 KB Output is correct
27 Correct 116 ms 212200 KB Output is correct
28 Correct 128 ms 213180 KB Output is correct
29 Correct 125 ms 215196 KB Output is correct
30 Correct 119 ms 212728 KB Output is correct
31 Correct 125 ms 213624 KB Output is correct
32 Correct 119 ms 213112 KB Output is correct
33 Correct 142 ms 218412 KB Output is correct
34 Correct 144 ms 218488 KB Output is correct
35 Correct 155 ms 220156 KB Output is correct
36 Correct 121 ms 213368 KB Output is correct
37 Correct 171 ms 223100 KB Output is correct
38 Correct 185 ms 223736 KB Output is correct
39 Correct 178 ms 223736 KB Output is correct
40 Correct 181 ms 223748 KB Output is correct
41 Correct 173 ms 223736 KB Output is correct
42 Correct 124 ms 212724 KB Output is correct
43 Correct 122 ms 212724 KB Output is correct
44 Correct 123 ms 212520 KB Output is correct
45 Correct 288 ms 241180 KB Output is correct
46 Correct 281 ms 241016 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 211832 KB Output is correct
2 Correct 114 ms 211704 KB Output is correct
3 Correct 113 ms 211704 KB Output is correct
4 Correct 116 ms 211744 KB Output is correct
5 Correct 119 ms 211704 KB Output is correct
6 Correct 116 ms 211704 KB Output is correct
7 Correct 116 ms 211704 KB Output is correct
8 Correct 116 ms 211704 KB Output is correct
9 Correct 129 ms 211704 KB Output is correct
10 Correct 116 ms 211832 KB Output is correct
11 Correct 120 ms 212088 KB Output is correct
12 Correct 118 ms 211704 KB Output is correct
13 Correct 132 ms 211832 KB Output is correct
14 Correct 115 ms 212216 KB Output is correct
15 Correct 116 ms 212216 KB Output is correct
16 Correct 114 ms 211960 KB Output is correct
17 Correct 119 ms 212728 KB Output is correct
18 Correct 117 ms 212220 KB Output is correct
19 Correct 116 ms 212088 KB Output is correct
20 Correct 115 ms 211960 KB Output is correct
21 Correct 115 ms 211960 KB Output is correct
22 Correct 114 ms 212088 KB Output is correct
23 Correct 115 ms 212216 KB Output is correct
24 Correct 118 ms 212600 KB Output is correct
25 Correct 123 ms 212344 KB Output is correct
26 Correct 120 ms 212216 KB Output is correct
27 Correct 131 ms 212132 KB Output is correct
28 Correct 126 ms 213200 KB Output is correct
29 Correct 135 ms 215112 KB Output is correct
30 Correct 132 ms 212728 KB Output is correct
31 Correct 123 ms 213580 KB Output is correct
32 Correct 120 ms 212984 KB Output is correct
33 Correct 144 ms 218488 KB Output is correct
34 Correct 149 ms 218488 KB Output is correct
35 Correct 158 ms 220152 KB Output is correct
36 Correct 123 ms 213240 KB Output is correct
37 Correct 172 ms 223096 KB Output is correct
38 Correct 187 ms 223736 KB Output is correct
39 Correct 177 ms 223736 KB Output is correct
40 Correct 190 ms 223736 KB Output is correct
41 Correct 194 ms 223736 KB Output is correct
42 Correct 127 ms 212728 KB Output is correct
43 Correct 125 ms 212724 KB Output is correct
44 Correct 127 ms 212472 KB Output is correct
45 Correct 287 ms 241016 KB Output is correct
46 Correct 290 ms 241016 KB Output is correct
47 Correct 386 ms 254840 KB Output is correct
48 Correct 174 ms 226296 KB Output is correct
49 Correct 157 ms 221688 KB Output is correct
50 Correct 157 ms 220920 KB Output is correct
51 Correct 224 ms 232700 KB Output is correct
52 Correct 237 ms 234360 KB Output is correct
53 Correct 162 ms 220616 KB Output is correct
54 Correct 124 ms 213496 KB Output is correct
55 Correct 129 ms 214904 KB Output is correct
56 Correct 132 ms 214904 KB Output is correct
57 Correct 234 ms 235896 KB Output is correct
58 Correct 135 ms 216052 KB Output is correct
59 Correct 143 ms 217844 KB Output is correct
60 Correct 151 ms 219380 KB Output is correct
61 Correct 145 ms 218740 KB Output is correct
62 Correct 232 ms 242680 KB Output is correct
63 Runtime error 257 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
64 Halted 0 ms 0 KB -