oj.uz

Submission #959884

# Submission time Handle Problem Language Result Execution time Memory
959884 2024-04-09T09:19:23 Z quanlt206 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 71508 KB 
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 3e4 + 7;
const int M = 3e4 + 7;

int n, m, a[M], b[M];

vector<int> v[N];

int col0 = 0, col1 = 1;

map<int, int> d[N];

void update_front(int x, int a, deque<pii>& dq, int cost) {
    if (d[x].find(a) == d[x].end()) {
        d[x][a] = cost;
        dq.push_front({x, a});
    }
    else
    if (minimize(d[x][a], cost)) dq.push_front({x, a});
}
void update_back(int x, int a, deque<pii>& dq, int cost) {
    if (d[x].find(a) == d[x].end()) {
        d[x][a] = cost;
        dq.push_back({x, a});
    }
    else
    if (minimize(d[x][a], cost)) dq.push_back({x, a});
}
void bfs(int s, int x, int t) {
    deque<pii> dq;
    dq.push_front({s, x});
    d[s][x] = 0;
    while (!dq.empty()) {
        pii tmp = dq.front();
        dq.pop_front();
        int x = tmp.X, y = tmp.Y;
        if (x == t) {
            cout<<d[x][y];
            exit(0);
        }
        for (auto a : v[x]) update_front(x, a, dq, d[x][y]);
        v[x].clear();
        if (x - y >= 0) update_back(x - y, y, dq, d[x][y] + 1);
        if (x + y < n) update_back(x + y, y, dq, d[x][y] + 1);
    }
    cout<<-1;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    REP(i, 0, m) {
        cin>>a[i]>>b[i];
        v[a[i]].push_back(b[i]);
    }
    bfs(a[0], b[0], a[1]);
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2484 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2684 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 2 ms 2908 KB Output is correct
25 Correct 1 ms 2744 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2908 KB Output is correct
28 Correct 4 ms 3676 KB Output is correct
29 Correct 13 ms 5468 KB Output is correct
30 Correct 3 ms 3420 KB Output is correct
31 Correct 7 ms 4188 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 36 ms 8312 KB Output is correct
34 Correct 17 ms 5724 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2688 KB Output is correct
12 Correct 1 ms 2696 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 2 ms 2908 KB Output is correct
18 Correct 1 ms 2692 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 2 ms 3008 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 1 ms 2908 KB Output is correct
28 Correct 4 ms 3676 KB Output is correct
29 Correct 13 ms 5468 KB Output is correct
30 Correct 4 ms 3420 KB Output is correct
31 Correct 7 ms 4184 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 35 ms 8280 KB Output is correct
34 Correct 17 ms 5800 KB Output is correct
35 Correct 13 ms 5400 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 10 ms 4896 KB Output is correct
38 Correct 9 ms 4532 KB Output is correct
39 Correct 5 ms 3160 KB Output is correct
40 Correct 6 ms 3420 KB Output is correct
41 Correct 6 ms 3676 KB Output is correct
42 Correct 4 ms 3164 KB Output is correct
43 Correct 5 ms 3160 KB Output is correct
44 Correct 4 ms 3164 KB Output is correct
45 Correct 283 ms 25704 KB Output is correct
46 Correct 111 ms 15804 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2680 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2688 KB Output is correct
14 Correct 2 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 2 ms 2908 KB Output is correct
17 Correct 2 ms 2716 KB Output is correct
18 Correct 1 ms 2648 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 2 ms 2904 KB Output is correct
24 Correct 2 ms 2908 KB Output is correct
25 Correct 1 ms 2692 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 2 ms 2908 KB Output is correct
28 Correct 4 ms 3672 KB Output is correct
29 Correct 13 ms 5468 KB Output is correct
30 Correct 4 ms 3676 KB Output is correct
31 Correct 6 ms 4188 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 34 ms 8272 KB Output is correct
34 Correct 17 ms 5636 KB Output is correct
35 Correct 13 ms 5468 KB Output is correct
36 Correct 2 ms 2764 KB Output is correct
37 Correct 10 ms 4936 KB Output is correct
38 Correct 9 ms 4440 KB Output is correct
39 Correct 5 ms 3164 KB Output is correct
40 Correct 6 ms 3608 KB Output is correct
41 Correct 6 ms 3676 KB Output is correct
42 Correct 4 ms 3164 KB Output is correct
43 Correct 4 ms 3164 KB Output is correct
44 Correct 4 ms 3164 KB Output is correct
45 Correct 257 ms 25536 KB Output is correct
46 Correct 126 ms 15856 KB Output is correct
47 Correct 7 ms 4184 KB Output is correct
48 Correct 6 ms 3416 KB Output is correct
49 Correct 4 ms 3420 KB Output is correct
50 Correct 3 ms 3104 KB Output is correct
51 Correct 13 ms 6100 KB Output is correct
52 Correct 15 ms 6748 KB Output is correct
53 Correct 6 ms 3932 KB Output is correct
54 Correct 2 ms 3164 KB Output is correct
55 Correct 3 ms 3676 KB Output is correct
56 Correct 7 ms 5212 KB Output is correct
57 Correct 1 ms 2652 KB Output is correct
58 Correct 10 ms 6060 KB Output is correct
59 Correct 9 ms 5724 KB Output is correct
60 Correct 9 ms 5724 KB Output is correct
61 Correct 9 ms 5452 KB Output is correct
62 Correct 133 ms 25004 KB Output is correct
63 Execution timed out 1075 ms 71508 KB Time limit exceeded
64 Halted 0 ms 0 KB -