NAIPC 2018

E. Prefix Free Code

大意: 给定$n$个串, 保证任意一个串都不是另一个串的前缀, 从中选出$k$个串可以拼成$\binom{n}{k}k!$种串. 给定其中一个串, 求这个串的排名.

先用字典树处理一下, 从而转化为给定一个$n$元素中取$k$元素的排列, 求排名.

#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(a) ({REP(__i,1,n) cout<<a[__i]<<',';hr;})
using namespace std;
typedef long long ll;
const int P = 1e9+;
const int N = 1e6+;
ll inv(ll x){return x<=?:inv(P%x)*(P-P/x)%P;}
int n,k,ch[N][],T,val[N],a[N],tot,cnt,len;
char s[N];
void add(int &o, char *s) {
    if (!o) o = ++tot;
    if (*s) add(ch[o][*s-'a'],s+);
    else val[o] = ;
}
void dfs(int o) {
    if (!o) return;
    if (val[o]) return val[o] = ++cnt,void();
    REP(i,,) dfs(ch[o][i]);
}
void find(int o, char *s) {
    if (val[o]) a[++*a]=val[o];
    else ++len,find(ch[o][*s-'a'],s+);
}

int c[N];
void add(int x, int v) {
    for (; x<=n; x+=x&-x) c[x]+=v;
}
int qry(int x) {
    int ret = ;
    for (; x; x^=x&-x) ret+=c[x];
    return ret;
}

int main() {
    scanf("%d%d",&n,&k);
    REP(i,,n) scanf("%s",s),add(T,s);
    dfs(T);
    scanf("%s",s+);
    int m = strlen(s+);
    REP(i,,m) len=,find(T,s+i),i+=len-;
    int tot = ;
    REP(i,n-k+,n) tot = (ll)tot*i%P;
    REP(i,,n) c[i] = i&-i;
    int ans = ;
    REP(i,,k) {
        tot = (ll)tot*inv(n-i+)%P;
        ans = (ans+(ll)qry(a[i]-)*tot)%P;
        add(a[i],-);
    }
    printf("%d\n",ans);
}

H. Recovery

大意: 给定每行每列和的奇偶性, 要求恢复一个$n\times m$的$01$矩阵, 若有多种方案输出$1$个数最多的, 还有多种的话输出字典序最小的.

先初始化全$1$, 那么就转化为要改变某些行某些列的奇偶性, 如果行列需要改动的个数之差为奇数则无解, 偶数时贪心构造一下.

#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(a) ({REP(__i,1,n) cout<<a[__i]<<',';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=%P;for (a%=P;n;a=a*a%P,n>>=)if(n&)r=r*a%P;return r;}
ll inv(ll x){return x<=?:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=;char p=getchar();while(p<''||p>'')p=getchar();while(p>=''&&p<='')x=x*+p-'',p=getchar();return x;}
//head

const int N = ;
int n,m;
vector<int> va,vb;
char ans[N][N],a[N],b[N];

int main() {
    scanf("%s%s",a+,b+);
    n = strlen(a+);
    m = strlen(b+);
    REP(i,,n) if (m%==&&a[i]==''||m%==&&a[i]=='') va.pb(i);
    REP(i,,m) if (n%==&&b[i]==''||n%==&&b[i]=='') vb.pb(i);
    int sza = va.size(), szb = vb.size();
    if ((sza-szb)&) return puts("-1"),;
    REP(i,,n) REP(j,,m) ans[i][j]='';
    if (szb>=sza) {
        REP(i,,szb-sza-) ans[][vb[i]] = '';
        int now = ;
        REP(i,szb-sza,szb-) ans[va[now++]][vb[i]] = '';
    }
    else {
        REP(i,,sza-szb-) ans[va[i]][] = '';
        int now = ;
        REP(i,sza-szb,sza-) ans[va[i]][vb[now++]] = '';
    }
    REP(i,,n) puts(ans[i]+);
}