oj.uz

Submission #1096955

# Submission time Handle Problem Language Result Execution time Memory
1096955 2024-10-05T14:40:04 Z lmToT27 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 4940 KB 
#include <bits/stdc++.h>
#define all(dataStructure) dataStructure.begin(),dataStructure.end()
#define ll long long

using namespace std;
namespace std {
        template <typename T, int D>
        struct _vector : public vector <_vector <T, D - 1>> {
                static_assert(D >= 1, "Dimension must be positive!");
                template <typename... Args>
                _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
        };
        // _vector <int, 3> a(n, m, k);: int a[n][m][k].
        // _vector <int, 3> a(n, m, k, x);: int a[n][m][k] initialized with x.
        template <typename T>
        struct _vector <T, 1> : public vector <T> {
                _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
        };
}

const int MAX = 3e4 + 3;
const ll MOD[] = {1000000007, 998244353};

int n, m;
int b[MAX], p[MAX];
int dp[MAX];
set <int> f[MAX];

void Solve() {
        memset(dp, 0x0f, sizeof dp);
        cin >> n >> m;
        for (int i = 0; i < m; i++) {
                cin >> b[i] >> p[i];
                f[b[i]].insert(p[i]);
        }

        priority_queue <pair <int, int>> q;
        dp[b[0]] = 0;
        q.push({0, b[0]});
        while (q.size()) {
                auto [D, u] = q.top();
                q.pop();
                D = -D;
                if (D != dp[u]) continue;
                if (u == b[1]) return void(cout << D);
                for (auto p : f[u]) {
                        for (int v = u + p; v < n; v += p) {
                                if (dp[v] > D + (v - u) / p) {
                                        dp[v] = D + (v - u) / p;
                                        q.emplace(-dp[v], v);
                                }
                                if (f[v].count(p)) continue;
                        }
                        for (int v = u - p; v >= 0; v -= p) {
                                if (dp[v] > D + (u - v) / p) {
                                        dp[v] = D + (u - v) / p;
                                        q.emplace(-dp[v], v);
                                }
                                if (f[v].count(p)) continue;
                        }
                }
        }
        cout << -1;
}

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);

        #define TASK "TASK"
        if (fopen(TASK".INP", "r")) {
                freopen(TASK".INP", "r", stdin);
                freopen(TASK".OUT", "w", stdout);
        }
        
        /* int TEST = 1; cin >> TEST; while (TEST--) */ Solve();

        cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
        return 0;
}

Compilation message

skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:72:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |                 freopen(TASK".INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:73:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |                 freopen(TASK".OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1992 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 2004 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 1 ms 2056 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 1 ms 1932 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 2140 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 1 ms 2004 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 9 ms 2156 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 2 ms 2140 KB Output is correct
25 Correct 1 ms 2140 KB Output is correct
26 Correct 1 ms 1884 KB Output is correct
27 Correct 1 ms 1884 KB Output is correct
28 Correct 1 ms 1884 KB Output is correct
29 Correct 2 ms 2140 KB Output is correct
30 Correct 1 ms 2040 KB Output is correct
31 Correct 1 ms 2140 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 3 ms 2260 KB Output is correct
34 Correct 2 ms 2140 KB Output is correct
35 Correct 7 ms 3676 KB Output is correct
36 Correct 2 ms 2140 KB Output is correct
37 Correct 6 ms 3164 KB Output is correct
38 Correct 8 ms 3932 KB Output is correct
39 Correct 8 ms 3760 KB Output is correct
40 Correct 8 ms 3932 KB Output is correct
41 Correct 9 ms 3812 KB Output is correct
42 Correct 3 ms 2396 KB Output is correct
43 Correct 4 ms 2396 KB Output is correct
44 Correct 11 ms 2376 KB Output is correct
45 Correct 10 ms 3932 KB Output is correct
46 Correct 10 ms 3868 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1992 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1940 KB Output is correct
13 Correct 1 ms 1972 KB Output is correct
14 Correct 1 ms 2004 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 1 ms 2140 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 9 ms 2140 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 1 ms 1884 KB Output is correct
24 Correct 2 ms 2140 KB Output is correct
25 Correct 2 ms 2140 KB Output is correct
26 Correct 1 ms 1884 KB Output is correct
27 Correct 1 ms 1884 KB Output is correct
28 Correct 1 ms 2120 KB Output is correct
29 Correct 2 ms 2136 KB Output is correct
30 Correct 1 ms 1884 KB Output is correct
31 Correct 2 ms 2140 KB Output is correct
32 Correct 2 ms 1884 KB Output is correct
33 Correct 3 ms 2140 KB Output is correct
34 Correct 2 ms 2140 KB Output is correct
35 Correct 7 ms 3676 KB Output is correct
36 Correct 2 ms 2260 KB Output is correct
37 Correct 6 ms 3284 KB Output is correct
38 Correct 10 ms 3792 KB Output is correct
39 Correct 9 ms 3908 KB Output is correct
40 Correct 11 ms 3912 KB Output is correct
41 Correct 10 ms 4184 KB Output is correct
42 Correct 4 ms 2392 KB Output is correct
43 Correct 4 ms 2396 KB Output is correct
44 Correct 11 ms 2396 KB Output is correct
45 Correct 11 ms 3932 KB Output is correct
46 Correct 10 ms 3840 KB Output is correct
47 Correct 8 ms 4056 KB Output is correct
48 Correct 6 ms 3284 KB Output is correct
49 Correct 7 ms 3248 KB Output is correct
50 Correct 4 ms 2908 KB Output is correct
51 Correct 11 ms 4940 KB Output is correct
52 Correct 12 ms 4568 KB Output is correct
53 Correct 7 ms 4116 KB Output is correct
54 Correct 3 ms 2136 KB Output is correct
55 Correct 2 ms 2140 KB Output is correct
56 Execution timed out 1090 ms 4188 KB Time limit exceeded
57 Halted 0 ms 0 KB -