oj.uz

Submission #34934

# Submission time Handle Problem Language Result Execution time Memory
34934 2017-11-17T08:20:44 Z long10024070 스파이 (JOI13_spy) C++11
0 / 100
 2000 ms 2416 KB 
#define Link ""

#include <iostream>
#include <cstdio>
#include <vector>

#define TASK "SPY"

using namespace std;

void OpenFile()
{
//    freopen(TASK".INP","r",stdin);
//    freopen(TASK".OUT","w",stdout);
}

const int maxn = 2e3 + 1;
int n,m,lab[maxn],res[maxn];
vector <int> e[2][maxn];

int FastIn()
{
    int res = 0;
    register char c = getchar();
    while (c < '0' || '9' < c) c = getchar();
    while ('0' <= c && c <= '9') res = res * 10 + c - '0', c = getchar();
    return res;
}

void Enter()
{
    n = FastIn();
    m = FastIn();
    for (int i=1;i<=n;++i) {
        e[0][FastIn()].push_back(i);
        e[1][FastIn()].push_back(i);
    }
}

void Init()
{

}

void DFS(int t, int u)
{
    if (t == 0)
        lab[u] = m;
    else
        if (lab[u] == m)
            ++res[u];
    for (int v : e[t][u])
        DFS(t,v);
}

void Solve()
{
    for (;m>0;--m) {
        int R,S;
        cin >> R >> S;
        DFS(0,R);
        DFS(1,S);
    }
    for (int i=1;i<=n;++i)
        cout << res[i] << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    //OpenFile();

    Enter();
    Init();
    Solve();
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2284 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 99 ms 2416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2000 ms 2416 KB Execution timed out
2 Halted 0 ms 0 KB -