团体程序设计天梯赛-练习集

团体程序设计天梯赛-练习集

题目链接：https://www.patest.cn/contests/gplt

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main(void){
    int n;
    char ch;
    scanf("%d %c",&n,&ch);
    int floor=sqrt((n+1.0)/2);
    int res=n-2*floor*floor+1;
    for(int i=floor;i>=1;--i){
        for(int j=0;j<floor-i;++j)
            printf(" ");
        for(int j=0;j<2*i-1;++j)
            printf("%c",ch);
        printf("\n");
    }
    for(int i=2;i<=floor;++i){
        for(int j=0;j<floor-i;++j)
            printf(" ");
        for(int j=0;j<2*i-1;++j)
            printf("%c",ch);
        printf("\n");
    }
    printf("%d\n",res);
    return 0;
}

#include<cstdio>
#include<cstring>
using namespace std;
int a[10];
char s[1005];
int main(void){
    scanf("%s",s);
    for(int i=0;i<strlen(s);i++)a[s[i]-'0']++;
    for(int i=0;i<10;i++)if(a[i])printf("%d:%d\n",i,a[i]);
    return 0;
}

#include<cstdio>
#include<algorithm>
using namespace std;
struct S{
    char id[15];
    int a,b;
};
bool complare(S x,S y){
    return x.a<y.a;
}
S q[1000];
int main(void){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;++i)
        scanf("%s%d%d",q[i].id,&q[i].a,&q[i].b);
    sort(q,q+n,complare);
    int m;
    S tmp,t;
    scanf("%d",&m);
    for(int i=0;i<m;++i){
        scanf("%d",&t.a);
        t=*(lower_bound(q,q+n,t,complare));/**t?!**/
        printf("%s %d\n",t.id,t.b);
    }
    return 0;
}

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define MAX_N 1000
#define LL long long
using namespace std;
int a[MAX_N];
int main(void){
    int n;
    //freopen("in.txt","r",stdin);
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    while(~scanf("%d",&n)){
            memset(a,0,sizeof(a));
    int k=0;
    int start=0;
    int limit=(int)sqrt(n);
    for(int i=2;i<=limit;++i)
        if(n%i==0)
            a[k++]=i;
    a[k++]=n;
    int len=1,temp=1,l=0;
    int store=a[0];
    for(int i=1;i<k;++i){
        if(a[i]==a[i-1]+1){//因数应当不重复使用
            if(!(n%(store*a[i]))&&store*a[i]<=n){
                store*=a[i];
                temp++;
            }else if(!(n%((store/a[l])*a[i]))&&store/a[l]*a[i]<=n){
                store/=a[l];
                l++;
                store*=a[i];
            }else{
                store=a[i];
                temp=1;
                l=i;
            }
        }else{
            store=a[i];
            temp=1;
            l=i;
        }
        if(temp>len){
            len=temp;
            start=l;
        }
    }
    printf("%d\n%d",len,a[start]);
    for(int i=start+1;i<start+len;++i)
        printf("*%d",a[i]);
    printf("\n");}
    return 0;
}

#include<cstdio>
#include<string>
#include<iostream>
#include<cstring>
using namespace std;
char a[200];
int main(void){
    string b[10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
    scanf("%s",a);
    int len=strlen(a);
    if(a[0]=='-')printf("fu");
    else cout<<b[a[0]-'0'];
    for(int i=1;i<len;++i)
            cout<<' '<<b[a[i]-'0'];
    printf("\n");
    return 0;
}

#include<cstdio>
using namespace std;
int main(void){
    int a,b;
    scanf("%d%d",&a,&b);
    int sum=0,k=0;
    for(int i=a;i<=b;++i){
        printf("%5d",i);
        k++;
        sum+=i;
        if(!(k%5))printf("\n");
    }
    if(k%5)printf("\n");
    printf("Sum = %d\n",sum);
    return 0;
}

#include<cstdio>
#include<cstring>
#include<cmath>
#define LL long long
using namespace std;
LL a[101],b[101];
LL gcd(LL x,LL y){
    return y==0?x:gcd(y,x%y);
}
void simple(LL i){
    LL temp=gcd(abs(a[i]),b[i]);
    a[i]/=temp;
    b[i]/=temp;
}
int main(void){
    //freopen("1.in.txt","r",stdin);
    LL n;
    scanf("%lld",&n);
    for(LL i=0;i<n;++i){
        scanf("%lld/%lld",&a[i],&b[i]);
        simple(i);
    }
    long long x=a[0],y=b[0];
    for(LL i=1;i<n;i++){
        x=x*b[i]+y*a[i];
        y=y*b[i];
        if(x){
            LL temp=gcd(abs(x),y);
            x/=temp;
            y/=temp;
        }
    }
    if(!x){
        printf("0\n");
        return 0;
    }
    LL temp=x/y;
    x=x-temp*y;
    LL t=gcd(abs(x),y);
    x/=t;
    y/=t;
    if(temp){
        printf("%lld",temp);
        if(x)printf(" %lld/%lld",x,y);
        printf("\n");
    }else{
        if(x)printf("%lld/%lld",x,y);
        printf("\n");
    }
    return 0;
}

#include<cstdio>
#include<algorithm>
using namespace std;
int main(void){
    int a[3];
    for(int i=0;i<3;++i)
        scanf("%d",&a[i]);
    sort(a,a+3);
    printf("%d->%d->%d\n",a[0],a[1],a[2]);
    return 0;
}

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#define N 10000
#define LL long long
using namespace std;
char a[N+1],b[N+1],s[N+1];
bool sb[300];
int main(void){
    //freopen("1.in.txt","r",stdin);
    gets(a);
    gets(b);
    LL len=strlen(b);
    for(LL i=0;i<len;++i)
        sb[b[i]]=true;
    len=strlen(a);
    LL k=0;
    for(LL i=0;i<len;++i)
        if(!sb[a[i]])s[k++]=a[i];
    cout<<s<<endl;
    return 0;
}

#include<cstdio>
using namespace std;
int main(void){
    int n;
    scanf("%d",&n);
    int temp=1;
    for(int i=1;i<=n;++i)
        temp*=2;
    printf("2^%d = %d\n",n,temp);
    return 0;
}

#include<cstdio>
#define LL long long
using namespace std;
int main(void){
    LL n;
    scanf("%lld",&n);
    LL temp=1;
    LL sum=0;
    for(LL i=1;i<=n;++i){
        temp=1;
        for(LL j=1;j<=i;++j){
            temp*=j;
        }
        sum+=temp;
    }
    printf("%lld\n",sum);
    return 0;
}

#include<cstdio>
using namespace std;
int main(void){
    int n;
    char a;
    scanf("%d %c",&n,&a);
    for(int i=1;i<=((n+1)/2);++i){
        for(int j=1;j<=n;++j)
            printf("%c",a);
        printf("\n");
    }
    return 0;
}

#include<cstdio>
#include<cstring>
using namespace std;
int main(void){
    //freopen("in.txt","r",stdin);
    char z[]={'1','0','X','9','8','7','6','5','4','3','2'};
    char a[19];
    int q[]={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};
    int temp=0;
    int n,m;
    bool flat=false,k=true;
    scanf("%d",&n);
    while(n--){
        memset(a,0,sizeof(a));
        scanf("%s",a);
        flat=false;
        temp=0;
        for(int i=0;i<17;++i){
            if(a[i]<'0'||a[i]>'9'){
                flat=true;
                break;
            }
            temp=(temp+q[i]*(a[i]-'0'))%11;
        }
        if(flat){
            printf("%s\n",a);
            k=false;
        }else{
            if(z[temp]!=a[17]){
                printf("%s\n",a);
                k=false;
            }
        }
    }
    if(k)printf("All passed\n");
    return 0;
}

#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
string s;
int bit,o=1,t;
double f=1;
int main(void){
    cin>>s;
    for(int i=0;i<s.length();++i){
        if(s[i]=='-'){
            f+=0.5;
        }else{
            if(s[i]=='2')t++;
            bit++;
        }
    }
    if((s[s.length()-1]-'0')%2==0)o+=1;
    printf("%.2lf%%\n",1.0*t/bit*f*o*100);
}

#include <cstdio>
#include <cstring>
using namespace std;
char s[10];
int h,m;
int get(int l,int r){
    int t=0;
    for(int i=l;i<=r;++i)
        t=t*10+s[i]-'0';
    return t;
}
int main(void){
    scanf("%s",s);
    h=get(0,1);m=get(3,4);
    if(0<=h&&h<=11)printf("Only %s.  Too early to Dang.",s);
    else if(h==12&&m==0)printf("Only %s.  Too early to Dang.",s);
    else{
        if(h>12)h-=12;
        if(m)h+=1;
        for(int i=0;i<h;++i)
            printf("Dang");
    }
}

#include <iostream>
using namespace std;
int a,b,n,jia,yi;
int main(void){
    cin>>a>>b>>n;
    while(n--){
        int x,xh,y,yh;
        cin>>x>>xh>>y>>yh;
        int t=x+y;
        if(t==xh&&t==yh)continue;
        else if(t==xh)jia++;
        else if(t==yh)yi++;
        if(jia>a){
            cout<<"A\n"<<yi;
            return 0;
        }else if(yi>b){
            cout<<"B\n"<<jia;
            return 0;
        }
    }
}

#include <cstdio>
using namespace std;
int n,m,p[100000],ans[100000],vis[100000];
int main(void){
    scanf("%d",&n);
    while(n--){
        int k;
        scanf("%d",&k);
        int x;
        for(int i=0;i<k;++i){
            scanf("%d",&x);
            if(k<=1)continue;
            p[x]=1;
        }
    }
    scanf("%d",&m);
    int k=0;
    while(m--){
        int x;
        scanf("%d",&x);
        if(!p[x]&&!vis[x]){
            vis[x]=1;
            ans[k++]=x;
        }
    }
    if(!k)printf("No one is handsome\n");
    else{
        for(int i=0;i<k;++i)
            printf("%05d%c",ans[i],i==k-1?'\n':' ');
    }
}

#include <cstdio>
#include <cstring>
#define N 10005
using namespace std;
char a[N],b[N];
int string2int(char a[]){
    int temp=0;
    for(int i=0;i<strlen(a);++i){
        if(a[i]<'0'||a[i]>'9')return -1;
        temp=temp*10+a[i]-'0';
    }
    return temp<=1000&&temp>=1?temp:-1;
}
int main(void){
    scanf("%s%*c",a);
    gets(b);
    int x=string2int(a);
    int y=string2int(b);
    printf("%s + %s = ",x==-1?"?":a,y==-1?"?":b);
    if(x!=-1&&y!=-1)printf("%d\n",x+y);
    else puts("?");
}

#include <iostream>
#include <queue>
#include <vector>
#define N 505
using namespace std;
const int inf=0x3fffffff;
int n,m,s,d,p[N],pre[N],dis[N],per[N],num[N];
bool vis[N];
struct edge{int to,w;};
vector<edge>e[N];
struct node{
    int u,d;
    bool operator < (const node x)const{return d>x.d;}
};
priority_queue<node>q;
void dij(int s){
    for(int i=0;i<n;++i)dis[i]=inf;
    dis[s]=0;per[s]=p[s];num[s]=1;pre[s]=-1;
    q.push((node){s,0});
    while(!q.empty()){
        node t=q.top();q.pop();
        int u=t.u;
        if(vis[u])continue;
        vis[u]=1;
        for(int i=0;i<(int)e[u].size();++i){
            int v=e[u][i].to,w=e[u][i].w;

            if(dis[u]+w==dis[v])num[v]+=num[u];
            if(dis[u]+w<dis[v])num[v]=num[u];

            if( (dis[u]+w==dis[v]&&per[u]+p[v]>per[v])
               ||dis[u]+w<dis[v]){
                dis[v]=dis[u]+w;
                per[v]=per[u]+p[v];
                pre[v]=u;
                q.push((node){v,dis[v]});
            }
        }
    }
}
void dfs(int k){
    if(k==-1)return;
    dfs(pre[k]);
    cout<<k<<" ";
}
int main(void){
    std::ios::sync_with_stdio(false);
    cin>>n>>m>>s>>d;
    for(int i=0;i<n;++i)cin>>p[i];
    for(int i=0;i<m;++i){
        int u,v,w;
        cin>>u>>v>>w;
        e[u].push_back((edge){v,w});
        e[v].push_back((edge){u,w});
    }
    dij(s);
    cout<<num[d]<<" "<<per[d]<<"\n";
    dfs(pre[d]);
    cout<<d<<endl;
}

#include<cstdio>
#include<cstring>
#include<cstring>
#include<stack>
#include<cmath>
#define MAX_N 100000
using namespace std;
struct TYPE{
    int vul,next;
};
TYPE a[MAX_N+1];
int x[MAX_N+1],y[MAX_N+1];
bool compare[MAX_N+1];
int main(void){
    freopen("in.txt","r",stdin);
    int adress,n;
    scanf("%d%d",&adress,&n);
    for(int i=0;i<n;++i){
        int temp;
        scanf("%d",&temp);
        scanf("%d%d",&a[temp].vul,&a[temp].next);
    }
    int k1=0,k2=0;
    for(int i=adress;i!=-1;i=a[i].next){
        int temp=abs(a[i].vul);
        if(compare[temp]==false){
            x[k1++]=i;
            compare[temp]=true;
        }else{
            y[k2++]=i;
        }
    }
    printf("%05d %d ",x[0],a[x[0]].vul);
    for(int i=1;i<k1;++i){
        printf("%05d\n",x[i]);
        printf("%05d %d ",x[i],a[x[i]].vul);
    }
    printf("-1\n");
    if(k2){
        printf("%05d %d ",y[0],a[y[0]].vul);
        for(int i=1;i<k2;++i){
            printf("%05d\n",y[i]);
            printf("%05d %d ",y[i],a[y[i]].vul);
        }
        printf("-1\n");
    }
    return 0;
}

#include<cstdio>
#include<algorithm>
#define N 1005
#define EPS 1e-8
using namespace std;
typedef pair<double,double> P;
P a[N+1];
bool compare(P x,P y){
    return (x.second/x.first)>(y.second/y.first);
}
int main(void){
    int n;
    double d;
    //freopen("in.txt","r",stdin);
    scanf("%d%lf",&n,&d);
    for(int i=0;i<n;++i)
        scanf("%lf",&a[i].first);
    for(int i=0;i<n;++i)
        scanf("%lf",&a[i].second);
    sort(a,a+n,compare);
    double temp=0,vul=0;
    for(int i=0;temp<d&&i<n;++i){//考虑总和小于d的情况
        if((temp+a[i].first<d)&&(temp+a[i].first-d)<EPS){
            temp+=a[i].first;
            vul+=a[i].second;
        }else{
            double t=d-temp;
            temp=d;
            vul+=(a[i].second*t/a[i].first);
        }
    }
    printf("%.2lf\n",vul);
    return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
bool isST(int a[],int l,int r){
    if(l>=r)return 1;
    int key=r;
    for(int i=l+1;i<=r;++i){
        if(a[l]<=a[i]){
            key=i;
            break;
        }
    }
    for(int i=key+1;i<=r;++i)
        if(a[l]>a[i])return 0;
    return isST(a,l+1,key-1)&&isST(a,key,r);
}
bool isMirST(int a[],int l,int r){
    if(l>=r)return 1;
    int key=r;
    for(int i=l+1;i<=r;++i){
        if(a[l]>a[i]){
            key=i;
            break;
        }
    }
    for(int i=key+1;i<=r;++i)
        if(a[l]<=a[i])return 0;
    return isMirST(a,l+1,key-1)&&isMirST(a,key,r);
}
struct node{
    int vul;
    node *l,*r;
};
node *T=NULL;
node* st(node *t,int key){
    if(t==NULL){
        node *temp=(node*)malloc(sizeof(node));
        temp->vul=key;
        temp->l=NULL;
        temp->r=NULL;
        return temp;
    }
    if(key>=t->vul)t->r=st(t->r,key);
    else t->l=st(t->l,key);
    return t;
}
node* Mirst(node *t,int key){
    if(t==NULL){
        node *temp=(node*)malloc(sizeof(node));
        temp->vul=key;
        temp->l=NULL;
        temp->r=NULL;
        return temp;
    }
    if(key<t->vul)t->r=Mirst(t->r,key);
    else t->l=Mirst(t->l,key);
    return t;
}
 void printT(node *t){
    if(t==NULL)return;
    printT(t->l);
    printT(t->r);
    if(t!=T)printf("%d ",t->vul);
}
int main(void){
    freopen("in.txt","r",stdin);
    int a[1001];
    memset(a,0,sizeof(a));
    int n;
    scanf("%d",&n);
    if(n==0){
        printf("YES\n");
        return 0;
    }
    for(int i=0;i<n;++i)
        scanf("%d",&a[i]);
    bool flag1=isST(a,0,n-1);
    bool flag2=isMirST(a,0,n-1);
    if(!(flag1||flag2)){
        printf("NO\n");
        return 0;
    }
    else if(flag1)for(int i=0;i<n;++i)T=st(T,a[i]);
    else if(flag2)for(int i=0;i<n;++i)T=Mirst(T,a[i]);
    printf("YES\n");
    printT(T);
    printf("%d",T->vul);
    printf("\n");
    return 0;
}

#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
void debug(int x){
    printf("debug:%d\n",x);
}
int n,m,k[55],a[55][10005];
int same(int u,int v){
    int j=0,cnt=0;
    for(int i=0;i<k[u];++i){
        while(j<k[v]&&a[u][i]>a[v][j])j++;
        if(a[u][i]==a[v][j])cnt++;
    }
    return cnt;
}
int main(void){
    scanf("%d",&n);
    for(int i=0;i<n;++i){
        scanf("%d",&k[i]);
        for(int j=0;j<k[i];++j)
            scanf("%d",&a[i][j]);
        sort(a[i],a[i]+k[i]);
        k[i]=unique(a[i],a[i]+k[i])-a[i];
    }
    scanf("%d",&m);
    while(m--){
        int u,v;
        scanf("%d%d",&u,&v);
        int c=same(u-1,v-1);
        printf("%.2lf%%\n",100.0*c/(k[u-1]+k[v-1]-c));
    }
}

#include<cstdio>
#include<cstdlib>
#include<queue>
#include<cstring>
#define N 30
using namespace std;
struct node{
    int vul;
    node *r,*l;
};
queue<node*>q;
node* creat(int a[],int al,int ar,int b[],int bl,int br){
    if(al>ar||bl>br)return 0;
    int i,k=0;
    for(i=bl;i<=br;++i){
        if(b[i]==a[ar])break;
        k++;
    }
    node *t=(node*)malloc(sizeof(node));
    t->vul=a[ar];
    t->l=creat(a,al,al+k-1,b,bl,i-1);
    t->r=creat(a,al+k,ar-1,b,i+1,br);
    return t;
}
int main(void){
    //freopen("in.txt","r",stdin);
    int a[N+1];
    int b[N+1];
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;++i)
        scanf("%d",&a[i]);
    for(int i=0;i<n;++i)
        scanf("%d",&b[i]);
    node *t=creat(a,0,n-1,b,0,n-1);
    node *temp;
    printf("%d",t->vul);
    q.push(t);
    while(!q.empty()){
        temp=q.front();
        q.pop();
        if(temp){
            if(temp!=t)printf(" %d",temp->vul);
            q.push(temp->l);
            q.push(temp->r);
        }
    }
    printf("\n");
    return 0;
}

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#define EPS 1e-8
#define N 10000
using namespace std;
struct node{
    int house,area;
};
struct res{
    int num;
    int people;
    int house;
    int area;
    double rh,ra;
};
res r[1000];
int k;
node a[N];
int pre[N];
bool mark[N];
void Make(){
    for(int i=0;i<N;++i)pre[i]=i;
}
int Find(int x){
    if(x!=pre[x])
        pre[x]=Find(pre[x]);
    return pre[x];
}
void uion(int x,int y){
    int k1=Find(x),k2=Find(y);
    k1<k2?pre[k2]=k1:pre[k1]=k2;
}
bool compare(res x,res y){
    if(fabs(x.ra-y.ra)<EPS)return x.num<y.num;
    else return x.ra>y.ra;
}
int main(void){
    freopen("in.txt","r",stdin);
    int n;
    scanf("%d",&n);
    Make();
    for(int i=0;i<n;++i){
        int me,father,mother,num,kid[5],house,area;
        scanf("%d%d%d%d",&me,&father,&mother,&num);
        mark[me]=1;
        if(father!=-1){
            uion(me,father);
            mark[father]=1;
        }
        if(mother!=-1){
            uion(me,mother);
            mark[mother]=1;
        }
        for(int i=0;i<num;++i){
            scanf("%d",&kid[i]);
            mark[kid[i]]=1;
            uion(me,kid[i]);
        }
        scanf("%d%d",&house,&area);
        a[me].house=house;
        a[me].area=area;
    }
    for(int i=0;i<N;++i)
        Find(i);
    int p;
    for(int i=0;i<N;++i){
        if(mark[i]){
            if(k==0){
                r[k].num=pre[i];
                r[k].people++;
                r[k].house=a[i].house;
                r[k].area=a[i].area;
                k++;
            }else{
                bool flag=true;
                for(p=0;p<k;++p){
                    if(r[p].num==pre[i]){
                        flag=false;
                        break;
                    }
                }
                if(flag){
                    r[k].num=pre[i];
                    r[k].people++;
                    r[k].house=a[i].house;
                    r[k].area=a[i].area;
                    k++;
                }else{
                    r[p].people++;
                    r[p].house+=a[i].house;
                    r[p].area+=a[i].area;
                }
            }
        }
    }
    for(int i=0;i<k;++i){
        r[i].rh=r[i].house*1.0/r[i].people;
        r[i].ra=r[i].area*1.0/r[i].people;
    }
    printf("%d\n",k);
    sort(r,r+k,compare);
    for(int i=0;i<k;++i)
        printf("%04d %d %.3lf %.3lf\n",r[i].num,r[i].people,r[i].rh,r[i].ra);
    return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
char s[1001];
int a[1001];
int b[1001];
int main(void){
    freopen("in.txt","r",stdin);
    gets(s);
    int len=strlen(s);
    for(int i=0;i<len-1;++i){
        for(int j=0;;++j){
            if(i+j>=len||i-j<0)break;
            if(s[i-j]==s[i+j])a[i]++;
            else break;
        }
        if(s[i]==s[i+1]){
            for(int j=0;;++j){
                if(i+1+j>=len||i-j<0)break;
                if(s[i-j]==s[i+1+j])b[i]++;
                else break;
            }
        }
    }
    int Max=1;
    for(int i=0;i<len;++i){
        Max=max(Max,a[i]*2-1);
        Max=max(Max,b[i]*2);
    }
    printf("%d\n",Max);
    return 0;
}

#include<cstdio>
using namespace std;
bool enemy[105][105];
int pre[105];
int Find(int a){
    if(a!=pre[a])pre[a]=Find(pre[a]);
    return pre[a];
}
void uion(int a,int b){
    int t1=Find(a),t2=Find(b);
    if(t1!=t2)pre[t1]=t2;
}
void make(int n){
    for(int i=1;i<=n;i++)pre[i]=i;
}
int main(void){
    int n,m,k;
    scanf("%d%d%d",&n,&m,&k);
    make(n);
    while(m--){
        int a,b,g;
        scanf("%d%d%d",&a,&b,&g);
        if(g==1)uion(a,b);
        else enemy[a][b]=enemy[b][a]=1; //a和b是敌人
    }
    while(k--){
        int a,b;
        scanf("%d%d",&a,&b);
        int ta=Find(a),tb=Find(b);
        if(enemy[a][b]){
            if(ta==tb)printf("OK but...\n");
            else printf("No way\n");
        }else{
            if(ta==tb)printf("No problem\n");
            else printf("OK\n");
        }
    }
    return 0;
}

#include<cstdio>
using namespace std;
bool enemy[105][105];
int pre[105];
int Find(int a){
    if(a!=pre[a])pre[a]=Find(pre[a]);
    return pre[a];
}
void uion(int a,int b){
    int t1=Find(a),t2=Find(b);
    if(t1!=t2)pre[t1]=t2;
}
void make(int n){
    for(int i=1;i<=n;i++)pre[i]=i;
}
int main(void){
    int n,m,k;
    scanf("%d%d%d",&n,&m,&k);
    make(n);
    while(m--){
        int a,b,g;
        scanf("%d%d%d",&a,&b,&g);
        if(g==1)uion(a,b);
        else enemy[a][b]=enemy[b][a]=1;
    }
    while(k--){
        int a,b;
        scanf("%d%d",&a,&b);
        int ta=Find(a),tb=Find(b);
        if(enemy[a][b]){//a和b是敌人
            if(ta==tb)printf("OK but...\n");
            else printf("No way\n");
        }else{
            if(ta==tb)printf("No problem\n");
            else printf("OK\n");
        }
    }
    return 0;
}

#include<cstdio>
#include<cstdlib>
#include<queue>
#define N 30
using namespace std;
typedef struct node{
    int v;
    node *l,*r;
}*Node;
int mid[N];//中序
int pre[N];//前序
int res[N];//结果
int n;
int Find(int x){//在中序数组中找树根的位置
    for(int i=0;i<n;++i){
        if(mid[i]==x)
            return i;
    }
    return -1;
}
Node Make(int pl,int pr,int ml,int mr){//构造镜像树
    if(pl>pr)return NULL;
    Node T=(Node)malloc(sizeof(node));
    T->v=pre[pl];
    int t=Find(pre[pl]);
    T->r=Make(pl+1,pl+t-ml,ml,t-1);
    T->l=Make(pl+t-ml+1,pr,t+1,mr);
    return T;
}
int main(void){
    scanf("%d",&n);
    for(int i=0;i<n;++i){
        scanf("%d",mid+i);
    }
    for(int i=0;i<n;++i){
        scanf("%d",pre+i);
    }
    Node T=Make(0,n-1,0,n-1);

    queue<Node>q;
    q.push(T);
    int k=0;
    while(!q.empty()){
        Node t=q.front();
        q.pop();
        if(t){
            res[k++]=t->v;
            q.push(t->l);
            q.push(t->r);
        }
    }

    printf("%d",res[0]);
    for(int i=1;i<k;++i){
        printf(" %d",res[i]);
    }
    printf("\n");
    return 0;
}

#include<cstdio>
#include<iostream>
using namespace std;
int a[1005];
int location(int key){
    int k=0;
    while(a[k]!=key)k++;
    return k;
}
int transint(char s[]){
    if(s[0]=='-'){
        int temp=0;
        for(int i=1;s[i]!=' '&&s[i]!='\0';i++)
            temp=temp*10+s[i]-'0';
        return -temp;
    }else{
        int temp=0;
        for(int i=0;s[i]!=' '&&s[i]!='\0';i++)
            temp=temp*10+s[i]-'0';
        return temp;
    }
}
int main(void){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++){
        scanf("%d",a+i);
        int k=i;
        while(k&&a[k]<a[(k-1)/2]){
            swap(a[k],a[(k-1)/2]);
            k=(k-1)/2;
        }
    }
    while(m--){
        bool flag;
        char s[50];
        int x;
        scanf("%d",&x);
        gets(s);//由于gets会读取x后的分隔符，所以字符串s实际上是从' '开始的
        //一开始用s[8]
        if(s[4]=='t'&&s[8]=='r'){//第一种查询
            if(a[0]==x)flag=1;
            else flag=0;
        }else if(s[4]==' '){//第二种查询
            int y=transint(&s[5]);
            int t=location(x);
            if(t){
                if(t&1){
                    if(a[t+1]==y)flag=1;
                    else flag=0;
                }else{
                    if(a[t-1]==y)flag=1;
                    else flag=0;
                }
            }else flag=0;
        }else if(s[4]=='t'&&s[8]=='p'){//第三种查询
            int y=transint(&s[18]);
            int t=location(y);
            if(t&&a[(t-1)/2]==x)flag=1;
            else flag=0;
        }else if(s[4]=='a'){//第四种查询
            int y=transint(&s[15]);
            int t=location(x);
            if(t&&a[(t-1)/2]==y)flag=1;
            else flag=0;
        }
        if(flag)printf("T\n");
        else printf("F\n");
    }
    return 0;
}

#include <cstdio>
#include <vector>
#include <set>
#define N 505
using namespace std;
int n,m,k,pre[N],a[5005];
vector<int>e[N];
set<int>s,rest;
struct node{
    int alert,id;
}ans[5005];
void debug(char *a,int x){
    printf("%s:%d\n",a,x);
}
int Find(int x){
    return x==pre[x]?x:pre[x]=Find(pre[x]);
}
void Union(int a,int b){
    int x=Find(a),y=Find(b);
    if(x!=y)pre[x]=y;
}
int main(void){
    for(int i=0;i<=500;++i)pre[i]=i;
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;++i){
        int u,v;
        scanf("%d%d",&u,&v);
        e[u].push_back(v);
        e[v].push_back(u);
    }
    scanf("%d",&k);
    for(int i=0;i<k;++i){
        scanf("%d",&a[i]);
        rest.insert(a[i]);
    }
    for(int i=0;i<n;++i){
        if(rest.count(i)==0){
            for(int j=0;j<e[i].size();++j){
                int v=e[i][j];
                if(s.count(v)==1)Union(i,v);
            }
            s.insert(i);
        }
    }
    for(int i=k-1;i>=0;--i){
        int x=a[i],pre=-1;
        ans[i]=(node){0,x};
        for(int j=0;j<e[x].size();++j){
            int v=e[x][j];
            if(s.count(v)==1){
                if(pre==-1)pre=Find(v);
                else if(pre!=Find(v))ans[i].alert=1;
                Union(x,v);
            }
        }
        s.insert(x);
    }
    for(int i=0;i<k;++i){
        if(ans[i].alert)printf("Red Alert: City %d is lost!\n",ans[i].id);
        else printf("City %d is lost.\n",ans[i].id);
    }
    if(k==n)printf("Game Over.\n");
}

#include <iostream>
#include <algorithm>
using namespace std;
int a[100005],k,n;
int main(void){
    cin>>n;
    for(int i=0;i<n;++i){
        int x;
        cin>>x;
        int idx=lower_bound(a,a+k,x)-a;
        if(idx==k)a[k++]=x;
        else a[idx]=x;
    }
    cout<<k<<endl;
}

#include <cstdio>
#include <queue>
#include <iostream>
using namespace std;
int n,k,m;
double ans[25];
priority_queue<double>q;
int main(void){
    cin>>n>>k>>m;
    for(int i=0;i<n;++i){
        int maxn=-1,minn=101,sum=0;
        for(int j=0;j<k;++j){
            int x;
            cin>>x;
            sum+=x;
            maxn=max(maxn,x);
            minn=min(minn,x);
        }
        q.push(1.0*(sum-minn-maxn)/(k-2));
    }
    for(int i=0;i<m;++i){
        double t=q.top();q.pop();
        ans[i]=t;
    }
    for(int i=m-1;i>=0;--i){
        printf("%.3lf%c",ans[i],i==0?'\n':' ');
    }
}

/*
本题坑点：
1.题目说的五代（本人、父母、祖父母、曾祖父母、高祖父母）包括外婆那部分.
2.查询时有可能查询在本人ID内没出现过的ID（父母的ID）
*/
#include <cstdio>
#include <set>
#define N 100005
using namespace std;
int n,k;
bool f;
set<int>s;
struct node{
    int fa,ma;
    char sex;
    node(int FA=-1,int MA=-1,char SEX=0){
        fa=FA;ma=MA;sex=SEX;
    }
}p[N];
void dfs_u(int x,int d){
    if(x==-1||d>5)return;
    s.insert(x);
    dfs_u(p[x].fa,d+1);
    dfs_u(p[x].ma,d+1);
}
void dfs_v(int x,int d){
    if(!f)return;
    if(x==-1||d>5)return;
    if(s.count(x))f=0;
    dfs_v(p[x].fa,d+1);
    dfs_v(p[x].ma,d+1);
}
int main(void){
    scanf("%d",&n);
    for(int i=0;i<n;++i){
        int id,fa,ma;
        char sex;
        scanf("%d%*c%c%*c%d%d",&id,&sex,&fa,&ma);
        p[id]=node(fa,ma,sex);
        if(p[fa].sex==0)p[fa]=node(-1,-1,'M');
        if(p[ma].sex==0)p[ma]=node(-1,-1,'F');
    }
    scanf("%d",&k);
    for(int i=0;i<k;++i){
        int u,v;
        scanf("%d%d",&u,&v);
        if(p[u].sex==p[v].sex){
            printf("Never Mind\n");
            continue;
        }
        s.clear();f=1;
        dfs_u(u,1);
        dfs_v(v,1);
        if(f)puts("Yes");
        else puts("No");
    }
}

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<stack>
using namespace std;
const int INF=-0x3fffffff;
stack<int>s;
int dp[101],pre[101],a[10001];
int main(void){
    //freopen("in.txt","r",stdin);
    for(int i=0;i<=100;++i){
        dp[i]=INF;
        pre[i]=-1;
    }
    dp[0]=0;
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)
        scanf("%d",&a[i]);
    sort(&a[1],&a[1]+n);
    for(int i=1;i<=n;++i){
        for(int j=m;j>=a[i];--j){
            if(dp[j]<=dp[j-a[i]]+1){
                dp[j]=dp[j-a[i]]+1;
                pre[j]=j-a[i];
            }
        }
    }
    if(dp[m]>0){
        int k=m;
        while(pre[k]){
            s.push(k-pre[k]);
            k=pre[k];
        }
        printf("%d",k);
        while(!s.empty()){
            printf(" %d",s.top());
            s.pop();
        }
        printf("\n");
    }else printf("No Solution\n");
    return 0;
}

#include<cstdio>
#include<algorithm>
#include<stack>
#define N 100001
#define lson l,m,n<<1
#define rson m+1,r,n<<1|1
using namespace std;
stack<int>pq;
int st[N<<2];
void build(int l,int r,int n,int key);
void change(int l,int r,int n,int key);
void updata(int n);
int query(int l,int r,int n,int key);
int main(void){
    freopen("in.txt","r",stdin);
    int n,key;
    char s[15];
    scanf("%d",&n);
    while(n--){
        scanf("%s",s);
        switch(s[1]){
    case 'o':
        if(pq.empty())printf("Invalid\n");
        else{
            key=pq.top();
            printf("%d\n",key);
            pq.pop();
            change(1,100000,1,key);
        }
        break;
    case 'u':
        scanf("%d",&key);
        pq.push(key);
        build(1,100000,1,key);
        break;
    case 'e':
        if(pq.empty())printf("Invalid\n");
        else{
            key=pq.size()+1;
            key>>=1;
            printf("%d\n",query(1,100000,1,key));
        }
        break;
    }
    }
    return 0;
}
void build(int l,int r,int n,int key){
    if(l>=r){
        st[n]++;
        return;
    }
    int m=(l+r)/2;
    if(key<=m)build(lson,key);
    else build(rson,key);
    updata(n);
}
void change(int l,int r,int n,int key){
    if(l==r){
        st[n]--;
        return;
    }
    int m=(l+r)/2;
    if(key<=m)change(lson,key);
    else change(rson,key);
    updata(n);
}
void updata(int n){
    st[n]=st[n<<1]+st[n<<1|1];
}
int query(int l,int r,int n,int key){
    if(l==r)return l;
    int m=(l+r)/2;
    if(key<=st[n<<1])return query(lson,key);
    else return query(rson,key-st[n<<1]);
}

#include<cstdio>
#include<iostream>
#include<algorithm>
#define N 1005
using namespace std;
int a[N];//num
int pre[N+1];
int r[N];//sum
void Make();
int Find(int n);
void Uion(int x,int y);
bool compare(int x,int y){
    return x>y;
}
int main(void){
    freopen("in.txt","r",stdin);
    int n;
    Make();
    scanf("%d",&n);
    for(int i=0;i<n;++i){
        int t,h,Min,p;
        scanf("%d:",&t);
        for(int j=0;j<t;++j){
            scanf("%d",&h);
            if(!j){
                Min=h;
                p=h;
            }else{
                Min=min(Min,h);
                Uion(h,p);
            }
        }
        a[i]=Min;
    }
    for(int i=1;i<=N;++i)Find(i);
    for(int i=0;i<n;++i)
        r[pre[a[i]]]++;
    sort(r,r+N,compare);
    int k;
    for(k=0;k<N;k++)
        if(!r[k])break;
    printf("%d\n",k);
    printf("%d",r[0]);
    for(int i=1;i<k;++i)
        printf(" %d",r[i]);
    printf("\n");
    return 0;
}
void Make(){
    for(int i=0;i<=N;++i)
        pre[i]=i;
}
int Find(int n){
    if(n!=pre[n])pre[n]=Find(pre[n]);
    return pre[n];
}
void Uion(int x,int y){
    int k1=Find(x),k2=Find(y);
    k1<k2?pre[k2]=k1:pre[k1]=k2;
}

/**dfs over_stack**/
#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
struct position{
    int x,y,z;
};
int a[65][1291][133];
int dx[6]={-1,1,0,0,0,0};
int dy[6]={0,0,0,0,1,-1};
int dz[6]={0,0,-1,1,0,0};
int l,m,n;
queue<position>q;
int bfs(int x,int y,int z);
int main(void){
    freopen("in.txt","r",stdin);
    int t,sum=0,temp;
    scanf("%d%d%d%d",&m,&n,&l,&t);
    for(int i=0;i<l;i++)
        for(int j=0;j<m;++j)
            for(int k=0;k<n;++k)
                scanf("%d",&a[i][j][k]);
    for(int i=0;i<l;i++){
        for(int j=0;j<m;j++){
            for(int k=0;k<n;k++){
                if(a[i][j][k]){
                    temp=bfs(i,j,k);
                    if(temp>=t)sum+=temp;
                }
            }
        }
    }
    printf("%d\n",sum);
    return 0;
}
int bfs(int x,int y,int z){
    position t,tt;
    t.x=x,t.y=y,t.z=z;
    int temp=0;
    q.push(t);
    while(!q.empty()){
        t=q.front();
        q.pop();
        if(a[t.x][t.y][t.z]){
            temp++;
            a[t.x][t.y][t.z]=0;
            for(int i=0;i<6;++i){
                tt.x=t.x+dx[i];
                tt.y=t.y+dy[i];
                tt.z=t.z+dz[i];
                if((0<=tt.x&&tt.x<l)&&(0<=tt.y&&tt.y<m)&&(0<=tt.z&&tt.z<n))
                    q.push(tt);
            }
        }
    }
    return temp;
}

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define N 1000
#define M 10
#define EPS 1e-8
using namespace std;
const int INF=0x3fffffff;
int mp[N+M+1][N+M+1];
int n,m,d;
int Dis[M+1][N+M+1];
bool out[N+M+1];
struct res{
    double ave,mindis;
    int num;
    bool mark;
};
res r[11];
int inti(char a[]);
void dijstra(int x);
bool compare(res a,res b){
    if(a.mindis!=b.mindis)
        return a.mindis>b.mindis;
    else{
        if(fabs(a.ave-b.ave)<EPS)
            return a.num<b.num;
        else
            return a.ave<b.ave;
    }
}
int main(void){
    //freopen("in.txt","r",stdin);
    int k;
    for(int i=1;i<=N+M;i++)
        for(int j=1;j<=N+M;j++)
            mp[i][j]=INF;
    scanf("%d%d%d%d",&n,&m,&k,&d);
    while(k--){
        char a[2][5];
        int b[2],dis;
        scanf("%s%s%d\n",a[0],a[1],&dis);
        for(int i=0;i<2;i++){
            if('1'<=a[i][0]&&a[i][0]<='9')
                b[i]=inti(a[i]);
            else
                b[i]=N+inti(&a[i][1]);
        }
        mp[b[0]][b[1]]=mp[b[1]][b[0]]=dis;
    }
    for(int i=1;i<=m;i++){
        for(int j=1;j<=N+m;j++)
            Dis[i][j]=INF;
        memset(out,1,sizeof(out));
        dijstra(i);
    }
    for(int i=1;i<=m;i++){
        r[i].mindis=INF;
        r[i].num=i;
        for(int j=1;j<=n;j++){
            if(Dis[i][j]!=INF){
                if(Dis[i][j]>d)
                    r[i].mark=1;
                if(r[i].mindis>Dis[i][j])
                    r[i].mindis=Dis[i][j];
                r[i].ave+=Dis[i][j];
            }
        }
        r[i].ave/=n;
    }
    sort(&r[1],&r[1]+m,compare);
    bool flag=1;
    for(int i=1;i<=m;i++){
        if(r[i].mark)continue;
        printf("G%d\n",r[i].num);
        printf("%.1lf %.1lf\n",r[i].mindis,r[i].ave);
        flag=0;
        break;
    }
    if(flag)
        printf("No Solution\n");
    return 0;
}
int inti(char a[]){
    int len=strlen(a);
    int temp=0;
    for(int i=0;i<len;i++)
        temp=temp*10+(a[i]-'0');
    return temp;
}
void dijstra(int x){
    Dis[x][N+x]=0;
    while(1){
        int Min=INF,index;
        for(int i=1;i<=N+m;i++){
            if(out[i]&&Min>Dis[x][i]){
                Min=Dis[x][i];
                index=i;
            }
        }
        if(Min==INF)break;
        out[index]=0;
        for(int i=1;i<=N+m;++i){
            if(out[i]&&Dis[x][index]+mp[index][i]<Dis[x][i])
                Dis[x][i]=Dis[x][index]+mp[index][i];
        }
    }
}

#include<cstdio>
#include<cstring>
#include<stack>
#define N 505
using namespace std;
const int INF=0x3f3f3f3f;
bool mark[N];
int n,Start,End;
int lenmp[N][N];
int timemp[N][N];
int lendis[N];
int timedis[N];
int lenpre[N];
int timepre[N];
void lenDijstra();
void timeDijstra();
int main(void){
    /**输入**/
    memset(lenpre,-1,sizeof(lenpre));
    memset(timepre,-1,sizeof(timepre));
    int m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;++i){
        lendis[i]=INF;
        timedis[i]=INF;
        for(int j=0;j<n;++j){
            lenmp[i][j]=INF;
            timemp[i][j]=INF;
        }
    }
    while(m--){
        int a,b,one,length,time;
        scanf("%d%d%d%d%d",&a,&b,&one,&length,&time);
        if(one){
            lenmp[a][b]=length;
            timemp[a][b]=time;
        }else{
            lenmp[a][b]=lenmp[b][a]=length;
            timemp[a][b]=timemp[b][a]=time;
        }
    }
    scanf("%d%d",&Start,&End);
    /**数据处理**/
    lenDijstra();
    timeDijstra();
    /**输出**/
    int k=End;
    bool flag=1;
    stack<int>times;
    while(k!=Start){
        times.push(k);
        if(timepre[k]!=lenpre[k])flag=0;
        k=timepre[k];
    }
    if(flag){
        printf("Time = %d;",timedis[End]);
        printf(" Distance = %d:",lendis[End]);
        printf("% d",Start);
        while(!times.empty()){
            printf(" => %d",times.top());
            times.pop();
        }
        printf("\n");
    }else{
        printf("Time = %d:",timedis[End]);
        printf("% d",Start);
        while(!times.empty()){
            printf(" => %d",times.top());
            times.pop();
        }
        printf("\n");
        printf("Distance = %d:",lendis[End]);
        printf("% d",Start);
        stack<int>diss;
        k=End;
        while(k!=Start){
            diss.push(k);
            k=lenpre[k];
        }
        while(!diss.empty()){
            printf(" => %d",diss.top());
            diss.pop();
        }
        printf("\n");
    }
    return 0;
}
void lenDijstra(){
    int node[N];
    memset(node,0,sizeof(node));
    node[Start]=1;

    memset(mark,1,sizeof(mark));
    lendis[Start]=0;
    while(1){
        int Min=INF,index;
        for(int i=0;i<n;++i){
            if(mark[i]&&Min>lendis[i]){
                Min=lendis[i];
                index=i;
            }
        }
        if(Min==INF)break;
        mark[index]=0;
        for(int i=0;i<n;++i){
            int d=lendis[index]+lenmp[index][i];
            if(mark[i]&&lendis[i]>d){
                lendis[i]=d;
                lenpre[i]=index;
                node[i]=node[index]+1;/*非node[i]++*/
            }else if(mark[i]&&lendis[i]==d&&node[index]+1<node[i]){
                lenpre[i]=index;
                node[i]=node[index]+1;
            }
        }
    }
}
void timeDijstra(){
    memset(mark,1,sizeof(mark));
    int dis[N];
    for(int i=0;i<n;++i)
        dis[i]=lenmp[Start][i];
    timedis[Start]=0;
    dis[Start]=0;
    while(1){
        int Min=INF,index;
        for(int i=0;i<n;++i){
            if(mark[i]&&Min>timedis[i]){
                Min=timedis[i];
                index=i;
            }
        }
        if(Min==INF)break;
        mark[index]=0;
        for(int i=0;i<n;++i){
            int t=timedis[index]+timemp[index][i];
            int d=dis[index]+lenmp[index][i];
            if(mark[i]&&timedis[i]>t){
                dis[i]=d;
                timedis[i]=t;
                timepre[i]=index;
            }else if(mark[i]&&timedis[i]==t&&dis[i]>d){
                dis[i]=d;
                timepre[i]=index;
            }
        }
    }
}

#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
#define X first
#define Y second
#define N 10005
using namespace std;
int n,m,k;
bool vis[N];
vector<int>e[N];
struct node{
    int id,d;
    node(int ID=-1,int D=-1){id=ID;d=D;}
    bool operator<(node t)const{
        if(d==t.d)return id>t.id;
        return d<t.d;
    }
};
void debug(string s,int v){
    cout<<s<<":"<<v<<"\n";
}
int bfs(int x){
    memset(vis,0,sizeof(vis));
    node ans=node(x,0);
    queue<node>q;
    q.push(ans);
    while(!q.empty()){
        node t=q.front();q.pop();
        if(!vis[t.id]){
            vis[t.id]=1;
            ans=max(ans,t);
            for(int i=0;i<(int)e[t.id].size();++i)
                q.push(node(e[t.id][i],t.d+1));
        }
    }
    return ans.d?ans.id:0;
}
int main(void){
    std::ios::sync_with_stdio(false);
    cin>>n>>m>>k;
    for(int i=1;i<=m;++i){
        int u,v;
        cin>>u>>v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    for(int i=1;i<=k;++i){
        int x;cin>>x;
        cout<<bfs(x)<<"\n";
    }
}

#include <iostream>
#include <cmath>
#include <queue>
using namespace std;
int n,k,dep,ans[50],d_;
struct node{
    int x,l,r;
    node(int X=-1,int L=-1,int R=-1){
        x=X;l=L;r=R;
    }
}a[50];
void cha(int &rt,int x,int d){
    if(rt==-1){
        rt=k;
        if(d==dep-1)d_++;
        a[k++].x=x;
        return;
    }
    if(a[rt].x<x)cha(a[rt].l,x,d+1);
    else cha(a[rt].r,x,d+1);
}
int main(void){
    cin>>n;
    for(int i=1;i<=5;++i){
        if((1<<i)>=n+1){
            dep=i;
            break;
        }
    }
    int root=-1;
    for(int i=0;i<n;++i){
        int x;
        cin>>x;
        cha(root,x,1);
    }
    queue<int>q;
    q.push(0);
    int k=0;
    bool bk=1,complete=1;
    while(!q.empty()){
        int t=q.front();q.pop();
        ans[k++]=a[t].x;
        if(a[t].l!=-1){
            q.push(a[t].l);
            if(!bk)complete=0;
        }else bk=0;
        if(a[t].r!=-1){
            q.push(a[t].r);
            if(!bk)complete=0;
        }else bk=0;
    }
    for(int i=0;i<k-1;++i)
        cout<<ans[i]<<" ";
    cout<<ans[k-1]<<"\n";
    if(n==1||(complete&&d_==(1<<(dep-2))))cout<<"YES\n";
    else cout<<"NO\n";
}

/*
本题坑点：
1.最快进攻路径的条数指的并非是最合适进攻路径的边数，而是距离最短的路径有多少条
*/
#include <iostream>
#include <string>
#include <map>
#define N 205
using namespace std;
const int inf=0x03ffffff;
int n,k,mp[N][N],s,t,idx,def[N];
int pre[N],dis[N],ps[N],num[N],kill[N],vis[N],rount[N];
string i2s[N];
map<string,int>s2i;
void debug(string s,int v){
    cout<<s<<":"<<v<<"\n";
}
void init(){
    string ss,st;
    cin>>n>>k>>ss>>st;
    for(int i=0;i<n;++i){
        pre[i]=-1;dis[i]=inf;
        for(int j=0;j<n;++j){
            mp[i][j]=inf;
        }
    }
    for(int i=1;i<n;++i){
        string s;int df;
        cin>>s>>df;
        def[idx]=df;
        i2s[idx]=s;
        s2i[s]=idx++;
    }
    s=s2i[ss]=idx;
    i2s[idx]=ss;
    t=s2i[st];
    for(int i=0;i<k;++i){
        string su,sv;
        int d;
        cin>>su>>sv>>d;
        int u=s2i[su],v=s2i[sv];
        mp[u][v]=min(mp[u][v],d);
        mp[v][u]=min(mp[v][u],d);
    }
    dis[s]=0;num[s]=1;rount[s]=1;
}
void dfs_printf(int x){
    if(x==-1)return;
    dfs_printf(pre[x]);
    cout<<i2s[x]<<"->";
}
int main(void){
    std::ios::sync_with_stdio(false);
    init();
    while(1){
        int k,maxn=inf;
        for(int i=0;i<n;++i)
            if(!vis[i]&&dis[i]<maxn)
                maxn=dis[k=i];
        if(maxn==inf)break;
        vis[k]=1;
        for(int i=0;i<n;++i){
            int d=dis[k]+mp[k][i];
            int m=num[k]+1;
            int p=ps[k]+def[i];
            if(dis[i]>d){
                pre[i]=k;
                dis[i]=d;
                num[i]=m;
                ps[i]=p;
                rount[i]=rount[k];
            }else if(dis[i]==d){
                rount[i]+=rount[k];
                if(num[i]<m){
                    pre[i]=k;
                    num[i]=m;
                    ps[i]=p;
                }else if(num[i]==m){
                    if(ps[i]<p){
                        pre[i]=k;
                        ps[i]=p;
                    }
                }
            }
        }
    }
    dfs_printf(pre[t]);
    cout<<i2s[t]<<"\n"<<rount[t]<<" "<<dis[t]<<" "<<ps[t]<<"\n";
}