Submission #956592

#	Time	Username	Problem	Language	Result	Execution time	Memory
956592		Whisper	스파이 (JOI13_spy)	C++17	100 / 100	290 ms	250124 KiB

spy

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

//#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
const int MAX = 2e3 + 1, N = 5e5 + 1;
int numNode, numQuery;
vector<int> G[MAX][2];
int root[2];

bitset<N> joi[MAX], ioi[MAX];

void dfs(int u, int p){
    for(int&v : G[u][0]) if(v ^ p){
        joi[v] |= joi[u];
        dfs(v, u);
    }
}
void dfs2(int u, int p){
    for (int&v : G[u][1]) if(v ^ p){
        ioi[v] |= ioi[u];
        dfs2(v, u);
    }
}

void Whisper(){
    cin >> numNode >> numQuery;;
    for (int i = 1; i <= numNode; ++i){
        int u, v; cin >> u >> v;
        if(u > 0){
            G[u][0].emplace_back(i);
            G[i][0].emplace_back(u);
        }
        else root[0] = i;

        if(v > 0){
            G[v][1].emplace_back(i);
            G[i][1].emplace_back(v);
        }
        else root[1] = i;
    }
    for (int i = 1; i <= numQuery; ++i){
        int u, v; cin >> u >> v;
        joi[u][i] = 1;
        ioi[v][i] = 1;
    }
    dfs(root[0], 0); dfs2(root[1], 0);

    for (int i = 1; i <= numNode; ++i){
        cout << (joi[i] & ioi[i]).count() << '\n';
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 70 / 70