oj.uz

Submission #386720

# Submission time Handle Problem Language Result Execution time Memory
386720 2021-04-07T08:38:41 Z wenqi Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 32 ms 19692 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 969000000
#define OM (O / MID + 69)

int N, M;

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

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

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

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

int dp_small(int pos, int step) {
    int& ans = smallc[pos][step];
    if(ans != -2) return ans;
    ans = MAX;
    int 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));
    }
    return ans = a;
}

int dp_big(int i, int offset) {
    int& 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, int, -2);
    fillc(bigc, int, -2);
    int ans;
    if(P[0] < MID) {
        ans = dp_small(B[0], P[0]);
    }else{
        ans = dp_big(0, OM);
    }
    cout << (ans >= MAX ? -1 : ans) << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 19436 KB Output is correct
2 Correct 13 ms 19436 KB Output is correct
3 Correct 16 ms 19436 KB Output is correct
4 Correct 13 ms 19436 KB Output is correct
5 Correct 14 ms 19436 KB Output is correct
6 Correct 15 ms 19436 KB Output is correct
7 Correct 16 ms 19436 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19436 KB Output is correct
2 Correct 13 ms 19436 KB Output is correct
3 Correct 13 ms 19436 KB Output is correct
4 Correct 13 ms 19436 KB Output is correct
5 Correct 13 ms 19436 KB Output is correct
6 Correct 18 ms 19436 KB Output is correct
7 Correct 13 ms 19436 KB Output is correct
8 Correct 15 ms 19436 KB Output is correct
9 Correct 13 ms 19436 KB Output is correct
10 Correct 13 ms 19436 KB Output is correct
11 Correct 14 ms 19564 KB Output is correct
12 Correct 13 ms 19436 KB Output is correct
13 Correct 14 ms 19436 KB Output is correct
14 Correct 16 ms 19436 KB Output is correct
15 Correct 16 ms 19436 KB Output is correct
16 Correct 14 ms 19436 KB Output is correct
17 Correct 15 ms 19692 KB Output is correct
18 Correct 13 ms 19436 KB Output is correct
19 Correct 13 ms 19436 KB Output is correct
20 Correct 14 ms 19692 KB Output is correct
21 Correct 13 ms 19436 KB Output is correct
22 Correct 14 ms 19584 KB Output is correct
23 Incorrect 14 ms 19564 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19436 KB Output is correct
2 Correct 14 ms 19436 KB Output is correct
3 Correct 13 ms 19436 KB Output is correct
4 Correct 13 ms 19436 KB Output is correct
5 Correct 13 ms 19436 KB Output is correct
6 Correct 13 ms 19456 KB Output is correct
7 Correct 14 ms 19436 KB Output is correct
8 Correct 13 ms 19436 KB Output is correct
9 Correct 15 ms 19436 KB Output is correct
10 Correct 13 ms 19436 KB Output is correct
11 Correct 28 ms 19564 KB Output is correct
12 Correct 22 ms 19436 KB Output is correct
13 Correct 14 ms 19436 KB Output is correct
14 Correct 15 ms 19436 KB Output is correct
15 Correct 14 ms 19436 KB Output is correct
16 Correct 28 ms 19436 KB Output is correct
17 Correct 15 ms 19692 KB Output is correct
18 Correct 30 ms 19436 KB Output is correct
19 Correct 14 ms 19436 KB Output is correct
20 Correct 14 ms 19692 KB Output is correct
21 Correct 14 ms 19436 KB Output is correct
22 Correct 14 ms 19436 KB Output is correct
23 Incorrect 14 ms 19564 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19436 KB Output is correct
2 Correct 14 ms 19436 KB Output is correct
3 Correct 13 ms 19436 KB Output is correct
4 Correct 13 ms 19436 KB Output is correct
5 Correct 13 ms 19436 KB Output is correct
6 Correct 17 ms 19436 KB Output is correct
7 Correct 14 ms 19436 KB Output is correct
8 Correct 13 ms 19436 KB Output is correct
9 Correct 13 ms 19436 KB Output is correct
10 Correct 13 ms 19436 KB Output is correct
11 Correct 14 ms 19564 KB Output is correct
12 Correct 14 ms 19436 KB Output is correct
13 Correct 30 ms 19436 KB Output is correct
14 Correct 14 ms 19436 KB Output is correct
15 Correct 14 ms 19436 KB Output is correct
16 Correct 14 ms 19436 KB Output is correct
17 Correct 32 ms 19692 KB Output is correct
18 Correct 29 ms 19436 KB Output is correct
19 Correct 13 ms 19436 KB Output is correct
20 Correct 14 ms 19692 KB Output is correct
21 Correct 29 ms 19436 KB Output is correct
22 Correct 13 ms 19436 KB Output is correct
23 Incorrect 15 ms 19564 KB Output isn't correct
24 Halted 0 ms 0 KB -