CCSU2023暑期结训测试赛(三)

---

前言

心态要好，不要急，毕竟急了也没用

G-跑步运动

#解题思路：暴力循环查找是否有边满足eij>=eik+ejk即说明可被替换,若满足则进行标记，最终标记的数量就是答案(当初写的时候一看见是图论就撒丫子跑路了，连数据范围都没看，还是不该太着急)

#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ll Mod = 1e9 + 7;
const ll mod9 = 998244353;
const ll Max = 1e5 + 7;
const ll MAX = 1e3 + 100;
const ll N = 2e5 + 10;
const ll inf = 1e12 + 100;
const double pi=acos(-1.0);
const double E  = exp(1);
const double eps=1e-8;
//char buf[1<<20],*p1,*p2;
#define nl "\n"
#define fir first
#define sec second
//#define re register
//#define int ll
//#define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define setbits1(x, n, m) (x) | ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define setbits0(x, n, m) (x) & ~((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define getbits(x, n, m) (x) & ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define get_reverse_bits(x, n, m) (x) ^ ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
#pragma comment (linker,"/STACK:102400000,102400000")
using namespace std;

inline ll read(){
    ll x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch>'9'){
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9'){
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}

template<typename I,typename L,I mod> struct Modint {
    I v;
    I pow(L b) const {
        L res=1,a=v;
        while(b) { if(b&1) res=res*a%mod; b>>=1; a=a*a%mod; }
        return res;
    }
    I inv() const { return pow(mod-2); }

    Modint &operator+=(const Modint &x) { v+=x.v; v-=v>=mod?mod:0; return *this; }
    Modint &operator-=(const Modint &x) { v-=x.v; v+=v<0?mod:0; return *this; }
    Modint &operator*=(const Modint &x) { v=L(1)*v*x.v%mod; return *this; }
    Modint &operator/=(const Modint &x) { v=L(1)*v*x.inv()%mod; return *this; }

    friend Modint operator+(Modint l,const Modint &r) { return l+=r; }
    friend Modint operator-(Modint l,const Modint &r) { return l-=r; }
    friend Modint operator*(Modint l,const Modint &r) { return l*=r; }
    friend Modint operator/(Modint l,const Modint &r) { return l/=r; }

    Modint operator++(int) { auto res=*this; *this+=1; return res; }
    Modint operator--(int) { auto res=*this; *this-=1; return res; }
    Modint operator-  () { return *this*-1; }
    Modint &operator++() { return *this+=1; }
    Modint &operator--() { return *this-=1; }

    bool operator< (const Modint &x) const { return v< x.v; }
    bool operator> (const Modint &x) const { return v> x.v; }
    bool operator<=(const Modint &x) const { return v<=x.v; }
    bool operator>=(const Modint &x) const { return v>=x.v; }
    bool operator==(const Modint &x) const { return v==x.v; }
    bool operator!=(const Modint &x) const { return v!=x.v; }

    friend istream &operator>>(istream &is,Modint &x) { is>>x.v; x=Modint(x.v); return is; }
    friend ostream &operator<<(ostream &os,const Modint &x) { return os<<x.v; }

    Modint(L x=0): v((x%=mod)<0?x+mod:x) {}
    static_assert(0ULL+mod+mod-2<1ULL<<(sizeof(I)*8-1), "Modint overflow");
    static_assert(1ULL*(mod-1)*(mod-1)<1ULL<<(sizeof(L)*8-1), "Modint overflow");
};
using mint=Modint<int,long long,Mod>;
char arr[1000][1000];
ll dp[N][2],cntn[26],dt[N];
ll suma[Max],sumb[Max],sum[N];
int to[N];
string s;
char chs[27];
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
const int dxn[8] = { -1,-2,-2,-1,1,2,2,1 };
const int dyn[8] = { 2,1,-1,-2,2,1,-1,-2 };
ll e[MAX][MAX];
//mp<pii,int>mp;
ll n,m,k;

struct node{
    ll x,y,z;
};

bool check(int x,int y,int z){
    return z!=x&&z!=y;
}

void solved(){
    int i,j;
}

int main() {
    ios;
    //cout << fixed;
    //cout.precision(18);
    //cout.flush();
    int i, j;
    ll T,u,v,w,t,g,h,t1,t2,p,q,op,mx,mn,x,y,z,l,r,mid,pos,now,idx,dis,len,all,ave,cnt,cur,last,sumn,other;
    string str,s1,s2,s3,te1,te2,sf,sk;
    char ch,ch1,ch2;
    bool flag,f1,f2,f3,cle;
    suma[0]=0;sumb[0]=0;sum[0]=0;
    T=1;
    //cin>>T;
    while(T--) {
        //solved();
        cin>>n>>m;
        //memset(e,inf,sizeof(e));
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                e[i][j]=inf;
        map<pii,int>vis;
        vector<node>ve(m+1);
        cnt=0;
        for(i=1;i<=m;i++){
            cin>>x>>y>>z;
            ve[i]={x,y,z};
            e[x][y]=e[y][x]=z;
        }
        
        for(k=1;k<=n;k++){
            for(i=1;i<=n;i++){
                for(j=1;j<=n;j++){
                    if(e[i][j]>=e[i][k]+e[k][j]){
                        vis[{i,j}]=1;
                        e[i][j]=e[i][k]+e[k][j];
                    }
                }
            }
        }
        
        /*for(auto [x,y]:ve){
            
        }
        cout<<m-cnt<<nl;*/
        
        for(i=1;i<=m;i++){
            if(vis[{ve[i].x,ve[i].y}])
                cnt++;
        }
        cout<<cnt<<nl;
    }

    //system("pause");
    return 0;
}

H-中位数？

#解题思路：打表找规律，假如k是奇数，先将ans全部填充k/2+1,后将序列向前提ceil((n-1)/2.0),若k是偶数，则开端为k/2，其余都是k(一个打表题，比赛的时候表打出来了，规律找到了，但时间要没了，奇数的部分要怎么解决还是没想好)

#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ll Mod = 1e9 + 7;
const ll mod9 = 998244353;
const ll Max = 1e5 + 7;
const ll MAX = 2e5 + 100;
const ll N = 2e5 + 10;
const ll inf = 1e12 + 100;
const double pi=acos(-1.0);
const double E  = exp(1);
const double eps=1e-8;
//char buf[1<<20],*p1,*p2;
#define nl "\n"
#define fir first
#define sec second
//#define re register
//#define int ll
//#define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define setbits1(x, n, m) (x) | ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define setbits0(x, n, m) (x) & ~((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define getbits(x, n, m) (x) & ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define get_reverse_bits(x, n, m) (x) ^ ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
#pragma comment (linker,"/STACK:102400000,102400000")
using namespace std;

inline ll read(){
    ll x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch>'9'){
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9'){
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}

template<typename I,typename L,I mod> struct Modint {
    I v;
    I pow(L b) const {
        L res=1,a=v;
        while(b) { if(b&1) res=res*a%mod; b>>=1; a=a*a%mod; }
        return res;
    }
    I inv() const { return pow(mod-2); }

    Modint &operator+=(const Modint &x) { v+=x.v; v-=v>=mod?mod:0; return *this; }
    Modint &operator-=(const Modint &x) { v-=x.v; v+=v<0?mod:0; return *this; }
    Modint &operator*=(const Modint &x) { v=L(1)*v*x.v%mod; return *this; }
    Modint &operator/=(const Modint &x) { v=L(1)*v*x.inv()%mod; return *this; }

    friend Modint operator+(Modint l,const Modint &r) { return l+=r; }
    friend Modint operator-(Modint l,const Modint &r) { return l-=r; }
    friend Modint operator*(Modint l,const Modint &r) { return l*=r; }
    friend Modint operator/(Modint l,const Modint &r) { return l/=r; }

    Modint operator++(int) { auto res=*this; *this+=1; return res; }
    Modint operator--(int) { auto res=*this; *this-=1; return res; }
    Modint operator-  () { return *this*-1; }
    Modint &operator++() { return *this+=1; }
    Modint &operator--() { return *this-=1; }

    bool operator< (const Modint &x) const { return v< x.v; }
    bool operator> (const Modint &x) const { return v> x.v; }
    bool operator<=(const Modint &x) const { return v<=x.v; }
    bool operator>=(const Modint &x) const { return v>=x.v; }
    bool operator==(const Modint &x) const { return v==x.v; }
    bool operator!=(const Modint &x) const { return v!=x.v; }

    friend istream &operator>>(istream &is,Modint &x) { is>>x.v; x=Modint(x.v); return is; }
    friend ostream &operator<<(ostream &os,const Modint &x) { return os<<x.v; }

    Modint(L x=0): v((x%=mod)<0?x+mod:x) {}
    static_assert(0ULL+mod+mod-2<1ULL<<(sizeof(I)*8-1), "Modint overflow");
    static_assert(1ULL*(mod-1)*(mod-1)<1ULL<<(sizeof(L)*8-1), "Modint overflow");
};
using mint=Modint<int,long long,Mod>;
char arr[1000][1000];
ll dp[N][2],cntn[26],dt[N];
ll suma[Max],sumb[Max],sum[N];
int to[N];
string s;
char chs[27];
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
const int dxn[8] = { -1,-2,-2,-1,1,2,2,1 };
const int dyn[8] = { 2,1,-1,-2,2,1,-1,-2 };
vector<int>e[N];
//mp<pii,int>mp;
ll n,m,k;

bool check(int x,int y){
    return x>=1&&x<=n&&y>=1&&y<=m;
}

void solved(){
    int i,j;
}

//vector<vector<int>>ans;
/*void dfs(int id,vector<int>vt){
    if(id>=n)
        return;
    ans.push_back(vt);
    for(int i=1;i<=k;i++){
        vector<int>t(vt.begin(),vt.end());
        t.push_back(i);
        dfs(id+1,t);
    }
}*/

int main() {
    ios;
    //cout << fixed;
    //cout.precision(18);
    //cout.flush();
    int i, j;
    ll T,u,v,w,t,g,h,t1,t2,p,q,op,mx,mn,x,y,z,l,r,mid,pos,now,idx,dis,len,all,ave,cnt,cur,last,sumn,other;
    string str,s1,s2,s3,te1,te2,sf,sk;
    char ch,ch1,ch2;
    bool flag,f1,f2,f3,cle;
    suma[0]=0;sumb[0]=0;sum[0]=0;
    T=1;
    //cin>>T;
    while(T--) {
        //solved();
        cin>>n>>k;
        
        if(k==1){
            for(i=1;i<=n/2+1;i++)
                cout<<1<<" ";
            continue;
        }
        
        //此处为打表
        /*for(i=1;i<=k;i++){
            vector<int>a;
            a.push_back(i);
            dfs(1,a);
        }
        sort(ans.begin(),ans.end());
        for(auto vt:ans){
            for(auto it:vt)
                cout<<it<<" ";
            cout<<nl;
        }*/
        
        vector<int>ans;
        if(k&1){
            x=k/2+1;cnt=0;
            m=ceil((n-1)/2.0);
            if(n==1)
                ans.push_back(k/2+1);
            else{
                for(i=1;i<=n;i++)
                    ans.push_back(k/2+1);
                //ans.push_back(1);
                pos=ans.size()-1;
                while(m--){
                    if(ans.back()==1){//最后为1，可直接排出去
                        cnt++;
                        ans.pop_back();
                    }
                    else{
                        ans.back()--;
                        for(i=1;i<=cnt;i++)//派出去的数量
                            ans.push_back(k);
                        cnt=0;
                    }
                }
            }
        }
        else{
            ans.push_back(k/2);
            for(i=1;i<n;i++)
                ans.push_back(k);
        }
        
        for(auto it:ans)
            cout<<it<<" ";
    }

    //system("pause");
    return 0;
}

I-仙跳墙

#解题思路：01背包题，设立dp[N][N][N],并标记不被允许的顺序以维护dp，对dp进行初始化后，进行枚举以求得最大值(01背包题，当初我第一个看的题好像就是这个，但先去写签到了，但三维的我好像是没写过多少，唉)

#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ll Mod = 1e9 + 7;
const ll mod9 = 998244353;
const ll Max = 1e5 + 7;
const ll MAX = 2e5 + 100;
const ll N = 2e5 + 10;
const ll inf = 1e12 + 100;
const double pi=acos(-1.0);
const double E  = exp(1);
const double eps=1e-8;
//char buf[1<<20],*p1,*p2;
#define nl "\n"
#define fir first
#define sec second
//#define re register
//#define int ll
//#define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf,1,1<<20,stdin), p1 == p2) ? 0 : *p1++)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define setbits1(x, n, m) (x) | ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define setbits0(x, n, m) (x) & ~((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define getbits(x, n, m) (x) & ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define get_reverse_bits(x, n, m) (x) ^ ((~(0U)<<(sizeof(x)-(m-n+1)))>>n)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
#pragma comment (linker,"/STACK:102400000,102400000")
using namespace std;

inline ll read(){
    ll x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch>'9'){
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9'){
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}

template<typename I,typename L,I mod> struct Modint {
    I v;
    I pow(L b) const {
        L res=1,a=v;
        while(b) { if(b&1) res=res*a%mod; b>>=1; a=a*a%mod; }
        return res;
    }
    I inv() const { return pow(mod-2); }

    Modint &operator+=(const Modint &x) { v+=x.v; v-=v>=mod?mod:0; return *this; }
    Modint &operator-=(const Modint &x) { v-=x.v; v+=v<0?mod:0; return *this; }
    Modint &operator*=(const Modint &x) { v=L(1)*v*x.v%mod; return *this; }
    Modint &operator/=(const Modint &x) { v=L(1)*v*x.inv()%mod; return *this; }

    friend Modint operator+(Modint l,const Modint &r) { return l+=r; }
    friend Modint operator-(Modint l,const Modint &r) { return l-=r; }
    friend Modint operator*(Modint l,const Modint &r) { return l*=r; }
    friend Modint operator/(Modint l,const Modint &r) { return l/=r; }

    Modint operator++(int) { auto res=*this; *this+=1; return res; }
    Modint operator--(int) { auto res=*this; *this-=1; return res; }
    Modint operator-  () { return *this*-1; }
    Modint &operator++() { return *this+=1; }
    Modint &operator--() { return *this-=1; }

    bool operator< (const Modint &x) const { return v< x.v; }
    bool operator> (const Modint &x) const { return v> x.v; }
    bool operator<=(const Modint &x) const { return v<=x.v; }
    bool operator>=(const Modint &x) const { return v>=x.v; }
    bool operator==(const Modint &x) const { return v==x.v; }
    bool operator!=(const Modint &x) const { return v!=x.v; }

    friend istream &operator>>(istream &is,Modint &x) { is>>x.v; x=Modint(x.v); return is; }
    friend ostream &operator<<(ostream &os,const Modint &x) { return os<<x.v; }

    Modint(L x=0): v((x%=mod)<0?x+mod:x) {}
    static_assert(0ULL+mod+mod-2<1ULL<<(sizeof(I)*8-1), "Modint overflow");
    static_assert(1ULL*(mod-1)*(mod-1)<1ULL<<(sizeof(L)*8-1), "Modint overflow");
};
using mint=Modint<int,long long,Mod>;
char arr[1000][1000];
ll dp[150][150][150],cntn[26],dt[N];
ll suma[Max],sumb[Max],sum[N];
int to[N];
string s;
char chs[27];
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
const int dxn[8] = { -1,-2,-2,-1,1,2,2,1 };
const int dyn[8] = { 2,1,-1,-2,2,1,-1,-2 };
vector<int>e[N];
//mp<pii,int>mp;
int n,m,k;

bool check(int x,int y){
    return x>=1&&x<=n&&y>=1&&y<=m;
}

struct node{
    int val,need;
};

struct checks{
    int x,y,z;
};

void solved(){
    int i,j;
}

int main() {
    ios;
    //cout << fixed;
    //cout.precision(18);
    //cout.flush();
    int i, j;
    int T,u,v,w,t,g,h,t1,t2,p,q,op,mx,mn,x,y,z,l,r,mid,pos,now,idx,dis,len,all,ave,cnt,cur,last,sumn,other;
    string str,s1,s2,s3,te1,te2,sf,sk;
    char ch,ch1,ch2;
    bool flag,f1,f2,f3,cle;
    suma[0]=0;sumb[0]=0;sum[0]=0;
    T=1;
    //cin>>T;
    while(T--) {
        //solved();
        cin>>n>>t>>m;
        vector<node>ve(n+1);
        map<array<int,3>,bool>vis;
        ll ans=0;
        for(i=1;i<=n;i++)
            cin>>ve[i].val>>ve[i].need;
        for(i=1;i<=m;i++){
            cin>>x>>y>>z;
            vis[{x,y,z}]=true;
        }

        for(i=1;i<=n;i++){//初始化
            for(j=t;j>=ve[i].need;j--)
                dp[j][0][i]=ve[i].val;
            ans=max(ans,1ll*ve[i].val);
        }

        for(i=0;i<=n;i++){
            for(j=i+1;j<=n;j++){
                for(k=j+1;k<=n;k++){//必须是从小到大
                    if(vis[{i,j,k}])//是被标记的顺序
                        continue;
                    for(p=t;p>=ve[k].need;p--){
                        dp[p][j][k]=max(dp[p][j][k],dp[p-ve[k].need][i][j]+ve[k].val);//维护最后两种物品即可
                        ans=max(ans,dp[p][j][k]);
                    }
                }
            }
        }
        cout<<ans;
    }

    //system("pause");
    return 0;
}