oj.uz

Submission #1031203

# Submission time Handle Problem Language Result Execution time Memory
1031203 2024-07-22T16:02:17 Z _8_8_ Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 660 ms 262144 KB 
#include <bits/stdc++.h>
 
using namespace std;
    
typedef long long ll;
const int  N = 5226152+12, MOD = (int)1e9+7;

const int M = 3e4 + 21;
int n,m,b[M],ft[M];
vector<int> g[N];
vector<pair<int,int>> x[M];
void add(int v,int u) {
    g[v].push_back(u);
    g[u].push_back(v);
}
bool sgn(int x) {
    return (x < n);
}
int d[N];
void test() {
    cin >> n >> m;
    for(int i = 0;i < m;i++) {
        int p;
        cin >> b[i] >> p;
        int d = b[i] % p;
        x[p].emplace_back(d,i);
    }
    int it = n - 1;
    int num = 0;
    for(int i = 1;i < n;i++){
        sort(x[i].begin(),x[i].end());
        for(int j = 0;j < (int)x[i].size();j++){
            if(!j || x[i][j].first != x[i][j - 1].first){
                num += (n - x[i][j].first) / i;
            }
        }
    }
    if(num > (int)3e4 * (int)180){
        cout << -2;
        return;
    }
    for(int i = 1;i < n;i++){
        for(int j = 0;j < (int)x[i].size();j++){
            if(!j || x[i][j].first != x[i][j - 1].first){
                // cout << i << ' ';
                for(int k = x[i][j].first;k < n;k += i){
                    ft[k] = ++it;
                    if(k - i >= 0){
                        add(ft[k - i],ft[k]);
                    }
                    g[ft[k]].push_back(k);
                }
            }
            int v = b[x[i][j].second];
            g[v].push_back(ft[v]);
        }
        // cout << '\n';
    }
    set<pair<int,int>> st;
    for(int i = 0;i <= it;i++){
        d[i] = 1e9;
    }
    st.insert({0,b[0]});
    d[b[0]] = 0;
    while(!st.empty()){
        auto [c,v] = (*st.begin());
        st.erase(st.begin());
        for(int to:g[v]){
            int w = (sgn(to) == sgn(v));
            if(d[to] > d[v] + w){
                st.erase({d[to],to});
                d[to] = d[v] + w;
                st.insert({d[to],to});
            }
        }
    }
    if(d[b[1]] == 1e9){
        d[b[1]] = -1;
    }
    cout << d[b[1]];
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 123728 KB Output is correct
2 Correct 47 ms 123728 KB Output is correct
3 Correct 47 ms 123728 KB Output is correct
4 Correct 64 ms 123876 KB Output is correct
5 Correct 52 ms 123756 KB Output is correct
6 Correct 56 ms 123736 KB Output is correct
7 Correct 53 ms 123840 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 123880 KB Output is correct
2 Correct 51 ms 123828 KB Output is correct
3 Correct 51 ms 123708 KB Output is correct
4 Correct 52 ms 123828 KB Output is correct
5 Correct 48 ms 123740 KB Output is correct
6 Correct 49 ms 123804 KB Output is correct
7 Correct 59 ms 123876 KB Output is correct
8 Correct 49 ms 123732 KB Output is correct
9 Correct 57 ms 123660 KB Output is correct
10 Correct 52 ms 123936 KB Output is correct
11 Correct 50 ms 124124 KB Output is correct
12 Correct 55 ms 123912 KB Output is correct
13 Correct 48 ms 123760 KB Output is correct
14 Correct 50 ms 124180 KB Output is correct
15 Correct 51 ms 124236 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 123840 KB Output is correct
2 Correct 50 ms 123740 KB Output is correct
3 Correct 48 ms 123796 KB Output is correct
4 Correct 54 ms 123732 KB Output is correct
5 Correct 48 ms 123728 KB Output is correct
6 Correct 50 ms 123732 KB Output is correct
7 Correct 48 ms 123732 KB Output is correct
8 Correct 49 ms 123872 KB Output is correct
9 Correct 51 ms 123836 KB Output is correct
10 Correct 48 ms 123836 KB Output is correct
11 Correct 68 ms 123984 KB Output is correct
12 Correct 51 ms 123952 KB Output is correct
13 Correct 52 ms 123780 KB Output is correct
14 Correct 56 ms 124052 KB Output is correct
15 Correct 51 ms 124248 KB Output is correct
16 Correct 50 ms 123960 KB Output is correct
17 Correct 54 ms 124500 KB Output is correct
18 Correct 58 ms 123968 KB Output is correct
19 Correct 53 ms 123984 KB Output is correct
20 Correct 49 ms 123888 KB Output is correct
21 Correct 48 ms 123856 KB Output is correct
22 Correct 48 ms 123988 KB Output is correct
23 Correct 68 ms 123988 KB Output is correct
24 Correct 51 ms 124412 KB Output is correct
25 Correct 51 ms 124240 KB Output is correct
26 Correct 47 ms 124152 KB Output is correct
27 Correct 51 ms 123984 KB Output is correct
28 Correct 51 ms 124756 KB Output is correct
29 Correct 63 ms 126036 KB Output is correct
30 Correct 70 ms 124496 KB Output is correct
31 Correct 80 ms 125008 KB Output is correct
32 Correct 51 ms 124752 KB Output is correct
33 Correct 75 ms 128080 KB Output is correct
34 Correct 85 ms 128080 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 123728 KB Output is correct
2 Correct 55 ms 123732 KB Output is correct
3 Correct 51 ms 123800 KB Output is correct
4 Correct 73 ms 123672 KB Output is correct
5 Correct 73 ms 123824 KB Output is correct
6 Correct 73 ms 123856 KB Output is correct
7 Correct 58 ms 123668 KB Output is correct
8 Correct 55 ms 123700 KB Output is correct
9 Correct 55 ms 123888 KB Output is correct
10 Correct 51 ms 123732 KB Output is correct
11 Correct 52 ms 124104 KB Output is correct
12 Correct 55 ms 123716 KB Output is correct
13 Correct 60 ms 123708 KB Output is correct
14 Correct 51 ms 123988 KB Output is correct
15 Correct 51 ms 124252 KB Output is correct
16 Correct 59 ms 123968 KB Output is correct
17 Correct 54 ms 124496 KB Output is correct
18 Correct 68 ms 124148 KB Output is correct
19 Correct 54 ms 124092 KB Output is correct
20 Correct 50 ms 124028 KB Output is correct
21 Correct 48 ms 123972 KB Output is correct
22 Correct 67 ms 124136 KB Output is correct
23 Correct 49 ms 124036 KB Output is correct
24 Correct 52 ms 124252 KB Output is correct
25 Correct 54 ms 124240 KB Output is correct
26 Correct 52 ms 124200 KB Output is correct
27 Correct 55 ms 123952 KB Output is correct
28 Correct 54 ms 124632 KB Output is correct
29 Correct 66 ms 125928 KB Output is correct
30 Correct 51 ms 124348 KB Output is correct
31 Correct 55 ms 125008 KB Output is correct
32 Correct 55 ms 124744 KB Output is correct
33 Correct 69 ms 128084 KB Output is correct
34 Correct 70 ms 128184 KB Output is correct
35 Correct 81 ms 128596 KB Output is correct
36 Correct 52 ms 124444 KB Output is correct
37 Correct 102 ms 131552 KB Output is correct
38 Correct 91 ms 131620 KB Output is correct
39 Correct 94 ms 131576 KB Output is correct
40 Correct 141 ms 131544 KB Output is correct
41 Correct 130 ms 131560 KB Output is correct
42 Correct 54 ms 124556 KB Output is correct
43 Correct 50 ms 124632 KB Output is correct
44 Correct 54 ms 124412 KB Output is correct
45 Correct 228 ms 142672 KB Output is correct
46 Correct 161 ms 142672 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 123728 KB Output is correct
2 Correct 51 ms 123688 KB Output is correct
3 Correct 50 ms 123876 KB Output is correct
4 Correct 54 ms 123732 KB Output is correct
5 Correct 51 ms 123792 KB Output is correct
6 Correct 50 ms 123864 KB Output is correct
7 Correct 48 ms 123688 KB Output is correct
8 Correct 53 ms 123688 KB Output is correct
9 Correct 51 ms 123676 KB Output is correct
10 Correct 52 ms 123728 KB Output is correct
11 Correct 53 ms 123984 KB Output is correct
12 Correct 57 ms 123740 KB Output is correct
13 Correct 63 ms 123840 KB Output is correct
14 Correct 67 ms 124044 KB Output is correct
15 Correct 52 ms 124072 KB Output is correct
16 Correct 52 ms 123924 KB Output is correct
17 Correct 53 ms 124496 KB Output is correct
18 Correct 53 ms 124028 KB Output is correct
19 Correct 61 ms 124092 KB Output is correct
20 Correct 49 ms 123832 KB Output is correct
21 Correct 50 ms 123976 KB Output is correct
22 Correct 50 ms 123988 KB Output is correct
23 Correct 50 ms 124172 KB Output is correct
24 Correct 52 ms 124252 KB Output is correct
25 Correct 51 ms 124244 KB Output is correct
26 Correct 51 ms 124000 KB Output is correct
27 Correct 62 ms 123984 KB Output is correct
28 Correct 55 ms 124696 KB Output is correct
29 Correct 63 ms 126036 KB Output is correct
30 Correct 52 ms 124500 KB Output is correct
31 Correct 66 ms 125016 KB Output is correct
32 Correct 55 ms 124764 KB Output is correct
33 Correct 70 ms 128212 KB Output is correct
34 Correct 71 ms 128080 KB Output is correct
35 Correct 77 ms 128592 KB Output is correct
36 Correct 53 ms 124500 KB Output is correct
37 Correct 96 ms 131408 KB Output is correct
38 Correct 99 ms 131664 KB Output is correct
39 Correct 99 ms 131408 KB Output is correct
40 Correct 93 ms 131412 KB Output is correct
41 Correct 103 ms 131412 KB Output is correct
42 Correct 55 ms 124488 KB Output is correct
43 Correct 54 ms 124396 KB Output is correct
44 Correct 52 ms 124376 KB Output is correct
45 Correct 143 ms 142676 KB Output is correct
46 Correct 152 ms 142844 KB Output is correct
47 Correct 232 ms 152376 KB Output is correct
48 Correct 74 ms 133116 KB Output is correct
49 Correct 65 ms 129944 KB Output is correct
50 Correct 65 ms 129700 KB Output is correct
51 Correct 124 ms 136788 KB Output is correct
52 Correct 143 ms 138040 KB Output is correct
53 Correct 65 ms 128332 KB Output is correct
54 Correct 63 ms 125008 KB Output is correct
55 Correct 59 ms 126032 KB Output is correct
56 Correct 64 ms 126316 KB Output is correct
57 Correct 150 ms 139408 KB Output is correct
58 Correct 64 ms 126932 KB Output is correct
59 Correct 68 ms 127956 KB Output is correct
60 Correct 70 ms 128748 KB Output is correct
61 Correct 65 ms 128460 KB Output is correct
62 Correct 97 ms 142732 KB Output is correct
63 Correct 576 ms 205960 KB Output is correct
64 Correct 660 ms 224336 KB Output is correct
65 Runtime error 290 ms 262144 KB Execution killed with signal 9
66 Halted 0 ms 0 KB -