2018 Multi-University Training Contest 7 1,5,10

hdu 6386 Age of Moyu

给出n个点m条边，每条边一个编号，走不同编号的边时需要花费1，求1~n最少花费。

quan哥的一手（以边建图，求最短路）

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
int m,n,vis[maxn],val;
long long dis[2*maxn];
vector<int> ve[maxn];

struct Egde {
    int from,to,stop;
} edge[2*maxn];

struct Node {
    long long int d,u;
    bool operator < (const Node& rhs) const{
        return d>rhs.d;
    }
};

priority_queue<Node>Q;

int main()
{
    while(scanf("%d%d",&n,&m)!=EOF) {
        memset(vis,0,sizeof(vis));
        for(int i=0; i<m; i++)
            dis[i]=inf;
        for(int i=0; i<=n; i++)
            ve[i].clear();
        for(int i=0; i<m; i++) {
            scanf("%d%d%d",&edge[i].from,&edge[i].to,&edge[i].stop);

            if(min(edge[i].from,edge[i].to)==1) {
                dis[i]=0;
                Q.push(Node {dis[i],i});
            }
            ve[edge[i].from].push_back(i);
            ve[edge[i].to].push_back(i);
        }
        while(!Q.empty()) {
            Node e=Q.top();
            Q.pop();
            int x=e.u;
            if(vis[x])
                continue;
            vis[x] = 1;
            int a=edge[x].from;
            int b=edge[x].to;
            int len1=ve[a].size();
            int len2=ve[b].size();
            for(int i=0; i<len1; i++) {
                int y = ve[a][i];
                if(edge[y].stop!=edge[x].stop)
                    val=1;
                else
                    val=0;

                if(dis[y] > dis[x]+val ) {
                    dis[y] = dis[x]+val ;
                    Q.push(Node {dis[y],y});
                }
            }
            for(int i=0; i<len2; i++) {
                int y = ve[b][i];

                if(edge[y].stop!=edge[x].stop)
                    val=1;
                else
                    val=0;

                if(dis[y] > dis[x]+val ) {
                    dis[y] = dis[x]+val ;
                    Q.push(Node {dis[y],y});
                }
            }
        }
        long long ans = inf;
        for(int i=0; i<ve[n].size(); i++)
            ans = min(ans,dis[ve[n][i]]);
        if(ans == inf)
            printf("-1\n");
        else
            printf("%lld\n",ans+1);
    }
    return 0;
}

hdu 6390 GuGuFishtion
dalao博客

欧拉函数+容斥

！！！

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

using namespace std;
#define ll long long
const int N = 1e6+5;
const int M = 1e5+5;
int t, n, m, p;
ll inv[N], f[N];
int prime[M], cnt;
int phi[N];
bool is_p[N];

void init()///线性筛->欧拉函数，素数表
{
    for(int i=0; i<N; i++) is_p[i] = true;
    cnt = 0;
    phi[1] = 1;
    for(int i=2; i<N; i++){
        if(is_p[i]){
            prime[cnt++] = i;
            phi[i] = i-1;
        }
        for(int j=0; j<cnt; j++){
            if(i*prime[j] >= N) break;
            is_p[i*prime[j]] = false;
            if(i%prime[j] == 0){
                phi[i*prime[j]] = phi[i]*prime[j];
                break;
            }
            else{
                phi[i*prime[j]] = phi[i]*(prime[j]-1);
            }
        }
    }
}

int main()
{
    init();
    scanf("%d", &t);
    while(t --){
        scanf("%d%d%d", &n, &m, &p);
        if(n < m) swap(n, m);
        inv[1] = 1;
        for(int i=2; i<=n; i++) inv[i] = (ll)inv[p%i]*(p-(p/i))%p;
        ll ans = 0;
        for(int i=n; i>=1; i--){
            f[i] = (ll)(n/i)*(m/i);///gcd为i的方案数
            for(int j=i*2; j<=n; j+=i){
                f[i] -= f[j];///是i的倍数就减去
            }
            ans = (ans+f[i]%p*i%p*inv[phi[i]])%p;
            ///i = gcd(a,b)
        }
        printf("%lld\n", ans);
    }
    return 0;
}

hdu 6395 Sequence

p除n向下取整的值在一些区间段是相同的，可以在这些区间段进行矩阵快速幂。

标程（写得少，没有深入理解）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
const int mod = 1e9+7;
int t;
ll a, b, c, d, p, n;
struct mtx{
    ll x[3][3];
    mtx() { memset(x, 0, sizeof(x)); }
    mtx operator*(const mtx &P)const{
        mtx sum;
        for(int k=0; k<3; k++)
            for(int i=0; i<3; i++)
                for(int j=0; j<3; j++)
                    sum.x[i][j] = (sum.x[i][j]+x[i][k]*P.x[k][j]%mod)%mod;
        return sum;
    }
}ans, ini, uni;
mtx Pow(mtx tmp, ll num)
{
    mtx sum;
    for(sum=uni; num; num>>=1, tmp=tmp*tmp){
        if(num & 1)
            sum = sum * tmp;
    }
    return sum;
}
void init(ll C, ll D, ll X)
{
    memset(ini.x, 0, sizeof(ini.x));
    ini.x[1][0] = C;
    ini.x[1][1] = D;
    ini.x[1][2] = X;
    ini.x[0][1] = 1;
    ini.x[2][2] = 1;
}
void show(mtx _m)
{
    for(int i=0; i<3; i++){
        for(int j=0; j<3; j++){
            printf("%lld ", _m.x[i][j]);
        }printf("\n");
    }
}
int main()
{
    for(int i=0; i<3; i++) uni.x[i][i] = 1;
    scanf("%d", &t);
    while(t --){
        memset(ini.x, 0, sizeof(ini.x));
        memset(ans.x, 0, sizeof(ans.x));
        scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &d, &p, &n);
        if(n < 3){
            if(n == 1) printf("%lld\n", a);
            else printf("%lld\n", b);
        }
        else if(n < p){
            ans.x[0][0] = a;
            ans.x[1][0] = b;
            ans.x[2][0] = 1;
            for(ll i=3; i<=n; i=p/(p/i)+1){
                init(c, d, p/i);
                if(n <= p/(p/i)) ini = Pow(ini, n-i+1);
                else ini = Pow(ini, p/(p/i)-i+1);
                ans = ini*ans;
            }
            printf("%lld\n", ans.x[1][0]);
        }
        else if(n >= p){
            ans.x[0][0] = a;
            ans.x[1][0] = b;
            ans.x[2][0] = 1;
            for(ll i=3; i<=p; i=p/(p/i)+1){
                init(c, d, p/i);
                ini = Pow(ini, p/(p/i)-i+1);
                ans = ini*ans;
            }
            init(c, d, 0);
            ini = Pow(ini, n-max(p, 2ll));
            ans = ini*ans;
            printf("%lld\n", ans.x[1][0]);
        }
    }
    return 0;
}