제출 #910110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
910110		MinaRagy06	Inside information (BOI21_servers)	C++17	5 / 100	1010 ms	2644 KiB

servers

#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;

const int N = 4005;
vector<array<int, 2>> adj[N];

bool dfs(int i, int prvt, int par, int tar) {
    if (i == tar) return 1;
    bool ok = 0;
    for (auto [nxt, t] : adj[i]) {
        if (nxt == par) continue;
        if (prvt > t) {
            ok |= dfs(nxt, t, i, tar);
        }
    }
    return ok;
}
int dfs2(int i, int prvt, int par) {
    int ans = 1;
    for (auto [nxt, t] : adj[i]) {
        if (nxt == par) continue;
        if (prvt < t) {
            ans += dfs2(nxt, t, i);
        }
    }
    return ans;
}
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, q;
    cin >> n >> q;
    q += n - 1;
    for (int cur = 0; cur < q; cur++) {
        char t;
        int a, b;
        cin >> t >> a;
        if (t == 'S') {
            cin >> b;
            adj[a].push_back({b, cur});
            adj[b].push_back({a, cur});
        } else if (t == 'Q') {
            cin >> b;
            cout << (dfs(a, 1e9, -1, b)? "yes\n" : "no\n");
        } else {
            cout << dfs2(a, -1e9, -1) << '\n';
        }
    }
    return 0;
}

• Subtask 1: 2.5 / 2.5
• Subtask 2: 2.5 / 2.5
• Subtask 3: 0 / 2.5
• Subtask 4: 0 / 2.5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 12.5
• Subtask 10: 0 / 12.5
• Subtask 11: 0 / 17.5
• Subtask 12: 0 / 17.5