oj.uz

Submission #23444

# Submission time Handle Problem Language Result Execution time Memory
23444 2017-05-09T16:04:08 Z duongthoi1999 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 77612 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
const int mod = (int) 1e9 + 7;
const ll inf = 1LL << 60;
const int maxn = (int) 3e4 + 5;
const ld eps = 1e-9;

int n, m, b[maxn], p[maxn], f[maxn];
map<int, int> d[maxn];
vector<int> a[maxn];
deque<pair<int, ii> > pq;

int main() {
    //freopen("test.txt", "r", stdin);
    cin >> n >> m;
    rep(i, 0, m) {
        cin >> b[i] >> p[i];
//        b[i] = rand() % n;
//        p[i] = rand() % 30000 + 1;
        a[b[i]].pb(p[i]);
        d[b[i]][p[i]] = mod;
    }
    rep(i, 0, n) {
        sort(all(a[i]));
        a[i].resize(unique(all(a[i])) - a[i].begin());
    }
    d[b[0]][p[0]] = 0;
    pq.push_back(make_pair(0, ii(b[0], p[0])));
    while(!pq.empty()) {
        int du = pq.front().fi;
        int u = pq.front().se.fi;
        int t = pq.front().se.se;
        pq.pop_front();
        if(du != d[u][t]) continue;
        rep(i, -1, 2) if(i) {
            int v = u + i * t;
            if(v < 0 || v >= n) continue;
            if(d[v].count(t) && d[v][t] <= du + 1) continue;
            d[v][t] = du + 1;
            pq.push_back(make_pair(du + 1, ii(v, t)));
        }
        if(f[u]) continue;
        for (auto s : a[u]) {
            d[u][s] = du;
            pq.push_front(make_pair(du, ii(u, s)));
        }
        f[u] = 1;
    }
    if(d[b[1]][p[1]] != mod) cout << d[b[1]][p[1]] << '\n';
    else cout << "-1\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4488 KB Output is correct
2 Correct 0 ms 4488 KB Output is correct
3 Correct 0 ms 4488 KB Output is correct
4 Correct 0 ms 4488 KB Output is correct
5 Correct 0 ms 4488 KB Output is correct
6 Correct 0 ms 4488 KB Output is correct
7 Correct 0 ms 4488 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4488 KB Output is correct
2 Correct 0 ms 4488 KB Output is correct
3 Correct 0 ms 4488 KB Output is correct
4 Correct 0 ms 4488 KB Output is correct
5 Correct 0 ms 4488 KB Output is correct
6 Correct 0 ms 4488 KB Output is correct
7 Correct 0 ms 4488 KB Output is correct
8 Correct 0 ms 4488 KB Output is correct
9 Correct 0 ms 4488 KB Output is correct
10 Correct 0 ms 4620 KB Output is correct
11 Correct 0 ms 4752 KB Output is correct
12 Correct 0 ms 4488 KB Output is correct
13 Correct 0 ms 4488 KB Output is correct
14 Correct 3 ms 4752 KB Output is correct
15 Correct 3 ms 4752 KB Output is correct
16 Correct 0 ms 4488 KB Output is correct
17 Correct 9 ms 5280 KB Output is correct
18 Correct 0 ms 4620 KB Output is correct
19 Correct 0 ms 4488 KB Output is correct
20 Correct 0 ms 4620 KB Output is correct
21 Correct 3 ms 4620 KB Output is correct
22 Correct 0 ms 4620 KB Output is correct
23 Correct 0 ms 4884 KB Output is correct
24 Correct 0 ms 5148 KB Output is correct
25 Correct 3 ms 4884 KB Output is correct
26 Correct 3 ms 4884 KB Output is correct
27 Correct 3 ms 4884 KB Output is correct
28 Correct 3 ms 5676 KB Output is correct
29 Correct 26 ms 7392 KB Output is correct
30 Correct 6 ms 5280 KB Output is correct
31 Correct 13 ms 6072 KB Output is correct
32 Correct 0 ms 5676 KB Output is correct
33 Correct 59 ms 10296 KB Output is correct
34 Correct 53 ms 10296 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4488 KB Output is correct
2 Correct 0 ms 4488 KB Output is correct
3 Correct 0 ms 4488 KB Output is correct
4 Correct 0 ms 4488 KB Output is correct
5 Correct 0 ms 4488 KB Output is correct
6 Correct 0 ms 4488 KB Output is correct
7 Correct 0 ms 4488 KB Output is correct
8 Correct 0 ms 4488 KB Output is correct
9 Correct 0 ms 4488 KB Output is correct
10 Correct 0 ms 4620 KB Output is correct
11 Correct 3 ms 4752 KB Output is correct
12 Correct 0 ms 4488 KB Output is correct
13 Correct 0 ms 4488 KB Output is correct
14 Correct 3 ms 4752 KB Output is correct
15 Correct 3 ms 4752 KB Output is correct
16 Correct 0 ms 4488 KB Output is correct
17 Correct 6 ms 5280 KB Output is correct
18 Correct 0 ms 4620 KB Output is correct
19 Correct 0 ms 4488 KB Output is correct
20 Correct 3 ms 4620 KB Output is correct
21 Correct 0 ms 4620 KB Output is correct
22 Correct 0 ms 4620 KB Output is correct
23 Correct 3 ms 4884 KB Output is correct
24 Correct 6 ms 5148 KB Output is correct
25 Correct 3 ms 4884 KB Output is correct
26 Correct 3 ms 4884 KB Output is correct
27 Correct 3 ms 4884 KB Output is correct
28 Correct 6 ms 5676 KB Output is correct
29 Correct 26 ms 7392 KB Output is correct
30 Correct 3 ms 5280 KB Output is correct
31 Correct 6 ms 6072 KB Output is correct
32 Correct 3 ms 5676 KB Output is correct
33 Correct 66 ms 10296 KB Output is correct
34 Correct 59 ms 10296 KB Output is correct
35 Correct 83 ms 9628 KB Output is correct
36 Correct 9 ms 5412 KB Output is correct
37 Correct 163 ms 12936 KB Output is correct
38 Correct 146 ms 12404 KB Output is correct
39 Correct 136 ms 12392 KB Output is correct
40 Correct 173 ms 12400 KB Output is correct
41 Correct 156 ms 12404 KB Output is correct
42 Correct 19 ms 4968 KB Output is correct
43 Correct 16 ms 4980 KB Output is correct
44 Correct 16 ms 4768 KB Output is correct
45 Correct 409 ms 27588 KB Output is correct
46 Correct 379 ms 27588 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4488 KB Output is correct
2 Correct 0 ms 4488 KB Output is correct
3 Correct 0 ms 4488 KB Output is correct
4 Correct 0 ms 4488 KB Output is correct
5 Correct 0 ms 4488 KB Output is correct
6 Correct 0 ms 4488 KB Output is correct
7 Correct 0 ms 4488 KB Output is correct
8 Correct 0 ms 4488 KB Output is correct
9 Correct 0 ms 4488 KB Output is correct
10 Correct 0 ms 4620 KB Output is correct
11 Correct 3 ms 4752 KB Output is correct
12 Correct 0 ms 4488 KB Output is correct
13 Correct 3 ms 4488 KB Output is correct
14 Correct 0 ms 4752 KB Output is correct
15 Correct 3 ms 4752 KB Output is correct
16 Correct 0 ms 4488 KB Output is correct
17 Correct 9 ms 5280 KB Output is correct
18 Correct 3 ms 4620 KB Output is correct
19 Correct 0 ms 4488 KB Output is correct
20 Correct 3 ms 4620 KB Output is correct
21 Correct 3 ms 4620 KB Output is correct
22 Correct 3 ms 4620 KB Output is correct
23 Correct 3 ms 4884 KB Output is correct
24 Correct 9 ms 5148 KB Output is correct
25 Correct 3 ms 4884 KB Output is correct
26 Correct 0 ms 4884 KB Output is correct
27 Correct 3 ms 4884 KB Output is correct
28 Correct 6 ms 5676 KB Output is correct
29 Correct 29 ms 7392 KB Output is correct
30 Correct 3 ms 5280 KB Output is correct
31 Correct 9 ms 6072 KB Output is correct
32 Correct 6 ms 5676 KB Output is correct
33 Correct 63 ms 10296 KB Output is correct
34 Correct 63 ms 10296 KB Output is correct
35 Correct 96 ms 9628 KB Output is correct
36 Correct 9 ms 5412 KB Output is correct
37 Correct 169 ms 12936 KB Output is correct
38 Correct 153 ms 12404 KB Output is correct
39 Correct 163 ms 12392 KB Output is correct
40 Correct 139 ms 12400 KB Output is correct
41 Correct 133 ms 12404 KB Output is correct
42 Correct 13 ms 4968 KB Output is correct
43 Correct 19 ms 4980 KB Output is correct
44 Correct 16 ms 4768 KB Output is correct
45 Correct 389 ms 27588 KB Output is correct
46 Correct 416 ms 27588 KB Output is correct
47 Correct 759 ms 39860 KB Output is correct
48 Correct 19 ms 5940 KB Output is correct
49 Correct 26 ms 5940 KB Output is correct
50 Correct 16 ms 5544 KB Output is correct
51 Correct 253 ms 20196 KB Output is correct
52 Correct 296 ms 21516 KB Output is correct
53 Correct 63 ms 9344 KB Output is correct
54 Correct 3 ms 5280 KB Output is correct
55 Correct 0 ms 5676 KB Output is correct
56 Correct 39 ms 6864 KB Output is correct
57 Correct 303 ms 25212 KB Output is correct
58 Correct 23 ms 7864 KB Output is correct
59 Correct 46 ms 9188 KB Output is correct
60 Correct 59 ms 10528 KB Output is correct
61 Correct 46 ms 9756 KB Output is correct
62 Correct 419 ms 28908 KB Output is correct
63 Execution timed out 1000 ms 77612 KB Execution timed out
64 Halted 0 ms 0 KB -