Submission #35211

#	Time	Username	Problem	Language	Result	Execution time	Memory
35211		wan2000	스파이 (JOI13_spy)	C++14	10 / 100	159 ms	18124 KiB

spy

#include <bits/stdc++.h>

using namespace std;

const int N = 2002;

int n, m, tin[2][N], tout[2][N], counter, D[N][N];
vector<int> Adj[2][N];

void DFS(int u, int type){
    tin[type][u] = ++counter;
    for(int i = 0; i < (int)Adj[type][u].size(); i++){
        int v = Adj[type][u][i];
        DFS(v,type);
    }
    tout[type][u] = counter;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for(int i = 1; i <= n; i++){
        int x, y;
        cin>>x>>y;
        Adj[0][x].push_back(i);
        Adj[1][y].push_back(i);
    }
    counter = -1;
    DFS(0,0);
    counter = -1;
    DFS(0,1);
    for(int i = 1; i <= m; i++){
        int a, b;
        cin>>a>>b;
        int x = tin[0][a];
        int u = tout[0][a];
        int y = tin[1][b];
        int v = tout[1][b];
        D[x][y]++;
        D[x][v+1]--;
        D[u+1][y]--;
        D[u+1][v+1]++;
    }
    for(int x = 1; x <= n; x++){
        for(int y = 1; y <= n; y++){
            D[x][y] += D[x-1][y]+D[x][y-1]-D[x-1][y-1];
        }
    }
    for(int i = 1; i <= n; i++){
        cout<<D[tin[0][i]][tin[1][i]]<<'\n';
    }
    return 0;
}

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