oj.uz

Submission #239252

# Submission time Handle Problem Language Result Execution time Memory
239252 2020-06-15T01:06:55 Z ant101 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 78312 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][2];
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;
        if (u == doge[1].first && p == 0) {
            break;
        }
        pq.pop();
        if (sp[u][p] != d) {
            continue;
        }
        if (p != 0) {
            if (u-p >= 0) {
                adj[u][1].push_back({{u-p, p}, 1});
            }
            if (u+p < N) {
                adj[u][1].push_back({{u+p, p}, 1});
            }
            adj[u][1].push_back({{u, 0}, 0});
        }
        for (auto edge : adj[u][p != 0]) {
            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][1].pop_back();
            }
            if (u+p < N) {
                adj[u][1].pop_back();
            }
            adj[u][1].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 6 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 5 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 6 ms 2432 KB Output is correct
6 Correct 6 ms 2432 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 5 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 6 ms 2432 KB Output is correct
6 Correct 6 ms 2432 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct
8 Correct 6 ms 2432 KB Output is correct
9 Correct 6 ms 2560 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 6 ms 2560 KB Output is correct
12 Correct 6 ms 2560 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 6 ms 2560 KB Output is correct
15 Correct 6 ms 2560 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 7 ms 3712 KB Output is correct
19 Correct 7 ms 3840 KB Output is correct
20 Correct 8 ms 4096 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 7 ms 3712 KB Output is correct
23 Correct 8 ms 3712 KB Output is correct
24 Correct 8 ms 3840 KB Output is correct
25 Correct 8 ms 3840 KB Output is correct
26 Correct 8 ms 4096 KB Output is correct
27 Correct 9 ms 4096 KB Output is correct
28 Correct 9 ms 4352 KB Output is correct
29 Correct 22 ms 6272 KB Output is correct
30 Correct 11 ms 4608 KB Output is correct
31 Correct 15 ms 5120 KB Output is correct
32 Correct 11 ms 4352 KB Output is correct
33 Correct 32 ms 7160 KB Output is correct
34 Correct 18 ms 5120 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 5 ms 2432 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 6 ms 2432 KB Output is correct
6 Correct 6 ms 2432 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct
8 Correct 6 ms 2432 KB Output is correct
9 Correct 6 ms 2432 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 6 ms 2560 KB Output is correct
12 Correct 6 ms 2560 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 6 ms 2688 KB Output is correct
15 Correct 6 ms 2560 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 7 ms 3712 KB Output is correct
19 Correct 7 ms 3840 KB Output is correct
20 Correct 8 ms 4096 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 7 ms 3712 KB Output is correct
23 Correct 8 ms 3712 KB Output is correct
24 Correct 8 ms 3840 KB Output is correct
25 Correct 8 ms 3968 KB Output is correct
26 Correct 9 ms 3968 KB Output is correct
27 Correct 8 ms 4096 KB Output is correct
28 Correct 10 ms 4352 KB Output is correct
29 Correct 22 ms 6144 KB Output is correct
30 Correct 11 ms 4736 KB Output is correct
31 Correct 16 ms 5248 KB Output is correct
32 Correct 10 ms 4352 KB Output is correct
33 Correct 31 ms 7168 KB Output is correct
34 Correct 17 ms 5120 KB Output is correct
35 Correct 13 ms 3968 KB Output is correct
36 Correct 8 ms 3328 KB Output is correct
37 Correct 13 ms 4256 KB Output is correct
38 Correct 14 ms 4352 KB Output is correct
39 Correct 16 ms 4352 KB Output is correct
40 Correct 13 ms 4352 KB Output is correct
41 Correct 15 ms 4352 KB Output is correct
42 Correct 13 ms 4604 KB Output is correct
43 Correct 14 ms 4604 KB Output is correct
44 Correct 15 ms 4624 KB Output is correct
45 Correct 38 ms 7544 KB Output is correct
46 Correct 16 ms 4608 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 6 ms 2432 KB Output is correct
6 Correct 6 ms 2432 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct
8 Correct 6 ms 2432 KB Output is correct
9 Correct 6 ms 2560 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 6 ms 2560 KB Output is correct
12 Correct 6 ms 2560 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 6 ms 2560 KB Output is correct
15 Correct 6 ms 2560 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 7 ms 3712 KB Output is correct
19 Correct 7 ms 3840 KB Output is correct
20 Correct 8 ms 4096 KB Output is correct
21 Correct 7 ms 2688 KB Output is correct
22 Correct 7 ms 3712 KB Output is correct
23 Correct 8 ms 3712 KB Output is correct
24 Correct 8 ms 3840 KB Output is correct
25 Correct 8 ms 3840 KB Output is correct
26 Correct 8 ms 3968 KB Output is correct
27 Correct 8 ms 4096 KB Output is correct
28 Correct 10 ms 4352 KB Output is correct
29 Correct 22 ms 6272 KB Output is correct
30 Correct 11 ms 4608 KB Output is correct
31 Correct 15 ms 5120 KB Output is correct
32 Correct 10 ms 4352 KB Output is correct
33 Correct 30 ms 7160 KB Output is correct
34 Correct 17 ms 5120 KB Output is correct
35 Correct 14 ms 3968 KB Output is correct
36 Correct 7 ms 3328 KB Output is correct
37 Correct 13 ms 4224 KB Output is correct
38 Correct 15 ms 4480 KB Output is correct
39 Correct 14 ms 4352 KB Output is correct
40 Correct 17 ms 4352 KB Output is correct
41 Correct 14 ms 4480 KB Output is correct
42 Correct 12 ms 4604 KB Output is correct
43 Correct 13 ms 4604 KB Output is correct
44 Correct 16 ms 4624 KB Output is correct
45 Correct 36 ms 7480 KB Output is correct
46 Correct 17 ms 4608 KB Output is correct
47 Correct 32 ms 11972 KB Output is correct
48 Correct 46 ms 19016 KB Output is correct
49 Correct 52 ms 20472 KB Output is correct
50 Correct 54 ms 22136 KB Output is correct
51 Correct 78 ms 24388 KB Output is correct
52 Correct 75 ms 24384 KB Output is correct
53 Correct 67 ms 23928 KB Output is correct
54 Correct 60 ms 23928 KB Output is correct
55 Correct 62 ms 24440 KB Output is correct
56 Correct 74 ms 25976 KB Output is correct
57 Correct 57 ms 23288 KB Output is correct
58 Correct 78 ms 27124 KB Output is correct
59 Correct 80 ms 26752 KB Output is correct
60 Correct 79 ms 26740 KB Output is correct
61 Correct 76 ms 26232 KB Output is correct
62 Correct 156 ms 33844 KB Output is correct
63 Correct 118 ms 26476 KB Output is correct
64 Correct 121 ms 25960 KB Output is correct
65 Correct 876 ms 71528 KB Output is correct
66 Execution timed out 1096 ms 78312 KB Time limit exceeded
67 Halted 0 ms 0 KB -