oj.uz

Submission #956592

# Submission time Handle Problem Language Result Execution time Memory
956592 2024-04-02T07:56:03 Z Whisper 스파이 (JOI13_spy) C++17
100 / 100
 290 ms 250124 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 27224 KB Output is correct
2 Correct 12 ms 27228 KB Output is correct
3 Correct 12 ms 27432 KB Output is correct
4 Correct 12 ms 27224 KB Output is correct
5 Correct 11 ms 27228 KB Output is correct
6 Correct 11 ms 27428 KB Output is correct
7 Correct 12 ms 27224 KB Output is correct
8 Correct 11 ms 27228 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 245432 KB Output is correct
2 Correct 137 ms 245352 KB Output is correct
3 Correct 130 ms 245308 KB Output is correct
4 Correct 131 ms 245328 KB Output is correct
5 Correct 133 ms 245364 KB Output is correct
6 Correct 136 ms 245244 KB Output is correct
7 Correct 133 ms 245404 KB Output is correct
8 Correct 135 ms 245332 KB Output is correct

Subtask #3
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 245380 KB Output is correct
2 Correct 185 ms 249644 KB Output is correct
3 Correct 222 ms 249680 KB Output is correct
4 Correct 212 ms 250124 KB Output is correct
5 Correct 248 ms 249628 KB Output is correct
6 Correct 204 ms 249108 KB Output is correct
7 Correct 244 ms 249684 KB Output is correct
8 Correct 290 ms 249688 KB Output is correct