Red Huang

Red Huang

uva 521

直接用想法去做就過了

記得構圖

//  
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA  
//     GGG::::::::::::G     CCC::::::::::::C              A:::A  
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A  
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A  
//G:::::G              C:::::C                        A:::::A:::::A  
//G:::::G              C:::::C                       A:::::A A:::::A  
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A  
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A  
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A  
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A  
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A  
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A  
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A  
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
#include <ctime>  
using namespace std;  
#ifdef DEBUG  
#define debug(...) printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define gettime() end\_time=clock();printf("now running time is %.7f\\n",(float)(end\_time - start\_time)/CLOCKS\_PER\_SEC);  
#else  
#define debug(...)  
#define gettime()  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp\[htx\]\[hty\]);}Pln();}  
#define M 55  
#define PII pair<int,int\>  
#define PB push\_back  
#define oo INT\_MAX  
#define Set\_oo 0x3f  
#define FOR(it,c) for(vector<PII>::iterator it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
clock\_t start\_time=clock(), end\_time;  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
int n,d,s;  
struct lines{  
    int stop\[M\];  
    int sid\[M\];  
    int stopnum;  
    vector<PII> bus;  
}line\[M\];  
int mz\[M\]\[M\];  
bool vis\[M\];  
bool iscom(int stx,int sty,int busx,int busy,int fbusx,int fbusy,int li,int lj){  
    int start=fbusx;  
    int start2=fbusy;  
    int mmax=max(line\[li\].stopnum,line\[lj\].stopnum);  
    for(int i=0;i<mmax;start=(start+1)%stx,start2=(start2+1)%sty,i++){  
        int x=start,y=start2;  
        for(;;){  
//            debug("%d %d %d %d %d\\n",li,lj,line\[li\].stop\[x\],line\[lj\].stop\[y\],x);  
            if(line\[lj\].stop\[y\]==line\[li\].stop\[x\])return true;  
            x=(x+sty)%stx;  
            if(x==start)break;  
        }  
    }  
    return false;  
  
}  
void dfs(int x){  
    vis\[x\]=1;  
    for(int i=0;i<d;i++){  
        if(mz\[x\]\[i\]&&!vis\[i\]){  
            dfs(i);  
        }  
    }  
}  
void solve(){  
    Set(mz,0);  
    for(int i=0;i<n;i++){  
        for(int j=i;j<n;j++){  
            FOR(it,line\[i\].bus){  
                FOR(it2,line\[j\].bus){  
                    int fbusx=(\*it).first,fbusy=(\*it2).first;  
                    int busx=(\*it).second,busy=(\*it2).second;  
                    int stx=line\[i\].stopnum;  
                    int sty=line\[j\].stopnum;  
                    int li=i;  
                    int lj=j;  
                    if(iscom(stx,sty,busx,busy,fbusx,fbusy,li,lj)){  
                        mz\[busx\]\[busy\]=mz\[busy\]\[busx\]=1;  
//                        debug("com %d %d\\n",busx,busy);  
                    }//Pln();  
                }  
            }  
        }  
    }  
    Set(vis,0);  
    dfs(0);  
    int i;  
    for(i=0;i<d;i++)  
        if(!vis\[i\])break;  
    if(i==d)puts("Yes");  
    else puts("No");  
  
}  
void clean(){  
    for(int i=0;i<n;i++){  
        line\[i\].bus.clear();  
    }  
}  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    while(~scanf("%d%d%d%\*c",&n,&d,&s)&&n+d+s){  
        char str\[1000\];  
        for(int i=0;i<n;i++){  
            gets(str);  
            int len=strlen(str);  
            line\[i\].stopnum=0;  
            for(int j=0,k=0;j<len;j+=k,line\[i\].stopnum++){  
                sscanf(str+j,"%d%n",&line\[i\].stop\[line\[i\].stopnum\],&k);  
                line\[i\].stop\[line\[i\].stopnum\]--;  
                line\[i\].sid\[line\[i\].stop\[line\[i\].stopnum\]\]=line\[i\].stopnum;  
            }  
            gets(str);  
            len=strlen(str);  
            for(int j=0,k=0;j<len;j+=k){  
                int x,y;  
                sscanf(str+j,"%d%d%n",&x,&y,&k);  
                x--;y--;  
                line\[i\].bus.PB(PII(line\[i\].sid\[x\],y));  
            }  
        }  
        solve();  
        clean();  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

Loading...
Ownership of this post data is guaranteed by blockchain and smart contracts to the creator alone.