oj.uz

Submission #239249

# Submission time Handle Problem Language Result Execution time Memory
239249 2020-06-15T00:56:52 Z ant101 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 950 ms 262148 KB 
#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
using namespace std;

//#define RDEBUG 1
#ifdef RDEBUG
#define D(x) x
#else
#define D(x)
#endif
#define inf 0x7fffffff
#define MOD 1000000007



int add(int a, int b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
int sub(int a, int b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}

int mul(int a, int b) {
    return (a * b)%MOD;
}

void add_self(int& a, int b) {
    a = add(a, b);
}
void sub_self(int& a, int b) {
    a = sub(a, b);
}
void mul_self(int& a, int b) {
    a = mul(a, b);
}


const int MAXN = 30010;

int sp[MAXN][175];
int N, M;
pair<int, int> doge[MAXN];
vector<pair<pair<int, int>, int>> adj[MAXN][175];
vector<int> gadj[MAXN];

void dij(int start) {
    for (int i = 0; i<N; i++) {
        for (int j = 0; j<=sqrt(N); j++) {
            sp[i][j] = 1e9;
        }
    }
    priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq;
    pq.push({0, {doge[start].first, 0}});
    sp[doge[start].first][0] = 0;
    while (pq.size() != 0) {
        int d = pq.top().first, u = pq.top().second.first, p = pq.top().second.second;
        pq.pop();
        if (sp[u][p] != d) {
            continue;
        }
        if (p != 0) {
            if (u-p >= 0) {
                adj[u][p].push_back({{u-p, p}, 1});
            }
            if (u+p < N) {
                adj[u][p].push_back({{u+p, p}, 1});
            }
            adj[u][p].push_back({{u, 0}, 0});
        }
        for (auto edge : adj[u][p]) {
            int v = edge.first.first, np = edge.first.second, w = edge.second;
            if (d+w < sp[v][np]) {
                sp[v][np] = d+w;
                pq.push({d+w, {v, np}});
            }
        }
        if (p == 0) {
            for (auto e : gadj[u]) {
                for (int j = 1; j<=N; j++) {
                    int hold = 0;
                    if (u-e*j >= 0) {
                        hold++;
                        pair<pair<int, int>, int> edge = {{u-e*j, 0}, j};
                        int v = edge.first.first, np = edge.first.second, w = edge.second;
                        if (d+w < sp[v][np]) {
                            sp[v][np] = d+w;
                            pq.push({d+w, {v, np}});
                        }
                    }
                    if (u+e*j < N) {
                        hold++;
                        pair<pair<int, int>, int> edge = {{u+e*j, 0}, j};
                        int v = edge.first.first, np = edge.first.second, w = edge.second;
                        if (d+w < sp[v][np]) {
                            sp[v][np] = d+w;
                            pq.push({d+w, {v, np}});
                        }
                    }
                    if (!hold) {
                        break;
                    }
                }
            }
        }
        if (p != 0) {
            if (u-p >= 0) {
                adj[u][p].pop_back();
            }
            if (u+p < N) {
                adj[u][p].pop_back();
            }
            adj[u][p].push_back({{u, 0}, 0});
        }
    }
}

int main() {
    ios_base :: sync_with_stdio(false);
    cin >> N >> M;
    for (int i = 0; i<M; i++) {
        int a, b;
        cin >> a >> b;
        doge[i] = {a, b};
        if (b<=sqrt(N)) {
            adj[a][0].push_back({{a, b}, 0});
        } else {
            gadj[a].push_back(b);
//            for (int j = 1; j<=N; j++) {
//                int hold = 0;
//                if (a-b*j >= 0) {
//                    hold++;
//                    adj[a][0].push_back({{a-b*j, 0}, j});
//                }
//                if (a+b*j < N) {
//                    hold++;
//                    adj[a][0].push_back({{a+b*j, 0}, j});
//                }
//                if (!hold) {
//                    break;
//                }
//            }
        }
    }
    dij(0);
    cout << (sp[doge[1].first][0] == 1e9 ? -1 : sp[doge[1].first][0]) << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 124280 KB Output is correct
2 Correct 76 ms 124412 KB Output is correct
3 Correct 77 ms 124408 KB Output is correct
4 Correct 76 ms 124324 KB Output is correct
5 Correct 77 ms 124408 KB Output is correct
6 Correct 77 ms 124280 KB Output is correct
7 Correct 76 ms 124408 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 124536 KB Output is correct
2 Correct 78 ms 124408 KB Output is correct
3 Correct 77 ms 124408 KB Output is correct
4 Correct 76 ms 124384 KB Output is correct
5 Correct 79 ms 124480 KB Output is correct
6 Correct 77 ms 124280 KB Output is correct
7 Correct 75 ms 124408 KB Output is correct
8 Correct 78 ms 124408 KB Output is correct
9 Correct 76 ms 124408 KB Output is correct
10 Correct 78 ms 124536 KB Output is correct
11 Correct 79 ms 124536 KB Output is correct
12 Correct 78 ms 124536 KB Output is correct
13 Correct 78 ms 124536 KB Output is correct
14 Correct 78 ms 124536 KB Output is correct
15 Correct 78 ms 124536 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 124408 KB Output is correct
2 Correct 77 ms 124428 KB Output is correct
3 Correct 77 ms 124408 KB Output is correct
4 Correct 76 ms 124408 KB Output is correct
5 Correct 77 ms 124536 KB Output is correct
6 Correct 77 ms 124408 KB Output is correct
7 Correct 77 ms 124408 KB Output is correct
8 Correct 77 ms 124536 KB Output is correct
9 Correct 81 ms 124408 KB Output is correct
10 Correct 78 ms 124536 KB Output is correct
11 Correct 77 ms 124536 KB Output is correct
12 Correct 76 ms 124536 KB Output is correct
13 Correct 76 ms 124536 KB Output is correct
14 Correct 80 ms 124536 KB Output is correct
15 Correct 77 ms 124536 KB Output is correct
16 Correct 79 ms 124536 KB Output is correct
17 Correct 80 ms 125304 KB Output is correct
18 Correct 78 ms 125560 KB Output is correct
19 Correct 78 ms 125816 KB Output is correct
20 Correct 82 ms 125944 KB Output is correct
21 Correct 76 ms 124664 KB Output is correct
22 Correct 79 ms 125560 KB Output is correct
23 Correct 79 ms 125688 KB Output is correct
24 Correct 84 ms 126072 KB Output is correct
25 Correct 81 ms 126072 KB Output is correct
26 Correct 81 ms 126200 KB Output is correct
27 Correct 81 ms 126200 KB Output is correct
28 Correct 84 ms 126712 KB Output is correct
29 Correct 100 ms 129576 KB Output is correct
30 Correct 84 ms 126840 KB Output is correct
31 Correct 90 ms 127736 KB Output is correct
32 Correct 85 ms 126584 KB Output is correct
33 Correct 109 ms 130936 KB Output is correct
34 Correct 109 ms 130936 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 124408 KB Output is correct
2 Correct 79 ms 124408 KB Output is correct
3 Correct 76 ms 124360 KB Output is correct
4 Correct 79 ms 124408 KB Output is correct
5 Correct 77 ms 124408 KB Output is correct
6 Correct 77 ms 124536 KB Output is correct
7 Correct 78 ms 124328 KB Output is correct
8 Correct 75 ms 124408 KB Output is correct
9 Correct 77 ms 124408 KB Output is correct
10 Correct 79 ms 124536 KB Output is correct
11 Correct 77 ms 124536 KB Output is correct
12 Correct 77 ms 124540 KB Output is correct
13 Correct 79 ms 124664 KB Output is correct
14 Correct 80 ms 124536 KB Output is correct
15 Correct 78 ms 124536 KB Output is correct
16 Correct 78 ms 124536 KB Output is correct
17 Correct 81 ms 125432 KB Output is correct
18 Correct 79 ms 125688 KB Output is correct
19 Correct 77 ms 125816 KB Output is correct
20 Correct 80 ms 125944 KB Output is correct
21 Correct 80 ms 124664 KB Output is correct
22 Correct 79 ms 125688 KB Output is correct
23 Correct 80 ms 125688 KB Output is correct
24 Correct 86 ms 126072 KB Output is correct
25 Correct 79 ms 126072 KB Output is correct
26 Correct 82 ms 126200 KB Output is correct
27 Correct 79 ms 126200 KB Output is correct
28 Correct 81 ms 126712 KB Output is correct
29 Correct 99 ms 129528 KB Output is correct
30 Correct 82 ms 126840 KB Output is correct
31 Correct 91 ms 127736 KB Output is correct
32 Correct 83 ms 126456 KB Output is correct
33 Correct 109 ms 130900 KB Output is correct
34 Correct 116 ms 131064 KB Output is correct
35 Correct 95 ms 127864 KB Output is correct
36 Correct 82 ms 125688 KB Output is correct
37 Correct 106 ms 129656 KB Output is correct
38 Correct 107 ms 129528 KB Output is correct
39 Correct 109 ms 129528 KB Output is correct
40 Correct 107 ms 129400 KB Output is correct
41 Correct 105 ms 129400 KB Output is correct
42 Correct 86 ms 126836 KB Output is correct
43 Correct 85 ms 126836 KB Output is correct
44 Correct 86 ms 126600 KB Output is correct
45 Correct 115 ms 131344 KB Output is correct
46 Correct 117 ms 131448 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 124412 KB Output is correct
2 Correct 77 ms 124536 KB Output is correct
3 Correct 86 ms 124384 KB Output is correct
4 Correct 77 ms 124408 KB Output is correct
5 Correct 79 ms 124408 KB Output is correct
6 Correct 76 ms 124408 KB Output is correct
7 Correct 77 ms 124408 KB Output is correct
8 Correct 78 ms 124408 KB Output is correct
9 Correct 76 ms 124536 KB Output is correct
10 Correct 77 ms 124536 KB Output is correct
11 Correct 79 ms 124536 KB Output is correct
12 Correct 77 ms 124536 KB Output is correct
13 Correct 77 ms 124536 KB Output is correct
14 Correct 77 ms 124484 KB Output is correct
15 Correct 80 ms 124536 KB Output is correct
16 Correct 77 ms 124536 KB Output is correct
17 Correct 81 ms 125304 KB Output is correct
18 Correct 78 ms 125560 KB Output is correct
19 Correct 81 ms 125816 KB Output is correct
20 Correct 81 ms 125944 KB Output is correct
21 Correct 79 ms 124664 KB Output is correct
22 Correct 90 ms 125560 KB Output is correct
23 Correct 80 ms 125692 KB Output is correct
24 Correct 81 ms 126072 KB Output is correct
25 Correct 80 ms 126072 KB Output is correct
26 Correct 81 ms 126200 KB Output is correct
27 Correct 80 ms 126072 KB Output is correct
28 Correct 83 ms 126712 KB Output is correct
29 Correct 103 ms 129528 KB Output is correct
30 Correct 83 ms 126840 KB Output is correct
31 Correct 89 ms 127736 KB Output is correct
32 Correct 83 ms 126452 KB Output is correct
33 Correct 109 ms 130936 KB Output is correct
34 Correct 112 ms 130936 KB Output is correct
35 Correct 96 ms 127736 KB Output is correct
36 Correct 82 ms 125688 KB Output is correct
37 Correct 107 ms 129656 KB Output is correct
38 Correct 109 ms 129400 KB Output is correct
39 Correct 106 ms 129400 KB Output is correct
40 Correct 107 ms 129272 KB Output is correct
41 Correct 106 ms 129272 KB Output is correct
42 Correct 86 ms 126836 KB Output is correct
43 Correct 85 ms 126836 KB Output is correct
44 Correct 86 ms 126600 KB Output is correct
45 Correct 113 ms 131340 KB Output is correct
46 Correct 116 ms 131448 KB Output is correct
47 Correct 292 ms 156024 KB Output is correct
48 Correct 119 ms 141176 KB Output is correct
49 Correct 121 ms 142456 KB Output is correct
50 Correct 126 ms 144120 KB Output is correct
51 Correct 238 ms 156152 KB Output is correct
52 Correct 265 ms 157804 KB Output is correct
53 Correct 159 ms 149368 KB Output is correct
54 Correct 132 ms 145912 KB Output is correct
55 Correct 137 ms 146552 KB Output is correct
56 Correct 150 ms 148088 KB Output is correct
57 Correct 350 ms 172024 KB Output is correct
58 Correct 156 ms 149748 KB Output is correct
59 Correct 170 ms 151672 KB Output is correct
60 Correct 187 ms 152828 KB Output is correct
61 Correct 168 ms 151160 KB Output is correct
62 Correct 267 ms 163196 KB Output is correct
63 Correct 185 ms 148588 KB Output is correct
64 Correct 186 ms 148456 KB Output is correct
65 Correct 835 ms 222016 KB Output is correct
66 Runtime error 950 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
67 Halted 0 ms 0 KB -