oj.uz

답안 #386658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386658 2021-04-07T07:34:18 Z wenqi Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 72 ms 96236 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 169
#define O 30069
#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];
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 = O;
    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 - step >= 0) {
        ans = min(ans, 1 + dp_small(pos - step, step));
    }
    if(pos + step < N) {
        ans = min(ans, 1 + dp_small(pos + step, step));
    }
    return ans;
}

int dp_big(int i, int offset) {
    int& ans = bigc[i][offset];
    if(ans != -2) return ans;
    ans = O;
    if(i == 1) return ans = 0;
    int pos = B[i] + (offset - OM) * P[i];
    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 == O ? -1 : ans) << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 95724 KB Output is correct
2 Correct 56 ms 95852 KB Output is correct
3 Correct 55 ms 95724 KB Output is correct
4 Correct 54 ms 95724 KB Output is correct
5 Correct 54 ms 95852 KB Output is correct
6 Correct 59 ms 95852 KB Output is correct
7 Correct 62 ms 95724 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 95724 KB Output is correct
2 Correct 56 ms 95980 KB Output is correct
3 Correct 55 ms 95724 KB Output is correct
4 Correct 54 ms 95724 KB Output is correct
5 Correct 55 ms 95724 KB Output is correct
6 Correct 54 ms 95852 KB Output is correct
7 Correct 54 ms 95724 KB Output is correct
8 Correct 55 ms 95724 KB Output is correct
9 Correct 55 ms 95724 KB Output is correct
10 Correct 57 ms 95980 KB Output is correct
11 Correct 60 ms 95980 KB Output is correct
12 Correct 56 ms 95980 KB Output is correct
13 Correct 54 ms 95772 KB Output is correct
14 Correct 56 ms 95980 KB Output is correct
15 Correct 56 ms 95852 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 95952 KB Output is correct
2 Correct 54 ms 95724 KB Output is correct
3 Correct 56 ms 95724 KB Output is correct
4 Correct 54 ms 95852 KB Output is correct
5 Correct 55 ms 95724 KB Output is correct
6 Correct 55 ms 95724 KB Output is correct
7 Correct 54 ms 95724 KB Output is correct
8 Correct 55 ms 95724 KB Output is correct
9 Correct 55 ms 95724 KB Output is correct
10 Correct 58 ms 95852 KB Output is correct
11 Correct 59 ms 95980 KB Output is correct
12 Correct 55 ms 95852 KB Output is correct
13 Correct 54 ms 95812 KB Output is correct
14 Correct 56 ms 95852 KB Output is correct
15 Correct 55 ms 95852 KB Output is correct
16 Correct 55 ms 95852 KB Output is correct
17 Correct 57 ms 96108 KB Output is correct
18 Correct 56 ms 95852 KB Output is correct
19 Correct 60 ms 95804 KB Output is correct
20 Correct 58 ms 96108 KB Output is correct
21 Correct 56 ms 95852 KB Output is correct
22 Correct 58 ms 95852 KB Output is correct
23 Incorrect 55 ms 95980 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 95724 KB Output is correct
2 Correct 65 ms 95724 KB Output is correct
3 Correct 56 ms 95724 KB Output is correct
4 Correct 54 ms 95724 KB Output is correct
5 Correct 57 ms 95724 KB Output is correct
6 Correct 57 ms 95724 KB Output is correct
7 Correct 55 ms 95724 KB Output is correct
8 Correct 55 ms 95724 KB Output is correct
9 Correct 67 ms 95980 KB Output is correct
10 Correct 55 ms 95852 KB Output is correct
11 Correct 56 ms 96088 KB Output is correct
12 Correct 55 ms 95852 KB Output is correct
13 Correct 57 ms 95980 KB Output is correct
14 Correct 72 ms 95852 KB Output is correct
15 Correct 58 ms 95852 KB Output is correct
16 Correct 56 ms 95852 KB Output is correct
17 Correct 55 ms 96108 KB Output is correct
18 Correct 55 ms 95852 KB Output is correct
19 Correct 54 ms 95852 KB Output is correct
20 Correct 56 ms 96236 KB Output is correct
21 Correct 64 ms 95852 KB Output is correct
22 Correct 55 ms 95852 KB Output is correct
23 Incorrect 56 ms 95980 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 95724 KB Output is correct
2 Correct 55 ms 95724 KB Output is correct
3 Correct 57 ms 95852 KB Output is correct
4 Correct 55 ms 95724 KB Output is correct
5 Correct 54 ms 95724 KB Output is correct
6 Correct 55 ms 95724 KB Output is correct
7 Correct 55 ms 95724 KB Output is correct
8 Correct 54 ms 95724 KB Output is correct
9 Correct 55 ms 95724 KB Output is correct
10 Correct 55 ms 95852 KB Output is correct
11 Correct 56 ms 95980 KB Output is correct
12 Correct 55 ms 95852 KB Output is correct
13 Correct 55 ms 95852 KB Output is correct
14 Correct 56 ms 95980 KB Output is correct
15 Correct 56 ms 95852 KB Output is correct
16 Correct 56 ms 95852 KB Output is correct
17 Correct 56 ms 96108 KB Output is correct
18 Correct 55 ms 95852 KB Output is correct
19 Correct 55 ms 95852 KB Output is correct
20 Correct 55 ms 96108 KB Output is correct
21 Correct 54 ms 95852 KB Output is correct
22 Correct 55 ms 95852 KB Output is correct
23 Incorrect 55 ms 95980 KB Output isn't correct
24 Halted 0 ms 0 KB -