# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
34990 |
2017-11-17T09:13:28 Z |
itsjustwinds |
스파이 (JOI13_spy) |
C++14 |
|
146 ms |
262104 KB |
#include<bits/stdc++.h>
#define maxn 2005
using namespace std;
int n,r1,r2;
bitset<500005> a[maxn],b[maxn];
vector<int > e1[maxn],e2[maxn];
bitset<500005> c;
template<typename T> inline void read(T &x) {
char c;
bool neg = false;
while (!isdigit(c = getchar()) && c != '-');
x = 0;
if (c == '-') {
neg = true;
c = getchar();
}
do {
x = x * 10 + c - '0';
} while (isdigit(c = getchar()));
if (neg) x = -x;
}
template<typename T> inline void write(T x) {
if (x < 0) {
putchar('-');
write(-x);return;
}
if (x < 10) {
putchar(char(x + 48));
}
else {
write(x/10);
putchar(char(48 + x%10));
}
}
template<typename T> inline void writeln(T x) {
write(x);
putchar('\n');
}
void dfs1(int u)
{
for (int i=0;i<e1[u].size();++i)
{
int v=e1[u][i];
a[v]=a[v]|a[u];
dfs1(v);
}
}
void dfs2(int u)
{
for (int i=0;i<e2[u].size();++i)
{
int v=e2[u][i];
b[v]=b[v]|b[u];
dfs2(v);
}
}
int p,q,u,v;
int main()
{
//freopen("SPY.inp","r",stdin);
int test;
read(n);
read(test);
//cin>>n>>test;
for (int i=1;i<=n;++i)
{
read(p);
read(q);
if (p) e1[p].push_back(i);
else r1=i;
if (q) e2[q].push_back(i);
else r2=i;
}
for (int i=1;i<=test;++i)
{
read(u);
read(v);
a[u].set(i);
b[v].set(i);
}
dfs1(r1);
dfs2(r2);
for (int i=1;i<=n;++i)
{
c=a[i]&b[i];
writeln(c.count());
}
return 0;
}
Compilation message
spy.cpp: In function 'void dfs1(int)':
spy.cpp:41:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<e1[u].size();++i)
^
spy.cpp: In function 'void dfs2(int)':
spy.cpp:50:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<e2[u].size();++i)
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
259040 KB |
Output is correct |
2 |
Correct |
19 ms |
259040 KB |
Output is correct |
3 |
Correct |
23 ms |
246940 KB |
Output is correct |
4 |
Correct |
43 ms |
246940 KB |
Output is correct |
5 |
Correct |
19 ms |
247788 KB |
Output is correct |
6 |
Correct |
23 ms |
247916 KB |
Output is correct |
7 |
Correct |
23 ms |
252132 KB |
Output is correct |
8 |
Correct |
16 ms |
248892 KB |
Output is correct |
9 |
Correct |
0 ms |
246940 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
9 ms |
262104 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
146 ms |
262104 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |