Submission #1440612
Source Code Expand
//
// main.cpp
// 049D2
//
// Created by zhangdenny on 2017/7/20.
// Copyright © 2017年 Kirito. All rights reserved.
//
//
// main.cpp
// 049D
//
// Created by zhangdenny on 2017/7/20.
// Copyright © 2017年 Kirito. All rights reserved.
//
#include <functional>
#include <algorithm>
#include <exception>
#include <stdexcept>
#include <streambuf>
#include <iterator>
#include <string.h>
#include <stdlib.h>
#include <typeinfo>
#include <valarray>
#include <iostream>
#include <sstream>
#include <istream>
#include <stdio.h>
#include <climits>
#include <clocale>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <ctype.h>
#include <cassert>
#include <cstdlib>
#include <utility>
#include <cstring>
#include <numeric>
#include <ostream>
#include <cwctype>
#include <fstream>
#include <iomanip>
#include <math.h>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <limits>
#include <locale>
#include <memory>
#include <cerrno>
#include <iosfwd>
#include <cfloat>
#include <cstdio>
#include <cwchar>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <list>
#include <ios>
#include <map>
#include <set>
#include <new>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define pii pair<int,int>
using namespace std;
const int maxn=200005;
int n,k,l,ans[maxn],sumo,suma;
vector<int> ro[maxn],ra[maxn];
vector<int> co[maxn],ca[maxn];
bool viso[maxn],visa[maxn];
int wo[maxn],wa[maxn];
void dfso(int x)
{
if(viso[x])
return;
viso[x]=1;
co[sumo].pb(x);
wo[x]=sumo;
for(int i=0;i<ro[x].size();i++)
{
if(!viso[ro[x][i]])
dfso(ro[x][i]);
}
}
void dfsa(int x)
{
if(visa[x])
return;
visa[x]=1;
ca[suma].pb(x);
wa[x]=suma;
for(int i=0;i<ra[x].size();i++)
{
if(!visa[ra[x][i]])
dfsa(ra[x][i]);
}
}
int main()
{
cin>>n>>k>>l;
for(int i=0;i<k;i++)
{
int x,y;
scanf("%d%d",&x,&y);
ro[x].pb(y);
ro[y].pb(x);
}
for(int i=0;i<l;i++)
{
int x,y;
scanf("%d%d",&x,&y);
ra[x].pb(y);
ra[y].pb(x);
}
for(int i=0;i<n;i++)
{
if(!viso[i])
{
dfso(i);
sumo++;
}
}
for(int i=0;i<n;i++)
{
if(!visa[i])
{
dfsa(i);
suma++;
}
}
for(int i=0;i<sumo;i++)
{
for(int j=0;j<co[i].size();j++)
{
int te=wa[co[i][j]];
for(int k=0;k<ca[te].size();k++)
{
if(wo[ca[te][k]]==i)
ans[i]++;
}
}
}
for(int i=0;i<n;i++)
cout<<ans[i];
return 0;
}
Submission Info
Submission Time
2017-07-21 00:10:01+0900
Task
D - Connectivity
User
NightRaven
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
3027 Byte
Status
WA
Exec Time
2104 ms
Memory
35840 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:115:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
./Main.cpp:122:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 400
Status
Set Name
Test Cases
Sample
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name
Status
Exec Time
Memory
subtask0_0.txt
WA
7 ms
19072 KB
subtask0_1.txt
WA
7 ms
19072 KB
subtask0_2.txt
WA
7 ms
19072 KB
subtask1_0.txt
WA
53 ms
21632 KB
subtask1_1.txt
WA
251 ms
35840 KB
subtask1_10.txt
WA
59 ms
21888 KB
subtask1_11.txt
WA
215 ms
34176 KB
subtask1_12.txt
TLE
2104 ms
33528 KB
subtask1_13.txt
TLE
2104 ms
34424 KB
subtask1_14.txt
WA
115 ms
32512 KB
subtask1_2.txt
TLE
2104 ms
30712 KB
subtask1_3.txt
TLE
2104 ms
34552 KB
subtask1_4.txt
WA
117 ms
33280 KB
subtask1_5.txt
WA
64 ms
21760 KB
subtask1_6.txt
WA
196 ms
33280 KB
subtask1_7.txt
TLE
2104 ms
34424 KB
subtask1_8.txt
TLE
2104 ms
34808 KB
subtask1_9.txt
WA
107 ms
30336 KB