2019ICPC南昌网络赛

C Hello 2019

线段树维护矩阵，什么样的矩阵呢，最短路转移矩阵，a[i][j]表示从i状态转移到j状态的最小花费，那么对于两个矩阵，我们可以跑Floyd最短路算法，合并出新的矩阵，有个优化就是i状态一定只能转移到j(j>=i)的状态，所以我们只需要维护上三角矩阵，应此常数可从125降为35

#include<iostream>
#include<algorithm>
using namespace std;

struct mat {
	int a[5][5];
	mat() {
		for (int i = 0; i < 5; i++) {
			for (int j = 0; j < 5; j++) {
				a[i][j] = i == j ? 0 : 1e9;
			}
		}
	}
	mat operator*(mat x) {
		mat ret;
		for (int i = 0; i < 5; i++) {
			for (int j = i; j < 5; j++) {
				ret.a[i][j] = 1e9;
				for (int k = i; k <= j; k++) {
					ret.a[i][j] = min(ret.a[i][j], a[i][k] + x.a[k][j]);
				}
			}
		}
		return ret;
	}
};

#define ls rt<<1
#define rs rt<<1|1
#define mid (l+r>>1)
mat t[800010]; char a[200010];
void php(int rt) {
	t[rt] = t[ls] * t[rs];
}
void build(int rt, int l, int r) {
	if (l == r) {
		if (a[l] == '2') t[rt].a[0][0] = 1, t[rt].a[0][1] = 0;
		else if (a[l] == '0') t[rt].a[1][1] = 1, t[rt].a[1][2] = 0;
		else if (a[l] == '1') t[rt].a[2][2] = 1, t[rt].a[2][3] = 0;
		else if (a[l] == '9') t[rt].a[3][3] = 1, t[rt].a[3][4] = 0;
		else if (a[l] == '8') t[rt].a[3][3] = 1, t[rt].a[4][4] = 1;
		return;
	}
	build(ls, l, mid);
	build(rs, mid + 1, r);
	php(rt);
}
mat que(int rt, int l, int r, int x, int y) {
	if (x <= l && r <= y) return t[rt];
	mat ret;
	if (x <= mid)ret = ret * que(ls, l, mid, x, y);
	if (mid < y)ret = ret * que(rs, mid + 1, r, x, y);
	return ret;
}

char tmp[200010];
int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int n, q; cin >> n >> q;
	cin >> tmp;
	for (int i = 1; i <= n; i++)a[i] = tmp[n - i];

	build(1, 1, n);

	for (int i = 1; i <= q; i++) {
		int a, b; cin >> a >> b;
		mat tmp = que(1, 1, n, n + 1 - b, n + 1 - a);
		int ans = tmp.a[0][4];
		cout << (ans == 1e9 ? -1 : ans) << "\n";
	}
}

D Interesting Series

#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
#define ll long long
const ll mod = 100003;

ll mypow(ll a,ll b){
    ll ret=1;
    while(b){
        if(b&1)ret=ret*a%mod;
        a=a*a%mod;b>>=1;
    }
    return ret;
}

const double pi = acos(-1);
struct cp {
	double x, y;
	cp operator+(cp a) { return { x + a.x,y + a.y }; }
	cp operator-(cp a) { return { x - a.x,y - a.y }; }
	cp operator*(cp a) { return { x*a.x - y * a.y,x*a.y + y * a.x }; }
};

const int maxn = 220010;
int rev[maxn]; cp w[maxn];
void fft(cp x[], int len, int on) {

    for (int i = 0; i < len / 2; i++) {
		double sita = 2 * pi*i / len;
		double c = cos(sita), s = sin(sita);
		w[i] = { c,s }; w[i + len / 2] = { -c,-s };
	}

	for (int i = 0; i < len; i++)rev[i] = (i & 1)*(len >> 1) + (rev[i >> 1] >> 1);
	for (int i = 0; i < len; i++)if (i < rev[i])swap(x[i], x[rev[i]]);
	for (int i = 2; i <= len; i <<= 1) {
		int wn = len / i, d = i >> 1;
		for (int j = 0; j < len; j += i) {
			int wk = 0;
			for (int k = j; k < j + d; k++) {
				cp a = x[k], b = w[wk] * x[k + d];
				x[k] = a + b, x[k + d] = a - b;
				wk += wn;
			}
		}
	}
	if (on == -1) {
		reverse(x + 1, x + len);
		for (int i = 0; i < len; i++)x[i].x /= len;
	}
}

ll s[220010], k[220010];
cp ans[220010];
void solve(int l, int r,cp a[]) {

	if (l == r) {
		a[0].x = s[l], a[1].x = 1;
		return;
	}

    int len=1;
    while(len<=r-l+1)len<<=1;
    cp x[len+10]={};
	cp y[len+10]={};

	//cout<<l<<" "<<r<<" "<<len<<endl;

    int m=l+r>>1;
    solve(l,m,x);solve(m+1,r,y);

	//for(int i=0;i<len;i++)cout<<w[i].x<<" "<<w[i].y<<endl;

	//for(int i=0;i<len;i++)cout<<x[i].x<<" "<<y[i].x<<endl;

	fft(x,len,1);fft(y,len,1);
    for(int i=0;i<len;i++)a[i]=x[i]*y[i];
    fft(a,len,-1);

    for(int i=0;i<len;i++){

        //cout<<l<<" "<<r<<" "<<i<<" "<<(long long)a[i].x<<endl;

        a[i].x=(long long)(a[i].x+0.5)%mod;
        a[i].y=0;
    }
}

ll inv[maxn],fac[maxn];
void init(){
    fac[0]=1;
    for(int i=1;i<mod;i++)fac[i]=fac[i-1]*i%mod;
    inv[mod-1]=mypow(fac[mod-1],mod-2);
    for(int i=mod-1;i>=1;i--)inv[i-1]=inv[i]*i%mod;
}

ll c(int a,int b){
    return fac[a]*inv[b]*inv[a-b]%mod;
}

int main() {

    init();
	int n, a, q; cin >> n >> a >> q;
	for (int i = 1; i <= n; i++)cin >> s[i];
	for (int i = 1; i <= q; i++)cin >> k[i];
	for (int i = 1; i <= n; i++)s[i] = mypow(a, s[i]);

    solve(1,n,ans);

    for(int i=1;i<=q;i++){
        cout<<((c(n,k[i])-(long long)(ans[n-k[i]].x+0.5))*mypow(1-a,mod-2)%mod+mod)%mod<<endl;
    }

}