oj.uz

Submission #1095458

# Submission time Handle Problem Language Result Execution time Memory
1095458 2024-10-02T09:40:19 Z MtSaka Tropical Garden (IOI11_garden) C++17
100 / 100
 1100 ms 24408 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> cnt(n);
    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;
            }
        }
    }
    rep(i, q) {
        const int k = query[i];
        int ans = 0;
        rep(j, n) {
            if (k >= dist1[j] && (k - dist1[j]) % cycle1 == 0)
                ans++;
            else if (k >= dist2[j] && (k - dist2[j]) % cycle2 == 0)
                ans++;
        }
        answer(ans);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 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 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 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 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 3528 KB Output is correct
12 Correct 12 ms 5724 KB Output is correct
13 Correct 23 ms 13916 KB Output is correct
14 Correct 38 ms 18004 KB Output is correct
15 Correct 44 ms 18484 KB Output is correct
16 Correct 33 ms 13404 KB Output is correct
17 Correct 31 ms 11856 KB Output is correct
18 Correct 12 ms 5724 KB Output is correct
19 Correct 37 ms 18012 KB Output is correct
20 Correct 43 ms 18564 KB Output is correct
21 Correct 34 ms 13404 KB Output is correct
22 Correct 32 ms 11868 KB Output is correct
23 Correct 41 ms 19844 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 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 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 3528 KB Output is correct
12 Correct 12 ms 5724 KB Output is correct
13 Correct 23 ms 13916 KB Output is correct
14 Correct 38 ms 18004 KB Output is correct
15 Correct 44 ms 18484 KB Output is correct
16 Correct 33 ms 13404 KB Output is correct
17 Correct 31 ms 11856 KB Output is correct
18 Correct 12 ms 5724 KB Output is correct
19 Correct 37 ms 18012 KB Output is correct
20 Correct 43 ms 18564 KB Output is correct
21 Correct 34 ms 13404 KB Output is correct
22 Correct 32 ms 11868 KB Output is correct
23 Correct 41 ms 19844 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 46 ms 3420 KB Output is correct
26 Correct 76 ms 5724 KB Output is correct
27 Correct 692 ms 14140 KB Output is correct
28 Correct 661 ms 18264 KB Output is correct
29 Correct 727 ms 18628 KB Output is correct
30 Correct 395 ms 13392 KB Output is correct
31 Correct 348 ms 12008 KB Output is correct
32 Correct 82 ms 5724 KB Output is correct
33 Correct 677 ms 18004 KB Output is correct
34 Correct 709 ms 18516 KB Output is correct
35 Correct 403 ms 13592 KB Output is correct
36 Correct 604 ms 12016 KB Output is correct
37 Correct 433 ms 19796 KB Output is correct
38 Correct 1100 ms 24408 KB Output is correct