Codeforces Round #528 (Div. 2, based on Technocup 2019 Elimination Round 4)
A. Right-Left Cipher
题意:将一个原串s,一左一右地添加到一个新串上。给出新串t,求原串s
思路:拿两个指针从中间位置往走,一边走一遍添加就好了
#include <bits/stdc++.h>
#define ll long long
using namespace std;
string s;
int main()
{
cin>>s;
s="0"+s;
int n=s.size()-1;
int p1=(n+1)/2,p2=p1+1;
string ans;
int now=1;
while(p1>=1||p2<=n)
{
if(now)
ans.push_back(s[p1--]);
else
ans.push_back(s[p2++]);
now^=1;
}
cout<<ans<<endl;
return 0;
}
B. Div Times Mod
题意:给定n、k,求最小的x,满足
(
x
/
k
)
×
(
x
%
k
)
=
n
(x/k)\times(x\%k)=n
(x/k)×(x%k)=n
思路:遍历n的所有因子就可以了,符合余数小于k的取最小值就可以了
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll x,n,k;
int main()
{
ll ans=1e18;
scanf("%lld%lld",&n,&k);
for(int i=1;i*i<=n;++i)
{
if(n%i==0)
{
if(n/i<k)
ans=min(ans,i*k+n/i);
if(n/(n/i)<k)
ans=min(ans,n/i*k+n/(n/i));
}
}
printf("%lld\n",ans);
return 0;
}
C. Connect Three
题意:矩阵上有3个点,砍最少的树木,连接这三个点
思路:暴力模拟即可,按x轴排完序之后,一种就8种情况。先横着走,在直走,再横着走。
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
struct Point
{
int x,y;
bool operator<(const Point & b)const
{
if(x!=b.x)
return x<b.x;
if(y!=b.y)
return y<b.y;
}
}p[4];
int main()
{
for(int i=1;i<=3;++i)
scanf("%d%d",&p[i].x,&p[i].y);
sort(p+1,p+4);
vector<pii> ans;
for(int i=p[1].x;i<=p[2].x;++i)
ans.push_back({i,p[1].y});
if(p[1].y>p[2].y)
{
for(int i=p[2].y;i<=p[1].y;++i)
ans.push_back({p[2].x,i});
}
else
{
for(int i=p[1].y;i<=p[2].y;++i)
ans.push_back({p[2].x,i});
}
if(p[2].y>p[3].y)
{
for(int i=p[3].y;i<=p[2].y;++i)
ans.push_back({p[2].x,i});
}
else
{
for(int i=p[2].y;i<=p[3].y;++i)
ans.push_back({p[2].x,i});
}
for(int i=p[2].x;i<=p[3].x;++i)
ans.push_back({i,p[3].y});
sort(ans.begin(),ans.end());
ans.resize(unique(ans.begin(),ans.end())-ans.begin());
printf("%d\n",(int)ans.size());
for(auto i : ans)
{
printf("%d %d\n",i.first,i.second);
}
return 0;
}
同样的思路,别人的短代码
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(X) begin(X), end(X)
vector<vector<int>>dp,s;
vector<pair<int,int>>ans;
signed main(){
int ax,ay,bx,by,cx,cy;
cin >> ax >> ay >> bx >> by >> cx >> cy;
if(ax>bx)swap(ax,bx),swap(ay,by);
if(bx>cx)swap(bx,cx),swap(by,cy);
if(ax>bx)swap(ax,bx),swap(ay,by);
for(int i = min({ay,by,cy}); i <= max({ay,by,cy}); i++)
ans.pb({bx,i});
for(int i = ax; i < bx; i++)
ans.pb({i,ay});
for(int i = bx+1; i <= cx; i++)
ans.pb({i,cy});
cout << ans.size() << endl;
for(auto i:ans)cout << i.ff << " " << i.ss << endl;
}
D. Minimum Diameter Tree
题意:给定权值s,分配到一张图的每一边上,求最小的最大直径
思路:s平均分配到与叶节点相连的边上就可以了,因此统计一下叶节点的个数即可。
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int maxn=1e5+10;
int main()
{
int n,s,a,b;
cin>>n>>s;
vector<int> adj[maxn];
for(int i=1;i<=n-1;++i)
{
cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
int cnt=0;
for(int i=1;i<=n;++i)
if(adj[i].size()==1)
cnt++;
printf("%.10lf\n",s*2.0/cnt);
return 0;
}