Red Huang

Red Huang

uva 10665

怪怪題目

重打了 N 遍,打完思緒會很亂

//====================================================================||  
//                                                                    ||  
//                                                                    ||  
//                         Author : GCA                               ||  
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||  
//====================================================================||  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
using namespace std;  
#ifdef ONLINE\_JUDGE  
#define ll "%lld"  
#else  
#define ll "%I64d"  
#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 Is\_debug true  
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
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);  
}  
struct alc{  
    int num;  
    char c;  
    alc(){num=c=0;};  
}al\[100\];  
int n;  
char str\[10000\];  
int cnum\[100\];  
char ans\[1000\];  
bool used\[1000\];  
bool cmp(alc a,alc b){  
    if(a.num==b.num)return a.c<b.c;  
    return a.num>b.num;  
}  
void solve(){  
    Set(used,0);  
    sort(al,al+n,cmp);  
    int r=n-1,l=0;  
    while(r>l){  
        int i,j,b,a;  
        for(i=0;i<n;i++)if(!used\[i\])break;  
        used\[i\]=1;  
        a=i;  
        for(j=i+1;j<n;j++)if(!used\[j\])break;  
        int t=0,k;  
        for(k=j+1;k<n;k++){  
            if(al\[k\].num!=al\[j\].num)break;  
            if(!used\[k\]){  
                t=k;  
            }  
        }  
        if(!t||al\[j\].c<al\[i\].c){  
            b=j;  
        }else b=t;  
        used\[b\]=1;  
        if(al\[a\].c<al\[b\].c){  
            ans\[l\]=al\[a\].c;  
            ans\[r\]=al\[b\].c;  
        }else{  
            ans\[l\]=al\[b\].c;  
            ans\[r\]=al\[a\].c;  
        }  
        l++;  
        r--;  
    }  
    if(l==r){  
        for(int i=0;i<n;i++){  
            if(!used\[i\])ans\[l\]=al\[i\].c;  
        }  
    }  
    for(int i=0;i<n-1;i++)printf("%c ",ans\[i\]);printf("%c\\n",ans\[n-1\]);  
    for(int i=0;i<n-1;i++)printf("%d ",cnum\[ans\[i\]-'A'\]);printf("%d\\n",cnum\[ans\[n-1\]-'A'\]);  
}  
void init(){  
    Set(cnum,0);  
    for(int i=0;i<n;i++){  
        al\[i\].c=i+'A';  
        al\[i\].num=0;  
    }  
}  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    int test;  
    scanf("%d",&test);  
    while(test--){  
        scanf("%d%\*c",&n);  
        init();  
        gets(str);  
        int len=strlen(str);  
        for(int i=0;i<len;i++){  
            if(str\[i\]=='#')break;  
            al\[str\[i\]-'A'\].num++;  
            cnum\[str\[i\]-'A'\]++;  
        }  
        solve();  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

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