oj.uz

Submission #23448

# Submission time Handle Problem Language Result Execution time Memory
23448 2017-05-09T16:23:34 Z duongthoi1999 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 356 ms 114104 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];
bitset<30005> d[maxn];
vector<int> a[maxn];
deque<pair<int, ii> > pq;

int main() {
    //freopen("test.txt", "r", stdin);
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    rep(i, 0, m) {
        cin >> b[i] >> p[i];
        a[b[i]].pb(p[i]);
    }
    rep(i, 0, n) {
        sort(all(a[i]));
        a[i].resize(unique(all(a[i])) - a[i].begin());
    }
    d[b[0]][p[0]] = 1;
    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;
        if(u == b[1] && t == p[1]) return cout << du << '\n', 0;
        pq.pop_front();
        rep(i, -1, 2) if(i) {
            int v = u + i * t;
            if(v < 0 || v >= n || v == u) continue;
            if(d[v][t]) continue;
            d[v][t] = 1;
            pq.push_back(make_pair(du + 1, ii(v, t)));
        }
        if(f[u]) continue;
        for (auto s : a[u]) {
            d[u][s] = 1;
            pq.push_front(make_pair(du, ii(u, s)));
        }
        f[u] = 1;
    }
    cout << "-1\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 113180 KB Output is correct
2 Correct 0 ms 113180 KB Output is correct
3 Correct 0 ms 113180 KB Output is correct
4 Correct 0 ms 113180 KB Output is correct
5 Correct 0 ms 113180 KB Output is correct
6 Correct 0 ms 113180 KB Output is correct
7 Correct 0 ms 113180 KB Output is correct
8 Correct 0 ms 113180 KB Output is correct
9 Correct 0 ms 113180 KB Output is correct
10 Correct 0 ms 113180 KB Output is correct
11 Correct 0 ms 113180 KB Output is correct
12 Correct 0 ms 113180 KB Output is correct
13 Correct 0 ms 113180 KB Output is correct
14 Correct 0 ms 113180 KB Output is correct
15 Correct 0 ms 113180 KB Output is correct
16 Correct 0 ms 113180 KB Output is correct
17 Correct 0 ms 113180 KB Output is correct
18 Correct 0 ms 113180 KB Output is correct
19 Correct 0 ms 113180 KB Output is correct
20 Correct 0 ms 113180 KB Output is correct
21 Correct 0 ms 113180 KB Output is correct
22 Correct 0 ms 113180 KB Output is correct
23 Correct 0 ms 113180 KB Output is correct
24 Correct 0 ms 113180 KB Output is correct
25 Correct 0 ms 113180 KB Output is correct
26 Correct 0 ms 113180 KB Output is correct
27 Correct 3 ms 113180 KB Output is correct
28 Correct 0 ms 113180 KB Output is correct
29 Correct 3 ms 113180 KB Output is correct
30 Correct 3 ms 113180 KB Output is correct
31 Correct 0 ms 113180 KB Output is correct
32 Correct 0 ms 113180 KB Output is correct
33 Correct 3 ms 113180 KB Output is correct
34 Correct 6 ms 113180 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 113180 KB Output is correct
2 Correct 0 ms 113180 KB Output is correct
3 Correct 0 ms 113180 KB Output is correct
4 Correct 0 ms 113180 KB Output is correct
5 Correct 0 ms 113180 KB Output is correct
6 Correct 0 ms 113180 KB Output is correct
7 Correct 0 ms 113180 KB Output is correct
8 Correct 0 ms 113180 KB Output is correct
9 Correct 0 ms 113180 KB Output is correct
10 Correct 0 ms 113180 KB Output is correct
11 Correct 0 ms 113180 KB Output is correct
12 Correct 0 ms 113180 KB Output is correct
13 Correct 0 ms 113180 KB Output is correct
14 Correct 0 ms 113180 KB Output is correct
15 Correct 0 ms 113180 KB Output is correct
16 Correct 0 ms 113180 KB Output is correct
17 Correct 0 ms 113180 KB Output is correct
18 Correct 0 ms 113180 KB Output is correct
19 Correct 0 ms 113180 KB Output is correct
20 Correct 3 ms 113180 KB Output is correct
21 Correct 0 ms 113180 KB Output is correct
22 Correct 0 ms 113180 KB Output is correct
23 Correct 3 ms 113180 KB Output is correct
24 Correct 3 ms 113180 KB Output is correct
25 Correct 0 ms 113180 KB Output is correct
26 Correct 0 ms 113180 KB Output is correct
27 Correct 3 ms 113180 KB Output is correct
28 Correct 0 ms 113180 KB Output is correct
29 Correct 3 ms 113180 KB Output is correct
30 Correct 0 ms 113180 KB Output is correct
31 Correct 0 ms 113180 KB Output is correct
32 Correct 3 ms 113180 KB Output is correct
33 Correct 3 ms 113180 KB Output is correct
34 Correct 3 ms 113180 KB Output is correct
35 Correct 6 ms 113576 KB Output is correct
36 Correct 3 ms 113180 KB Output is correct
37 Correct 6 ms 113576 KB Output is correct
38 Correct 6 ms 113572 KB Output is correct
39 Correct 9 ms 113444 KB Output is correct
40 Correct 9 ms 113444 KB Output is correct
41 Correct 9 ms 113444 KB Output is correct
42 Correct 3 ms 113344 KB Output is correct
43 Correct 6 ms 113344 KB Output is correct
44 Correct 9 ms 113340 KB Output is correct
45 Correct 16 ms 113704 KB Output is correct
46 Correct 16 ms 113708 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 113180 KB Output is correct
2 Correct 0 ms 113180 KB Output is correct
3 Correct 0 ms 113180 KB Output is correct
4 Correct 0 ms 113180 KB Output is correct
5 Correct 0 ms 113180 KB Output is correct
6 Correct 0 ms 113180 KB Output is correct
7 Correct 0 ms 113180 KB Output is correct
8 Correct 0 ms 113180 KB Output is correct
9 Correct 0 ms 113180 KB Output is correct
10 Correct 0 ms 113180 KB Output is correct
11 Correct 0 ms 113180 KB Output is correct
12 Correct 0 ms 113180 KB Output is correct
13 Correct 0 ms 113180 KB Output is correct
14 Correct 0 ms 113180 KB Output is correct
15 Correct 0 ms 113180 KB Output is correct
16 Correct 0 ms 113180 KB Output is correct
17 Correct 3 ms 113180 KB Output is correct
18 Correct 0 ms 113180 KB Output is correct
19 Correct 0 ms 113180 KB Output is correct
20 Correct 0 ms 113180 KB Output is correct
21 Correct 0 ms 113180 KB Output is correct
22 Correct 0 ms 113180 KB Output is correct
23 Correct 0 ms 113180 KB Output is correct
24 Correct 0 ms 113180 KB Output is correct
25 Correct 0 ms 113180 KB Output is correct
26 Correct 3 ms 113180 KB Output is correct
27 Correct 6 ms 113180 KB Output is correct
28 Correct 6 ms 113180 KB Output is correct
29 Correct 3 ms 113180 KB Output is correct
30 Correct 0 ms 113180 KB Output is correct
31 Correct 3 ms 113180 KB Output is correct
32 Correct 3 ms 113180 KB Output is correct
33 Correct 3 ms 113180 KB Output is correct
34 Correct 3 ms 113180 KB Output is correct
35 Correct 9 ms 113576 KB Output is correct
36 Correct 0 ms 113180 KB Output is correct
37 Correct 6 ms 113576 KB Output is correct
38 Correct 9 ms 113572 KB Output is correct
39 Correct 13 ms 113444 KB Output is correct
40 Correct 6 ms 113444 KB Output is correct
41 Correct 9 ms 113444 KB Output is correct
42 Correct 6 ms 113344 KB Output is correct
43 Correct 9 ms 113344 KB Output is correct
44 Correct 6 ms 113340 KB Output is correct
45 Correct 26 ms 113704 KB Output is correct
46 Correct 13 ms 113708 KB Output is correct
47 Correct 13 ms 113576 KB Output is correct
48 Correct 3 ms 113576 KB Output is correct
49 Correct 6 ms 113576 KB Output is correct
50 Correct 6 ms 113444 KB Output is correct
51 Correct 39 ms 113840 KB Output is correct
52 Correct 39 ms 113840 KB Output is correct
53 Correct 16 ms 113708 KB Output is correct
54 Correct 16 ms 113180 KB Output is correct
55 Correct 13 ms 113180 KB Output is correct
56 Correct 26 ms 114104 KB Output is correct
57 Correct 3 ms 113180 KB Output is correct
58 Correct 36 ms 113340 KB Output is correct
59 Correct 36 ms 113344 KB Output is correct
60 Correct 36 ms 113348 KB Output is correct
61 Correct 23 ms 113356 KB Output is correct
62 Correct 99 ms 114104 KB Output is correct
63 Correct 163 ms 113576 KB Output is correct
64 Correct 163 ms 113572 KB Output is correct
65 Correct 206 ms 113708 KB Output is correct
66 Correct 356 ms 113708 KB Output is correct
67 Correct 169 ms 113708 KB Output is correct