2017 Multi-University Training Contest
来源:互联网 发布:烈焰传奇翅膀进阶数据 编辑:程序博客网 时间:2024/06/05 10:16
第三场前夕,早上五点才睡,九点半被宿舍的施工吵醒,再也没能睡着。比赛打到一个半小时就开始昏昏欲睡了。加上第三场比赛本身很难,中途AC2题的时候可以从RANK50一直排到RANK300。这场比赛不光是对算法能力的考验,更是对实现算法能力的考验。罚时成了RANK取胜的关键因素。
1005
把1看成整棵树的根. 问题相当于把2∼n每个点一个[1,k]的标号. 然后根据最小斯坦纳树的定义, (x,fax) 这条边的贡献是 x 子树内不同标号的个数目difi. 那么显然有difi≤min(k,szi), szi表示子树大小. 可以通过构造让所有difi都取到最大值. 所以答案就是∑x=2nw[x][fax]∗min(szx,k)时间复杂度O(n).#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans;
struct node{
int v,w;
node(int _v,int _w){
v=_v;
w=_w;
}
};
vector<node> e[1000005];
int n,k;
int sz[1000005];
void dfs(int id,int fa,int ww){
sz[id]=1;
for (int i=0;i<e[id].size();i++){
int ep=e[id][i].v;
if (ep==fa) continue;
int w=e[id][i].w;
dfs(ep,id,w);
sz[id]+=sz[ep];
}
if (fa==0) return;
int tmp=min(sz[id],k);
ans+=(ll)tmp*ww;
}
int main(){
while(scanf("%d %d",&n,&k)!=EOF)
{
for (int i=1;i<=n;i++) e[i].clear();
memset(sz,0,sizeof(sz));
for (int i=1;i<n;i++){
int x,y,z;
scanf("%d %d %d",&x,&y,&z);
e[x].push_back(node(y,z));
e[y].push_back(node(x,z));
}
ans=0;
dfs(1,0,0);
printf("%lld\n",ans);
}
}
1008
注意到一个数字x必然会被唯一表示成a2×b的形式.其中∣μ(b)∣=1。 所以这个式子会把[1,nk]的每个整数恰好算一次. 所以答案就是nk,快速幂即可. 时间复杂度O(logk).#include<cstdio>
#include<iostream>
typedef long long ll;
const ll MOD=1e9+7;
ll power(ll n,ll k)
{
if (k==0)
{
return 1;
}
ll tmp = power(n,k/2);
if (k&1) return tmp*tmp%MOD*n%MOD;
return tmp*tmp%MOD;
}
int main()
{
ll n,k;
int t=1;
while (scanf("%lld %lld",&n,&k)!=EOF)
{
n%=MOD;
ll ans=power(n,k);
ans+=MOD;
ans%=MOD;
printf("Case #%d: %lld\n",t++,ans);
}
return 0;
}
1011
一个签到题,目的在于吐槽浙江的高温统计有多少数<=35即可。
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- PAT basic 1017
- 小数化分数2
- HBase分布式集群部署
- 监听有线/蓝牙耳机的插入与拔出,电话的状态及拦截-Android
- PAT basic 1018
- 2017 Multi-University Training Contest
- PAT basic 1019
- ftp两种传输方式区别
- hdu—6059
- 定义拒绝原因
- PAT basic 1020
- 有效的括号序列判断
- Matlab 使用最小二乘法拟合球面(待验证)
- PAT basic 1021