oj.uz

Submission #386773

# Submission time Handle Problem Language Result Execution time Memory
386773 2021-04-07T09:36:43 Z wenqi Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 32 ms 38656 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define all(x) begin(x), end(x)
#define fillc(p, t, v) fill_n((t*) p, sizeof(p) / sizeof(t), v)
#define pb push_back

#define MID 2069
#define O 2069
#define MAX 96900000000ll
#define K 9999999999699ll
#define OM (O / MID + 69)

int N, M;

int B[O];
int P[O];
int TP;

vector<int> SMALL[O];
vector<int> BIG[O];

ll smallc[O][MID + 69];
bool seen1[O][MID + 69];
ll bigc[O][2 * OM + 69];

ll dp_small(int, int);
ll dp_big(int, int);

ll dp_small(int pos, int step) {
    ll& ans = smallc[pos][step];
    if(ans != -2) return ans;
    ans = K;
    ll a = ans;
    if(pos == TP) return ans = 0;
    for(int j : SMALL[pos]) {
        a = min(a, dp_small(B[j], P[j]));
    }
    for(int j : BIG[pos]) {
        a = min(a, dp_big(j, OM));
    }
    if(pos - step >= 0) {
        a = min(a, 1 + dp_small(pos - step, step));
    }
    if(pos + step < N) {
        a = min(a, 1 + dp_small(pos + step, step));
    }
    if(a == K) {
        ans = -2;
        return K;
    }else{
        ans = min(ans, MAX);
        return ans = a;
    }
}

ll dp_big(int i, int offset) {
    ll& ans = bigc[i][offset];
    if(ans != -2) return ans;
    ans = MAX;
    int pos = B[i] + (offset - OM) * P[i];
    if(pos == TP) return ans = 0;
    for(int j : SMALL[pos]) {
        ans = min(ans, dp_small(B[j], P[j]));
    }
    for(int j : BIG[pos]) {
        ans = min(ans, dp_big(j, OM));
    }
    if(pos - P[i] >= 0) {
        ans = min(ans, 1 + dp_big(i, offset - 1));
    }
    if(pos + P[i] < N) {
        ans = min(ans, 1 + dp_big(i, offset + 1));
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> N >> M;
    for(int i = 0; i < M; i++) {
        cin >> B[i] >> P[i];
        if(P[i] < MID)
            SMALL[B[i]].pb(i);
        else
            BIG[B[i]].pb(i);
        if(i == 1) TP = B[i];
    }
    fillc(smallc, ll, MAX);
    fillc(bigc, ll, MAX);
    smallc[B[0]][P[0]] = 0;
    queue<pair<int, int>> q;
    q.push({B[0], P[0]});
    while(not q.empty()) {
        auto p = q.front();
        q.pop();

        int pos, step;

        pos = p.first;
        step = p.second;

        ll dis = smallc[pos][step];

        for(int j : SMALL[pos]) {
            ll& c = smallc[B[j]][P[j]];
            if(dis < c) {
                c = dis;
                q.push({B[j], P[j]});
            }
        }

        if(pos - step >= 0) {
            ll& c = smallc[pos - step][step];
            if(dis + 1 < c) {
                c = dis + 1;
                q.push({pos - step, step});
            }
        }
        if(pos + step < N) {
            ll& c = smallc[pos + step][step];
            if(dis + 1 < c) {
                c = dis + 1;
                q.push({pos + step, step});
            }
        }
    }
    ll ans = MAX;
    for(auto k : smallc[TP])
        ans = min(ans, k);
    cout << (ans >= MAX ? -1 : ans) << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 38508 KB Output is correct
2 Correct 21 ms 38508 KB Output is correct
3 Correct 22 ms 38656 KB Output is correct
4 Correct 24 ms 38508 KB Output is correct
5 Correct 23 ms 38508 KB Output is correct
6 Correct 23 ms 38508 KB Output is correct
7 Correct 27 ms 38508 KB Output is correct
8 Correct 22 ms 38508 KB Output is correct
9 Correct 22 ms 38508 KB Output is correct
10 Correct 22 ms 38508 KB Output is correct
11 Correct 22 ms 38508 KB Output is correct
12 Correct 26 ms 38508 KB Output is correct
13 Correct 25 ms 38508 KB Output is correct
14 Correct 25 ms 38508 KB Output is correct
15 Correct 22 ms 38516 KB Output is correct
16 Correct 24 ms 38508 KB Output is correct
17 Correct 26 ms 38508 KB Output is correct
18 Correct 25 ms 38508 KB Output is correct
19 Correct 21 ms 38508 KB Output is correct
20 Correct 22 ms 38508 KB Output is correct
21 Correct 23 ms 38508 KB Output is correct
22 Correct 23 ms 38508 KB Output is correct
23 Correct 23 ms 38508 KB Output is correct
24 Correct 24 ms 38592 KB Output is correct
25 Correct 23 ms 38508 KB Output is correct
26 Correct 23 ms 38508 KB Output is correct
27 Correct 22 ms 38508 KB Output is correct
28 Correct 24 ms 38508 KB Output is correct
29 Correct 24 ms 38656 KB Output is correct
30 Correct 24 ms 38508 KB Output is correct
31 Correct 23 ms 38508 KB Output is correct
32 Correct 25 ms 38508 KB Output is correct
33 Correct 26 ms 38508 KB Output is correct
34 Correct 26 ms 38508 KB Output is correct
35 Incorrect 25 ms 38636 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

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