oj.uz

답안 #34979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
34979 2017-11-17T09:07:03 Z long10024070 스파이 (JOI13_spy) C++11
30 / 100
 2000 ms 3400 KB 
#define Link ""

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

#define TASK "SPY"

using namespace std;

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

const int maxn = 2e4 + 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;
}

inline void writeln(int x)
{

    char buffor[21];
    register int i=0;
    int neg=0;
    if (x<0) {
        neg=1;
        x= -x;
    }
    do {
        buffor[i++]=(x%10)+'0';
        x/=10;
    }
    while(x);
    i--;
    if (neg) putchar('-');
    while(i>=0) putchar(buffor[i--]);
    putchar('\n');
}

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;
        R = FastIn();
        S = FastIn();
        DFS(0,R);
        DFS(1,S);
    }
    for (int i=1;i<=n;++i)
        //cout << res[i] << '\n';
        writeln(res[i]);
}

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

    //OpenFile();

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

Compilation message

spy.cpp: In function 'void OpenFile()':
spy.cpp:13:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(".INP","r",stdin);
                              ^
spy.cpp:14:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(".OUT","w",stdout);
                               ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3268 KB Output is correct
2 Correct 0 ms 3268 KB Output is correct
3 Correct 0 ms 3268 KB Output is correct
4 Correct 0 ms 3268 KB Output is correct
5 Correct 0 ms 3268 KB Output is correct
6 Correct 0 ms 3268 KB Output is correct
7 Correct 0 ms 3268 KB Output is correct
8 Correct 0 ms 3268 KB Output is correct
9 Correct 0 ms 3268 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 3400 KB Output is correct
2 Correct 209 ms 3400 KB Output is correct
3 Correct 19 ms 3268 KB Output is correct
4 Correct 23 ms 3268 KB Output is correct
5 Correct 3 ms 3268 KB Output is correct
6 Correct 126 ms 3268 KB Output is correct
7 Correct 16 ms 3400 KB Output is correct
8 Correct 0 ms 3400 KB Output is correct

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2000 ms 3400 KB Execution timed out
2 Halted 0 ms 0 KB -