Submission #3889387
Source Code Expand
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
int x,y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
/*
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
*/
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
int pr[1000010];
int inv[1000010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<ert;i++){
pr[i]=(pr[i-1]*i)%mod;
}
for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
struct unionfind{
private:
public:
vector<int> par,ranks,kosuu;
void shoki(int N){
par.resize(N+1,0);
ranks.resize(N+1,0);
kosuu.resize(N+1,1);
for(int i=0;i<=N;i++){
par[i]=i;
}
}
int root(int x){
return par[x]==x ? x : par[x]=root(par[x]);
}
bool same(int x,int y){
return root(x)==root(y);
}
bool is_root(int x){
return x==root(x);
}
void unite(int x,int y){
x=root(x);
y=root(y);
int xx=kosuu[x],yy=kosuu[y];
if(x==y) return;
if(ranks[x]<ranks[y]){
par[x]=y;
kosuu[y]=yy+xx;
}
else {
par[y]=x;
if(ranks[x]==ranks[y]) ranks[x]=ranks[x]+1;
kosuu[x]=yy+xx;
}
return;
}
};
unionfind UF;
vector<pa3> ve;
vector<int> ans;
bool bo[100020]={};
int eda[100020][2];
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,k;
cin>>n>>m>>k;
UF.shoki(100020);
for(int i=1;i<=m;i++){
cin>>eda[i][0]>>eda[i][1];
}
for(int i=0;i<k;i++){
int y;
cin>>y;
if(y){
int v,w;
cin>>v>>w;
ve.pb({y,v,w});
}
else{
int v;
cin>>v;
ve.pb({y,v,0});
bo[v]=1;
}
}
for(int i=1;i<=m;i++)if(!bo[i])ve.pb({0,i,0});
reverse(ve.begin(),ve.end());
for(auto v:ve){
if(v.x==0){
UF.unite(eda[v.y][0],eda[v.y][1]);
}
else{
if(UF.same(v.y,v.z))ans.pb(1);
else ans.pb(0);
}
}
reverse(ans.begin(),ans.end());
for(auto v:ans){
if(v)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
Submission Info
| Submission Time |
|
| Task |
D - Graph Destruction |
| User |
smiken |
| Language |
C++14 (GCC 5.4.1) |
| Score |
100 |
| Code Size |
13657 Byte |
| Status |
AC |
| Exec Time |
167 ms |
| Memory |
11632 KB |
Judge Result
| Set Name |
All |
| Score / Max Score |
100 / 100 |
| Status |
|
| Set Name |
Test Cases |
| All |
1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 2, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 3, 30, 31, 32, 33, 34, 35, 36, 4, 5, 50, 6, 7, 8, 9 |
| Case Name |
Status |
Exec Time |
Memory |
| 1 |
AC |
3 ms |
2560 KB |
| 10 |
AC |
6 ms |
2816 KB |
| 11 |
AC |
19 ms |
3324 KB |
| 12 |
AC |
53 ms |
4472 KB |
| 13 |
AC |
101 ms |
7284 KB |
| 14 |
AC |
148 ms |
7152 KB |
| 15 |
AC |
158 ms |
10864 KB |
| 16 |
AC |
167 ms |
11632 KB |
| 17 |
AC |
49 ms |
4600 KB |
| 18 |
AC |
46 ms |
4472 KB |
| 19 |
AC |
59 ms |
4600 KB |
| 2 |
AC |
3 ms |
2560 KB |
| 20 |
AC |
85 ms |
7412 KB |
| 21 |
AC |
61 ms |
4600 KB |
| 22 |
AC |
86 ms |
6260 KB |
| 23 |
AC |
59 ms |
4724 KB |
| 24 |
AC |
41 ms |
4088 KB |
| 25 |
AC |
47 ms |
4472 KB |
| 26 |
AC |
121 ms |
7408 KB |
| 27 |
AC |
38 ms |
3960 KB |
| 28 |
AC |
43 ms |
4472 KB |
| 29 |
AC |
98 ms |
6388 KB |
| 3 |
AC |
3 ms |
2560 KB |
| 30 |
AC |
71 ms |
5236 KB |
| 31 |
AC |
119 ms |
7284 KB |
| 32 |
AC |
96 ms |
6388 KB |
| 33 |
AC |
104 ms |
7156 KB |
| 34 |
AC |
123 ms |
8180 KB |
| 35 |
AC |
115 ms |
6640 KB |
| 36 |
AC |
53 ms |
4600 KB |
| 4 |
AC |
3 ms |
2688 KB |
| 5 |
AC |
3 ms |
2688 KB |
| 50 |
AC |
120 ms |
6896 KB |
| 6 |
AC |
3 ms |
2688 KB |
| 7 |
AC |
3 ms |
2688 KB |
| 8 |
AC |
4 ms |
2688 KB |
| 9 |
AC |
5 ms |
2688 KB |