Submission #1033970

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033970		dilanyan	Inside information (BOI21_servers)	C++17	5 / 100	3576 ms	20008 KiB

servers

//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------Kargpefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set

void KarginSet(string name = "") {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    if (name.size()) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 998244353;
const ll inf = 1e18;
 
//-------------------KarginCode-----------------------\\ 
 
const int N = 500005, M = 1000005;

vector<pair<int, int>> g[N];

bool dfs_q(int u, int p, int cur, int t) {
    if (u == t) return true;
    for (auto it : g[u]) {
        int v = it.first, ind = it.second;
        if (v == p) continue;
        if (cur > ind) continue;
        if (dfs_q(v, u, ind, t)) return true;
    }
    return false;
}

int dfs_c(int u, int p,int cur) {
    int res = 1;
    for (auto it : g[u]) {
        int v = it.first, ind = it.second;
        if (v == p) continue;
        if (cur > ind) continue;
        res += dfs_c(v, u, ind);
    }
    return res;
}

void KarginSolve() {
    int n, q;
    cin >> n >> q;
    for (int i = 1;i <= n - 1 + q;i++) {
        char type; cin >> type;
        if (type == 'S') {
            int u, v;
            cin >> u >> v;
            g[u].pb({ v,i }), g[v].pb({ u,i });
        }
        else if (type == 'Q') {
            int u, v;
            cin >> u >> v;
            if (dfs_q(v, 0, 0, u)) cout << "yes\n";
            else cout << "no\n";
        }
        else {
            int u; cin >> u;
            cout << dfs_c(u, 0, 0) << '\n';
        }
    }
}

int main() {
    KarginSet();
    int test = 1;
    //cin >> test; 
    while (test--) {
        KarginSolve();
    }
    return 0;
}

Compilation message (stderr)

servers.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
servers.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
servers.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
servers.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
servers.cpp: In function 'void KarginSet(std::string)':
servers.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
servers.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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