# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34979 | long10024070 | 스파이 (JOI13_spy) | C++11 | 2000 ms | 3400 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |