个人赛2补题

个人赛2补题

AC代码

题A Rolling Dice

#include <iostream>
#include <stdio.h>
//#include <windows.h>

int a, b;
bool ans = false;

bool dfs(int times, int sum) {
    if (sum > 6 * times || sum < 1 * times) return false;
    if (sum / times >= 1 && sum / times <= 6) return true;
    for (int i = 1; i < 6; i ++) 
        if (dfs(times-1,sum-i)) return true;
    return false;
}

int main () {
    scanf("%d%d",&a,&b);
    if (b > 6 * a || b < 1 * a) printf("No\n");
    else if (b / a >= 1 && b / a <= 6) printf("Yes\n");
    else {
        if(dfs(a,b)) printf("Yes\n");
        else printf("No\n");
    }
    //system("pause");
}

题B Factorial Yen Coin

#include <iostream>
#include <stdio.h>
//#include <windows.h>

int p;
int f[11];

void work() {
    f[1] = 1;
    for (int i = 2; i <= 10; i ++) f[i] = i * f[i - 1];
}

int main () {
    work();
    scanf("%d",&p);
    int sum = 0;
    for (int i = 10; i >= 1; i --) {
        if(p) { 
            sum += p / f[i];
            p = p % f[i];
        }
        else break;
    }
    printf("%d\n",sum);
    //system("pause");
}

题C Fair Candy Distribution

#include <iostream>
#include <stdio.h>
#include <utility>
#include <algorithm>
using std::sort;
using std::pair;
//#include <windows.h>

int n;
long long k;
const int MAXN = 2e5 + 5;
long long ans[MAXN];
pair<int,int>a[MAXN];

int main () {
    scanf("%d%lld",&n,&k);
    int x;
    for (int i = 0; i < n; i ++) {
        scanf("%d",&x);
        a[i].first = x;
        a[i].second = i;
        ans[i] += k / n;
    }
    k %= n;
    sort(a,a+n);
    for (int i = 0; i < k; i ++) ans[a[i].second] ++;
    for (int i = 0; i < n; i ++) printf("%lld\n",ans[i]);
    //system("pause");
}

补题

题D Shortest Path Queries 2
其实思路在比赛过程中想得差不多了，但是开了三维数组然后出现了未知的错误。
题解的重点就在于一个递推公式的推导，然后巧妙避免了开三维数组
公式f(i,j,k) = min{f(i,j,k-1),f(i,k,k-1)+f(k,j,k-1)
初始化值f(i,i,k) = 0; f(i,j,0) = c(map[a][b] = c); f(i,j,0) = INF(无路）

#include <iostream>
#include <stdio.h>
//#include <windows.h>
#include <cstring>
#define INF 1e18
using std::min;

const int MAXN = 405;
long long dis[MAXN][MAXN], map[MAXN][MAXN];
int n, m;
long long ans = 0;

int main () {
    int a, b, c;
    scanf("%d%d",&n,&m);
    for (int i = 1; i <= n; i ++) {
        for (int j = 1; j <= n; j ++) {
            if (i != j) map[i][j] = INF;
            else map[i][j] = 0;
        }
    }
    for (int i = 0; i < m; i ++) {
        scanf("%d%d%d",&a,&b,&c);
        map[a][b] = c;
    }
    for (int k = 1; k <= n; k ++) {
        memset(dis,0,sizeof(dis));
        for (int i = 1; i <= n; i ++) {
            for (int j = 1; j <= n; j ++) {
                dis[i][j] = min(map[i][j],map[i][k] + map[k][j]);
                //printf("%lld\n",dis[i][j]);
                if (dis[i][j] < INF) ans += dis[i][j];
            }
        }
        for (int i = 1; i <= n; i ++) {
            for (int j = 1; j <= n; j ++) {
                map[i][j] = dis[i][j];
            }
        }
    }
    printf("%lld\n",ans);
    //system("pause");
}

题E Digit Products
数位DP

dp公式
for(int i = 0; i <= (is? a[t] : 9); i ++){
		res += dfs (t + 1, (is && i == (is ? a[t] : 9)), (are && !i ? 1 : re * i) ,are && !i);
	}

#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
using std::map;
using std::reverse;
typedef long long ll;

int a[20], cnt;
ll n, m;
map<ll, ll> dp[20][2][2];

ll dfs(int t, bool is, ll re, bool are) {
    //t为当前位数
    //re为当前乘积
	//is:上一位是不是最大的，是为1，不是为0
	//are:之前的所有数字是不是都是0，是为1，不是为0
	ll res = 0;
	if(t >= cnt) return re <= m;
	if(dp[t][is][are][re]) return dp[t][is][are][re];
	for(int i = 0; i <= (is? a[t] : 9); i ++){
		res += dfs (t + 1, (is && i == (is ? a[t] : 9)), (are && !i ? 1 : re * i) ,are && !i);
	}
	dp[t][is][are][re] = res;
	return res;
}
ll init(ll x){
	cnt = 0;
	memset(a,0,sizeof(a));
	while(x) {
		a[cnt ++] = x % 10;
		x /= 10;
	}
	reverse(a,a + cnt);
	return dfs(0,1,1,1);
}
int main(){
	scanf("%lld%lld",&n,&m);
	printf("%lld\n",init(n) - 1);
}

题F Cumulative Sum
答案为 1k,2k,3k,⋯,nk 的 m 阶前缀和的第 n 项值。

#include<iostream>
#include<cstdio>
#include<algorithm>

typedef long long ll;
const ll mod = 1e9 + 7;

ll Add(ll x, ll y) { 
    return (x + y >= mod) ? (x + y - mod) : (x + y); 
}
ll Mod(ll x) {
    return (x >= mod) ? (x - mod) : (x < 0 ? (x + mod) : x); 
}
ll Mul(ll x, ll y) {
    return x * y % mod;
}
ll qpow(ll x, ll y) { 
    ll sumq = 1;
    while(y) { 
        if(y & 1) sumq = sumq * x % mod; 
        x = x * x % mod; 
        y >>= 1; 
    } 
    return sumq; 
}
const int N = 2600100;
ll n, m, k;
ll a[N], fac[N], inv[N], pre[N], suf[N], ans;

int main() {
	scanf("%lld%d%d",&n,&m,&k); 
    ll l = m + k + 1;
	if(!n) {
        printf("0\n"); 
        return 0;
    }
	for(ll i = 1; i <= l; ++ i) a[i] = qpow(i, k);
	for(int j = 1; j <= m; ++j)
		for(int i = 1; i <= l; ++i)
			a[i] = Add(a[i], a[i-1]);
	inv[0] = fac[0] = 1;
    for(int i = 1; i <= l; ++i) fac[i] = fac[i-1] * i % mod;
	inv[l] = qpow(fac[l], mod-2); 
    n %= mod;
	for(int i = l-1; i; --i) inv[i] = inv[i+1] * (i+1) % mod;
	pre[0] = 1; 
    for(int i = 1; i <= l; ++i) pre[i] = pre[i-1] * (n - i) % mod;
	suf[l+1] = 1; 
    for(int i = l; i; --i) suf[i] = suf[i+1] * (n - i) % mod;
	for(int i = 1; i <= l; ++i)
		ans = Add(ans, Mod(a[i] * pre[i-1] % mod * suf[i+1] % mod * inv[i-1] % mod * inv[l-i] % mod * (((l-i)&1) ? -1 : 1)));
	printf("%lld\n", ans);
	return 0;
}