The Preliminary Contest for ICPC China Nanchang National Invitational 南昌网络赛2019

题解不太详细，仅提供AC代码

A. PERFECT NUMBER PROBLEM

#include <bits/stdc++.h>
using namespace std;

int main(void) {
    printf("6\n28\n496\n8128\n33550336\n");
    return 0;
}

D. Match Stick Game

动态规划

#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
const int maxn = 1e5;
const ll inf = 0x7f7f7f7f7f7f7f7f;
const int inf1 = 0x7f7f7f7f;

int num[10]= {6,2,5,5,4,5,6,3,7,6};
int digit[60],cnt;
ll dp[1000][60][2],Max[2][15][100];

void get() {
	for(int i = 0; i <= 10; ++i)
		for(int j = 0; j <= 80; ++j) {
			Max[0][i][j] = inf1;
			Max[1][i][j] = -inf1;
		}

	for(int i = 1; i <= 10; ++i)
		for(int k = 1; k < 10; ++k) {
			Max[1][i][6 * (i - 1) + num[k]] = max(Max[1][i][6 * (i - 1) + num[k]],k * (ll)pow(10,i - 1));
			Max[0][i][6 * (i - 1) + num[k]] = min(Max[0][i][6 * (i - 1) + num[k]],k * (ll)pow(10,i - 1));
		}

	for(int i = 2; i <= 10; ++i)
		for(int j = 2; j <= 80; ++j)
			for(int k = 1; k < 10; ++k) {
				if(j >= num[k]) {
					if(Max[1][i - 1][j - num[k]] != -inf1) {
						if(Max[1][i][j] < Max[1][i - 1][j - num[k]] + k * (ll)pow(10,i - 1))
							Max[1][i][j] = Max[1][i - 1][j - num[k]] + k * (ll)pow(10,i - 1);
					}
					if(Max[0][i - 1][j - num[k]] != inf1) {
						if(Max[0][i][j] > Max[0][i - 1][j - num[k]] + k * (ll)pow(10,i - 1))
							Max[0][i][j] = Max[0][i - 1][j - num[k]] + k * (ll)pow(10,i - 1);
					}
				}
			}
}

ll dfs(int res,int pos,bool flag) {
	if(cnt == pos) {
		if(res >= 80)	return -inf1;
		if(abs(Max[flag][digit[pos]][res]) == inf1)	return -inf1;
		else {
			if(flag)
				return Max[flag][digit[pos]][res];
			else
				return -Max[flag][digit[pos]][res];
		}
	}
	if(dp[res][cnt - pos][flag] != -inf) 	return dp[res][cnt - pos][flag];

	ll tmp = -inf;
	for(int i = 1; i <= 80; ++i) {
		if(i >= res)	break;
		if(abs(Max[flag][digit[pos]][i]) == inf1)	continue;

		if(flag) {
			if(res >= i + 4) 	tmp = max(tmp,Max[flag][digit[pos]][i] + dfs(res - i - 2,pos + 1,true));
			if(res >= i + 3) 	tmp = max(tmp,Max[flag][digit[pos]][i] + dfs(res - i - 1,pos + 1,false));
		} else {
			if(res >= i + 4)	tmp = max(tmp,-Max[flag][digit[pos]][i] + dfs(res - i - 2,pos + 1,true));
			if(res >= i + 3)	tmp = max(tmp,-Max[flag][digit[pos]][i] + dfs(res - i - 1,pos + 1,false));
		}
//		cout<<res<<':'<<pos<<':'<<i<<':'<<Max[flag][digit[pos]][i]<<' '<<tmp<<endl;
	}
	dp[res][cnt - pos][flag] = tmp;

	return tmp;
}

ll solve(string str) {
	int total = 0;
	cnt = 0;

	memset(digit,0,sizeof(digit));
	for(int i = 0; i < str.size(); ++i) {
		if(isdigit(str[i])) {
			total += num[str[i] - '0'];
			++digit[cnt];
		} else {
			if(str[i] == '+')
				total += 2;
			else
				total += 1;
			++cnt;
		}
	}

	return dfs(total,0,true);
}

int main() {
	int t,n;
	string str;

	memset(Max[0],0x7f,sizeof(Max[0]));
	get();

	cin>>t;
	while(t--) {
		cin>>n>>str;
		for(int i = 0; i < 1000; ++i)
			for(int j = 0; j < 60; ++j)
				for(int k = 0; k < 2; ++k)
					dp[i][j][k] = -inf;
		cout<<solve(str)<<endl;
	}

	return 0;
}

H. Coloring Game

每个位置都有3种情况，第一个位置不能是第二种， 最后一个位置不能是第一种，所以一共有2 * 3^(n-2) * 2种情况

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;

ll pow(ll a, ll p){
	if (p == 0) return 1;
	ll t = pow(a, p/2);
	if (p &1) return t * t % mod * a % mod;
	return t * t % mod;
}
int main(void) {
	int n;
	cin >> n;
	if (n == 1) printf("1\n");
	else printf("%lld", 4ll * pow(3ll, (ll)n - 2) % mod);
	return 0;
}

 I. Max answer

维护6个值

L[i]—— i左面比a[i]小的第一个数的位置

R[i]—— i右面比a[i]小的第一个数的位置

lmax[i]—— 以i为右端点的区间最大值

lmin[i]—— 以i为右端点的区间最小值

rmax[i]—— 以i为左端点的区间最大值

rmin[i]—— 以i为左端点的区间最小值

如果 a[i] > 0 ans = max(ans, a[i] * (sum[min(R[i] - 1, rmax[i])] - sum[max(L[i] + 1, lmax[i])-1]));
        a[i] < 0 ans = max(ans, a[i] * (sum[min(R[i] - 1, rmin[i])] - sum[max(L[i] + 1, lmin[i])-1]));

#include <bits/stdc++.h>

using namespace std;
const int maxn =5e5+10;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int L[maxn], R[maxn], lmax[maxn], rmax[maxn], lmin[maxn], rmin[maxn], a[maxn];
ll sum[maxn];
stack<pair<int, int> > s;
int n;

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++){
        scanf("%d", &a[i]);
        sum[i] = sum[i - 1] + a[i];
    }
    s.push({1, a[1]});
    R[n] = n+1;
    a[n+1] = -INF;
    a[0] = -INF;
    for (int i = 2; i <= n+1; i++) {
        while (!s.empty() && s.top().second > a[i]){
            R[s.top().first] = i, s.pop();
        }
        s.push({i,a[i]});
    }
    s.push({n, a[n]});

    for (int i = n-1; i >= 1; i--) {
        while (!s.empty() && s.top().second > a[i]){
            L[s.top().first] = i, s.pop();
        }
        s.push({i,a[i]});
    }
    lmax[1] = 1;
    for (int i= 2; i <= n; i++){
        if (sum[i - 1] - sum[lmax[i - 1] - 1] > 0) lmax[i] = lmax[i -1];
        else lmax[i] = i;
    }
    lmin[1] = 1;
    for (int i = 2; i <= n; i++){
        if (sum[i - 1] - sum[lmin[i - 1] - 1 ]< 0) lmin[i] = lmin[i-1];
        else lmin[i] = i;
    }
    rmax[n] = n;
    for (int i =n -1; i>=1; i--) {
        if (sum[rmax[i+1]] - sum[i] > 0) rmax[i] = rmax[i + 1];
        else rmax[i] = i;
    }
    rmin[n] = n;
    for (int i = n - 1; i>=1; i--){
        if (sum[rmin[i+1]] - sum[i] < 0) rmin[i] = rmin[i + 1];
        else rmin[i] = i;
    }
   ll ans = 0;
    for (int i = 1; i <= n; i++){
        if (a[i] > 0)  ans = max(ans, (ll)a[i] * (sum[min(R[i] - 1, rmax[i])] - sum[max(L[i] + 1, lmax[i])-1]));
        else if (a[i] < 0) ans = max(ans, (ll)a[i] * (sum[min(R[i] - 1, rmin[i])] - sum[max(L[i] + 1, lmin[i])-1]));
    }
    printf("%lld\n", ans);
    return 0;
}

 J. Distance on the tree

离线+线段树+树链剖分

详细见https://blog.csdn.net/Adolphrocs/article/details/89428431

#include <bits/stdc++.h>
using namespace std;

const int maxn  = 2e5+2;
const int maxm = 1e5+2;
struct Ques{
    int l ,r, k, id;
}Q[maxm];

struct node{
    int u, v, w;
}E[maxn];

int n , m, last;
bool cmp(const Ques A, const Ques B){
    return A.k < B.k;
}

bool cmp2(const node A, const node B){
    return A.w < B.w;
}
int Ans[maxn];
vector <int > edge[maxn];
int sz[maxn], son[maxn], pos[maxn], tot, dep[maxn], fa[maxn], top[maxn];

void dfs(int x, int u){
    sz[x] = 1;son[x] = 0;
    fa[x] = u;
    for (int i = 0; i< edge[x].size(); i++){
        if (edge[x][i] == fa[x]) continue;
        dep[edge[x][i]] = dep[x] + 1;
        dfs(edge[x][i], x);
        sz[x] += sz[edge[x][i]];
        if (sz[edge[x][i]] > sz[son[x]]) son[x] = edge[x][i];
    }
}

void dfs1(int x, int now_top) {
    top[x] = now_top;
    pos[x] = ++tot;
    if (son[x]) dfs1(son[x], now_top);
    for (int i = 0; i< edge[x].size(); i++){
        if (edge[x][i] == fa[x]) continue;
        if (edge[x][i] != son[x]){
            dfs1(edge[x][i], edge[x][i]);
        }
    }
}

int tr[maxn * 4];

void add(int l , int r , int p ,int a, int b){
    if (l > a || r < a) return;
    if (l == a && r == a){
        tr[p] = b;
        return ;
    }
    int mid = (l +r) / 2;
    if (a <= mid) add(l, mid , p * 2 , a, b);
    else add(mid +1, r, p*2+1, a, b);
    tr[p] =tr[p *2] + tr[p * 2+1];
}

int query(int l, int r, int p , int a, int b){
    if (l > b || r < a) return 0;
    if(l >= a && r <=b){
        return tr[p];
    }
    int mid = (l +r) /2;
    if (b <= mid) return query(l, mid, p * 2, a, b);
    else if (a > mid) return query(mid + 1, r, p *2 + 1, a, b);
    else return query(l, mid, p * 2, a, b) + query(mid+1, r, p * 2 +1, a, b);
}

int ques_ans(int u, int v){
    int f1 = top[u], f2 = top[v], ans = 0;
    while (f1 != f2){
        if (dep[f1] < dep[f2]){
            swap(u, v);
            swap(f1,f2);
        }
        ans += query(1, n, 1, pos[f1], pos[u]);
        u = fa[f1];f1 = top[u];
    }
    if (u == v) return ans;
    if (dep[u] > dep[v]) swap(u, v);
    return ans + query(1, n, 1, pos[son[u]], pos[v]);
}

int main() {
    scanf("%d%d", &n, &m);
    for (int  i = 1; i< n;i++){
        int u, v, w;
        scanf("%d%d%d", &u,&v,&w);
        edge[u].push_back(v);
        edge[v].push_back(u);
        E[i].u = u;
        E[i].v = v;
        E[i].w = w;
    }
    sort(E+1,E+n, cmp2);
    dfs(1, 1);
    dfs1(1, 1);
    for (int i = 1; i <= m;i++){
        scanf("%d%d%d", &Q[i].l, &Q[i].r, &Q[i].k);
        Q[i].id = i;
    }
    sort(Q+1, Q+1+m, cmp);
    last = 0;
    for (int i =1; i<=m;i++){
        for (int j = last+1; j < n; j++){
            if (E[j].w > Q[i].k) break;
            if (dep[E[j].u] > dep[E[j].v]) swap(E[j].u, E[j].v);
            add(1, n, 1, pos[E[j].v], 1);
            last = j;
        }
        Ans[Q[i].id] = ques_ans(Q[i].l, Q[i].r);
    }
    for (int i = 1; i <= m;i++){
        printf("%d\n", Ans[i]);
    }
    return 0;
}

 

 L. qiqi'tree

几何模拟树的生长

#include <bits/stdc++.h>

using namespace std;
const int maxn = 2e6;
struct branch{
    double x1, y1, x2, y2;
    double getLength(){
        return sqrt((x1 - x2) *(x1 - x2) + (y1 -y2) * (y1 - y2));
    }
};

struct line{
    double x0, y0, k;
}L;
int n;
int isUpLine(double x, double y, line L){
    if (y > L.k * x - L.k * L.x0 + L.y0) return 1;
    else if (y < L.k * x - L.k * L.x0 + L.y0) return -1;
    return 0;
}

double dis(double x, double y, line L){
    double ans = L.k * x - y - L.k * L.x0 + L.y0;
    return fabs(ans) / sqrt(L.k * L.k +1);
}

double restLength(branch a, line b){
    if (isUpLine(a.x1, a.y1, b) < 0 && isUpLine(a.x2, a.y2, b) == 0) return a.getLength();
    if (isUpLine(a.x1, a.y1, b) < 0 && isUpLine(a.x2, a.y2, b) > 0) {
        double l1 = dis(a.x1, a.y1, b);
        double l2 = dis(a.x2, a.y2, b);
        return a.getLength()*l1/(l1+l2);
    }
}

branch q[maxn],nxt[maxn];
int tot, tot1;
double Ans =0;
void cut(){
    for (int i = 0; i < tot; i++){
        if (isUpLine(q[i].x1, q[i].y1, L) * isUpLine(q[i].x2, q[i].y2, L) >0){
            Ans += q[i].getLength();
            nxt[tot1++] = q[i];
        }
        else if (isUpLine(q[i].x1, q[i].y1, L) <0 && isUpLine(q[i].x2, q[i].y2, L) ==0){
            Ans += q[i].getLength();
        }else if (isUpLine(q[i].x1, q[i].y1, L) <0 && isUpLine(q[i].x2, q[i].y2, L) > 0){
            Ans += restLength(q[i], L);
        }
    }
    tot=0;
    for (int i = 0; i < tot1; i++){
        double x = (nxt[i].x2 - nxt[i].x1)/4;
        double y = (nxt[i].y2 - nxt[i].y1)/4;
        q[tot++] = {nxt[i].x2, nxt[i].y2, x+nxt[i].x2, y+nxt[i].y2};
        q[tot++] = {nxt[i].x2, nxt[i].y2, 1.0/2.0 * x - sqrt(3.0)/2.0 * y + nxt[i].x2 , sqrt(3.0)/2.0 * x + 1.0/2.0*y + nxt[i].y2};
       // cout <<q[tot-1].x1 << " " <<q[tot-1].y1<< " " << q[tot-1].x2 <<" "<< q[tot-1].y2 << endl;
        q[tot++] = {nxt[i].x2, nxt[i].y2, 1.0/2.0 * x + sqrt(3.0)/2.0 * y + nxt[i].x2 , -sqrt(3.0)/2.0 * x + 1.0/2.0*y + nxt[i].y2};
    }
    tot1 =0;
}
int main()
{
    int T;
    cin >> T;
    while (T--){
        double len=0;tot=0,tot1=0;
        scanf("%lf", &len);
        scanf("%d%lf%lf%lf", &n, &L.x0, &L.y0, &L.k);
        branch fir({0.0,0.0,0.0,len});
        q[tot++] = fir;Ans =0;
        for (int i = 1; i<=n;i++){
            cut();
        }
        printf("%.6lf\n", Ans);
    }
    return 0;
}

K. MORE XOR

很暴力的

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
typedef long long ll;
ll T, n,q,le,ri,mid,ans,sum,k;
ll a[maxn], f[4][5][maxn],fu;

int main() {
	cin >> T;
	int g[4][4][4]={1,0,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0,0};
	while (T--){
		scanf("%lld", &n);
		sum = 0;
		for (int i =1; i <= n; i++)
			scanf("%lld", &a[i]), sum = sum ^ a[i];
		for (int k = 0; k <4;k++)
			for (int i  = 0; i < 4; i++)
				for (int j = 1; j <=n;j++)
					f[k][i][j] = f[k][i][j-1]^(a[j]*g[k][i][(j-1)%4]);
		scanf("%lld", &q);
		while (q--){
			scanf("%lld%lld", &le ,&ri) ;
			mid = ri - le;
			ans =sum;
			printf("%lld\n", (f[(le-1)%4][mid%4][ri]^f[(le-1)%4][mid%4][le-1]) );
		}
	}
	return 0;
} 

M. Subsequence

预处理第一串st[i]后26个字符第一次出现的地方

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
char st[maxn], st2[1002];
int now[26], nxt[maxn][26];
int n;
int main() {
	scanf("%s" , st);
	int l1 = strlen(st);
	for (int i = 0 ; i < 26; i++) now[i] = l1;
	for (int i = l1 -1 ; i >=0; i--){
		for (int j = 0; j < 26;j++){
			 nxt[i][j] = now[j];
		}
		now[st[i] - 'a'] = i;
	}
	scanf("%d", &n);
	for (int i = 0;i <n;i++){
		scanf("%s", st2);
		int l2 = strlen(st2);
		int s1, s2;
		s1 = s2 = 0;
		if (l2 > l1) {
			printf("NO\n");
			continue;
		}
		s1 = now[st2[0] - 'a'];
		for (int j = 1; j < l2; j++){
			s1 = nxt[s1][st2[j] -'a'];
			if (s1 == l1) break; 
		}
		if (s1 != l1) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}