oj.uz

Submission #34949

# Submission time Handle Problem Language Result Execution time Memory
34949 2017-11-17T08:48:04 Z wan2000 스파이 (JOI13_spy) C++14
100 / 100
 389 ms 246900 KB 
#include <bits/stdc++.h>

using namespace std;

template<typename T> inline void read(T &x){
    x = 0; char ch;
    while(!isdigit(ch=getchar()));
    do{x=10*x+ch-'0';}while(isdigit(ch=getchar()));
}

template<typename T> inline void write(T x){
    if(x<=9){
        putchar(x+'0');
        return;
    }
    write(x/10);
    putchar(x%10+'0');
}

template<typename T> inline void writeln(T x){
    write(x); putchar('\n');
}

const int N = 2001;
const int M = 5e5+111;

int n, m, mx;
bitset<M> D[2][N], cur;
vector<int> Adj[2][N];

void DFS(int u, int tp){
    for(int i = 0; i < (int)Adj[tp][u].size(); i++){
        int v = Adj[tp][u][i];
        D[tp][v] |= D[tp][u];
        DFS(v,tp);
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    read(n); read(m);
    for(int i = 1; i <= n; i++){
        int x, y;
        read(x); read(y);
        Adj[0][x].push_back(i);
        Adj[1][y].push_back(i);
    }
    for(int i = 0; i < m; i++){
        int x, y;
        read(x); read(y);
        D[0][x].set(i);
        D[1][y].set(i);
    }
    DFS(0,0);
    DFS(0,1);
    for(int i = 1; i <= n; i++){
        cur = D[0][i]&D[1][i];
        writeln(cur.count());
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 246672 KB Output is correct
2 Correct 23 ms 246672 KB Output is correct
3 Correct 9 ms 246672 KB Output is correct
4 Correct 13 ms 246672 KB Output is correct
5 Correct 23 ms 246672 KB Output is correct
6 Correct 13 ms 246672 KB Output is correct
7 Correct 16 ms 246672 KB Output is correct
8 Correct 16 ms 246672 KB Output is correct
9 Correct 0 ms 246672 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 246900 KB Output is correct
2 Correct 183 ms 246896 KB Output is correct
3 Correct 173 ms 246672 KB Output is correct
4 Correct 189 ms 246672 KB Output is correct
5 Correct 163 ms 246672 KB Output is correct
6 Correct 176 ms 246672 KB Output is correct
7 Correct 183 ms 246804 KB Output is correct
8 Correct 193 ms 246804 KB Output is correct

Subtask #3
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 246892 KB Output is correct
2 Correct 249 ms 246896 KB Output is correct
3 Correct 356 ms 246672 KB Output is correct
4 Correct 293 ms 246672 KB Output is correct
5 Correct 389 ms 246672 KB Output is correct
6 Correct 226 ms 246672 KB Output is correct
7 Correct 379 ms 246804 KB Output is correct
8 Correct 333 ms 246804 KB Output is correct