oj.uz

답안 #1095465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095465 2024-10-02T09:53:54 Z MtSaka 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
100 / 100
 72 ms 31192 KB 
#include "bits/stdc++.h"
#include "garden.h"
#include "gardenlib.h"
#define overload(a, b, c, d, ...) d
#define rep1(a) for (ll _ = 0; _ < (ll)a; ++_)
#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)
#define rep3(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) overload(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(i, a) for (ll i = (ll)(a) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (ll i = (ll)(b) - 1; i >= (ll)(a); --i)
#define rrep(...) overload(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
template <typename T, typename U>
inline bool chmin(T& a, const U& b) { return (a > b ? a = b, true : false); }
template <typename T, typename U>
inline bool chmax(T& a, const U& b) { return (a < b ? a = b, true : false); }

void count_routes(int n, int m, int p, int r[][2], int q, int query[]) {
    vector<int> to(2 * n, -1);
    vector<int> deg(n);
    rep(i, m) {
        deg[r[i][0]]++, deg[r[i][1]]++;
    }
    rep(i, m) {
        int u = r[i][0], v = r[i][1];
        if (to[u] == -1)
            to[u] = ((deg[v] > 1 && to[v] == -1) ? v + n : v);
        else if (to[u + n] == -1)
            to[u + n] = ((deg[v] > 1 && to[v] == -1) ? v + n : v);
        if (to[v] == -1)
            to[v] = ((deg[u] > 1 && to[u] == v + n) ? u + n : u);
        else if (to[v + n] == -1)
            to[v + n] = ((deg[u] > 1 && to[u] == v) ? u + n : u);
    }
    // rep(i,n)if(to[i+n]==-1)to[i+n]=to[i];
    vector<int> dist1(2 * n, 2e9), dist2(2 * n, 2e9);
    vector<vector<int>> rg(2 * n);
    rep(i, 2 * n) if (to[i] != -1) rg[to[i]].eb(i);
    {
        queue<int> que;
        que.emplace(p);
        dist1[p] = 0;
        while (!que.empty()) {
            int v = que.front();
            que.pop();
            for (auto u : rg[v])
                if (dist1[u] > dist1[v] + 1) {
                    dist1[u] = dist1[v] + 1;
                    que.emplace(u);
                }
        }
    }
    {
        queue<int> que;
        que.emplace(p + n);
        dist2[p + n] = 0;
        while (!que.empty()) {
            int v = que.front();
            que.pop();
            for (auto u : rg[v])
                if (dist2[u] > dist2[v] + 1) {
                    dist2[u] = dist2[v] + 1;
                    que.emplace(u);
                }
        }
    }
    int cycle1 = 2e9, cycle2 = 2e9;
    {
        int now = p;
        rep(i, 1, 2 * n + 1) {
            now = to[now];
            if (now == p) {
                cycle1 = i;
                break;
            }
        }
    }
    {
        int now = p + n;
        rep(i, 1, 2 * n + 1) {
            now = to[now];
            if (now == p + n) {
                cycle2 = i;
                break;
            }
        }
    }
    vector<int> ans(q, 0);
    if (cycle1 != 2e9) {
        vector<int> id(n);
        iota(all(id), 0);
        sort(all(id), [&dist1](int i, int j) { return dist1[i] < dist1[j]; });
        vector<vector<int>> f(cycle1);
        for (auto i : id) {
            f[dist1[i] % cycle1].eb(dist1[i]);
        }
        rep(i, q) {
            const int k = query[i];
            ans[i] += upper_bound(all(f[k % cycle1]), k) - f[k % cycle1].begin();
        }
    } else {
        map<int, int> cnt;
        rep(i, n) cnt[dist1[i]]++;
        rep(i, q) {
            ans[i] += cnt[query[i]];
        }
    }
    if (cycle2 != 2e9) {
        vector<int> id(n);
        iota(all(id), 0);
        sort(all(id), [&dist2](int i, int j) { return dist2[i] < dist2[j]; });
        vector<vector<int>> f(cycle2);
        for (auto i : id) {
            f[dist2[i] % cycle2].eb(dist2[i]);
        }
        rep(i, q) {
            const int k = query[i];
            ans[i] += upper_bound(all(f[k % cycle2]), k) - f[k % cycle2].begin();
        }
    } else {
        map<int, int> cnt;
        rep(i, n) cnt[dist2[i]]++;
        rep(i, q) {
            ans[i] += cnt[query[i]];
        }
    }
    rep(i, q) answer(ans[i]);
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 ms 3852 KB Output is correct
12 Correct 14 ms 6064 KB Output is correct
13 Correct 47 ms 20580 KB Output is correct
14 Correct 49 ms 19728 KB Output is correct
15 Correct 59 ms 19964 KB Output is correct
16 Correct 46 ms 14556 KB Output is correct
17 Correct 39 ms 12112 KB Output is correct
18 Correct 14 ms 5468 KB Output is correct
19 Correct 47 ms 19652 KB Output is correct
20 Correct 62 ms 19460 KB Output is correct
21 Correct 43 ms 13908 KB Output is correct
22 Correct 40 ms 12372 KB Output is correct
23 Correct 57 ms 21612 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 ms 3852 KB Output is correct
12 Correct 14 ms 6064 KB Output is correct
13 Correct 47 ms 20580 KB Output is correct
14 Correct 49 ms 19728 KB Output is correct
15 Correct 59 ms 19964 KB Output is correct
16 Correct 46 ms 14556 KB Output is correct
17 Correct 39 ms 12112 KB Output is correct
18 Correct 14 ms 5468 KB Output is correct
19 Correct 47 ms 19652 KB Output is correct
20 Correct 62 ms 19460 KB Output is correct
21 Correct 43 ms 13908 KB Output is correct
22 Correct 40 ms 12372 KB Output is correct
23 Correct 57 ms 21612 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 12 ms 3824 KB Output is correct
26 Correct 17 ms 6068 KB Output is correct
27 Correct 43 ms 20688 KB Output is correct
28 Correct 49 ms 19724 KB Output is correct
29 Correct 60 ms 19452 KB Output is correct
30 Correct 57 ms 14792 KB Output is correct
31 Correct 39 ms 12116 KB Output is correct
32 Correct 14 ms 5724 KB Output is correct
33 Correct 49 ms 19712 KB Output is correct
34 Correct 57 ms 20104 KB Output is correct
35 Correct 64 ms 13908 KB Output is correct
36 Correct 43 ms 12372 KB Output is correct
37 Correct 52 ms 21560 KB Output is correct
38 Correct 72 ms 31192 KB Output is correct