oj.uz

답안 #1073879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073879 2024-08-25T01:35:16 Z RiverFlow Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 897 ms 3792 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)3e4 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

int dis[N];

vector<int> g[N];

void main_code() {
    int n, m;
    cin >> m >> n;
    int p0 = 0, pos = 0, ed = 0;
    for(int i = 0; i < n; ++i) {
        int b, p; cin >> b >> p;
        if (i == 0) {
            p0 = p;
            pos = b;
            g[pos].push_back(p);
        } else if (i == 1) {
            ed = b;
        } else {
            g[b].push_back(p);
        }
    }
    FOR(i, 0, m - 1) dis[i] = -1;
    // (0, m - 1)
    priority_queue<ii, vec<ii>, greater<ii>> pq;
    pq.push(_mp(0, pos)); dis[pos] = 0;

    while (!pq.empty()) {
        auto x = pq.top(); pq.pop();
        int u = x.second;
        if (dis[u] != x.fi) continue ;
        if (u == ed) break ;
        for(int v : g[u]) {
            for(int k = u - v, c = 1; k >= 0; k -= v, ++c) {
                if (dis[k] == -1 or dis[k] > dis[u] + c) {
                    dis[k] = dis[u] + c;
                    pq.push(_mp(dis[k], k));
                }
            }
            for(int k = u + v, c = 1; k < m; k += v, ++c) {
                if (dis[k] == -1 or dis[k] > dis[u] + c) {
                    dis[k] = dis[u] + c;
                    pq.push(_mp(dis[k], k));
                }
            }
        }
    }
    cout << dis[ed];
}


/*     Let the river flows naturally     */

Compilation message

skyscraper.cpp: In function 'void main_code()':
skyscraper.cpp:53:9: warning: variable 'p0' set but not used [-Wunused-but-set-variable]
   53 |     int p0 = 0, pos = 0, ed = 0;
      |         ^~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 0 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1196 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 0 ms 1116 KB Output is correct
20 Correct 4 ms 1112 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1112 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1120 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1180 KB Output is correct
29 Correct 2 ms 1372 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 2 ms 1372 KB Output is correct
34 Correct 1 ms 1372 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 5 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1176 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 2 ms 1372 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 2 ms 1372 KB Output is correct
34 Correct 2 ms 1372 KB Output is correct
35 Correct 4 ms 1568 KB Output is correct
36 Correct 1 ms 1116 KB Output is correct
37 Correct 4 ms 1576 KB Output is correct
38 Correct 5 ms 1624 KB Output is correct
39 Correct 4 ms 1628 KB Output is correct
40 Correct 5 ms 1628 KB Output is correct
41 Correct 5 ms 1624 KB Output is correct
42 Correct 4 ms 1624 KB Output is correct
43 Correct 3 ms 1628 KB Output is correct
44 Correct 44 ms 1612 KB Output is correct
45 Correct 5 ms 1624 KB Output is correct
46 Correct 5 ms 1628 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1168 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1168 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1164 KB Output is correct
10 Correct 0 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1180 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 4 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 2 ms 1376 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 2 ms 1372 KB Output is correct
34 Correct 2 ms 1368 KB Output is correct
35 Correct 5 ms 1628 KB Output is correct
36 Correct 1 ms 1264 KB Output is correct
37 Correct 4 ms 1628 KB Output is correct
38 Correct 5 ms 1660 KB Output is correct
39 Correct 4 ms 1628 KB Output is correct
40 Correct 4 ms 1628 KB Output is correct
41 Correct 5 ms 1632 KB Output is correct
42 Correct 3 ms 1632 KB Output is correct
43 Correct 4 ms 1524 KB Output is correct
44 Correct 43 ms 1632 KB Output is correct
45 Correct 5 ms 1624 KB Output is correct
46 Correct 5 ms 1628 KB Output is correct
47 Correct 6 ms 2264 KB Output is correct
48 Correct 4 ms 1892 KB Output is correct
49 Correct 5 ms 1884 KB Output is correct
50 Correct 3 ms 1800 KB Output is correct
51 Correct 12 ms 3284 KB Output is correct
52 Correct 12 ms 2776 KB Output is correct
53 Correct 6 ms 2396 KB Output is correct
54 Correct 1 ms 1372 KB Output is correct
55 Correct 3 ms 1372 KB Output is correct
56 Correct 793 ms 2720 KB Output is correct
57 Correct 3 ms 2008 KB Output is correct
58 Correct 897 ms 1628 KB Output is correct
59 Correct 5 ms 1884 KB Output is correct
60 Correct 5 ms 1628 KB Output is correct
61 Correct 5 ms 1884 KB Output is correct
62 Correct 6 ms 2396 KB Output is correct
63 Correct 28 ms 2776 KB Output is correct
64 Correct 23 ms 3792 KB Output is correct
65 Correct 28 ms 3792 KB Output is correct
66 Correct 40 ms 3792 KB Output is correct
67 Correct 29 ms 3788 KB Output is correct