oj.uz

답안 #1095466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095466 2024-10-02T10:00:53 Z MtSaka 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
100 / 100
 64 ms 30184 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); }
int to[300001];
int deg[150001];
int dist1[300001], dist2[300001];
vector<int> rg[300001];
int ans[2001];

void count_routes(int n, int m, int p, int r[][2], int q, int query[]) {
    fill(to, to + 2 * n, -1);
    fill(deg, deg + n, 0);
    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];
    fill(dist1, dist1 + 2 * n, 2e9);
    fill(dist2, dist2 + 2 * n, 2e9);
    rep(i, 2 * n) rg[i].clear();
    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);
                }
        }
    }
    {
        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;
            }
        }
    }
    fill(ans, ans + q, 0);
    if (cycle1 != 2e9) {
        vector<vector<int>> f(cycle1);
        rep(i, n) {
            f[dist1[i] % cycle1].eb(dist1[i]);
        }
        rep(i, cycle1) sort(all(f[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<vector<int>> f(cycle2);
        rep(i, n) {
            f[dist2[i] % cycle2].eb(dist2[i]);
        }
        rep(i, cycle2) sort(all(f[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 3 ms 7512 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7504 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7516 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 4 ms 7516 KB Output is correct
9 Correct 4 ms 7584 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7504 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7516 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 4 ms 7516 KB Output is correct
9 Correct 4 ms 7584 KB Output is correct
10 Correct 4 ms 7516 KB Output is correct
11 Correct 9 ms 9724 KB Output is correct
12 Correct 16 ms 11280 KB Output is correct
13 Correct 33 ms 23476 KB Output is correct
14 Correct 41 ms 19732 KB Output is correct
15 Correct 57 ms 19768 KB Output is correct
16 Correct 39 ms 17104 KB Output is correct
17 Correct 37 ms 15444 KB Output is correct
18 Correct 15 ms 10844 KB Output is correct
19 Correct 44 ms 19716 KB Output is correct
20 Correct 45 ms 19244 KB Output is correct
21 Correct 38 ms 16464 KB Output is correct
22 Correct 35 ms 15440 KB Output is correct
23 Correct 49 ms 20924 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 4 ms 7516 KB Output is correct
3 Correct 3 ms 7504 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7516 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 4 ms 7516 KB Output is correct
9 Correct 4 ms 7584 KB Output is correct
10 Correct 4 ms 7516 KB Output is correct
11 Correct 9 ms 9724 KB Output is correct
12 Correct 16 ms 11280 KB Output is correct
13 Correct 33 ms 23476 KB Output is correct
14 Correct 41 ms 19732 KB Output is correct
15 Correct 57 ms 19768 KB Output is correct
16 Correct 39 ms 17104 KB Output is correct
17 Correct 37 ms 15444 KB Output is correct
18 Correct 15 ms 10844 KB Output is correct
19 Correct 44 ms 19716 KB Output is correct
20 Correct 45 ms 19244 KB Output is correct
21 Correct 38 ms 16464 KB Output is correct
22 Correct 35 ms 15440 KB Output is correct
23 Correct 49 ms 20924 KB Output is correct
24 Correct 4 ms 7516 KB Output is correct
25 Correct 9 ms 9696 KB Output is correct
26 Correct 15 ms 11180 KB Output is correct
27 Correct 35 ms 23480 KB Output is correct
28 Correct 47 ms 19976 KB Output is correct
29 Correct 49 ms 19284 KB Output is correct
30 Correct 37 ms 17236 KB Output is correct
31 Correct 34 ms 15416 KB Output is correct
32 Correct 15 ms 10844 KB Output is correct
33 Correct 64 ms 19848 KB Output is correct
34 Correct 48 ms 19780 KB Output is correct
35 Correct 38 ms 16468 KB Output is correct
36 Correct 42 ms 15444 KB Output is correct
37 Correct 42 ms 20928 KB Output is correct
38 Correct 56 ms 30184 KB Output is correct