Gym 102028
A - Xu Xiake in Henan Province
题意
t组查询,每组给出4个数,代表去过4个地方,如果4个数都是0,输出Typically Otaku
,如果有3个0,输出Eye-opener
,如果有2个0,输出Young Traveller
,如果有1个0,输出Excellent Traveller
,如果没有0,输出Contemporary Xu Xiake
。
思路
水题,直接模拟
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int M = 5e3 + 10;
using namespace std;
void solve(){;
int n;
cin>>n;
for(int i=1; i<=n; i++) {
int pos=0;
for(int j=1; j<=4; j++) {
int k;
cin>>k;
if(k)
pos++;
}
if(pos==0) puts("Typically Otaku");
else if(pos==1) puts("Eye-opener");
else if(pos==2) puts("Young Traveller");
else if(pos==3) puts("Excellent Traveller");
else if(pos==4) puts("Contemporary Xu Xiake");;
}
}
int main()
{
solve();
return 0;
}
D - Keiichi Tsuchiya the Drift King
题意
给出宽为a,长为b的车,有一条半径为r,角度为d的拐弯轨道,让你求出轨道的宽度,满足尽可能的小
思路(搬大佬的图,自己写不太清楚)
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int M = 5e3 + 10;
using namespace std;
void solve(){;
double a,b,r,d;
int t;
cin>>t;
while(t--){
cin>>a>>b>>r>>d;
double maxn=sqrt((r+a)*(r+a)+b*b);
double dang=d*PI/180;
double ang= atan(b/(a+r));
if(dang>ang) printf("%.12f\n",maxn-r);
else{
double ans=maxn*cos(ang-dang)-r;
printf("%.12f\n",ans);
}
}
}
int main()
{
solve();
return 0;
}
E - Resistors in Parallel
题意
给出一个n,在n里面的ri如上图定义,求找出一个ri,ri的所有因子分之一的和最大。输出的是和的倒数。
思路
分子即使连续的素数乘积,分母是分子的全部因子之和(公式)。
答案
import math
def judge(k):
for i in range(2, int(math.sqrt(k)+1)):
if k % i == 0:
return False
return True
prime = []
for i in range(2,301):
if judge(i) == True:
prime.append(i)
dp = []
dp.append([1,1])
key=[1,1]
for i in prime:
u=key[0]
v=key[1]
x=u*i
y = v * (i + 1)
g=math.gcd(int(x),int(y))
key=[x//g,y//g]
dp.append(key)
n=int(input())
for i in range(0,n):
k=int(input())
pos = -1
temp = 1
while temp*prime[pos+1]<=k:
temp*=prime[pos+1]
pos+=1
print(int(dp[pos+1][0]),end='')
print('/',end='')
print(int(dp[pos+1][1]))
F - Honeycomb
题意
给一个蜂巢图,问从s到t最短路径长是多少
思路(补题)
-
不用对地图进行抽象转换,直接在原图上走迷宫:每个格子相邻的有六个格子,所以每步能走六个方向,把六个方向的坐标看好。
-
不要用vis[][]记录走过与否,memset会超时,直接在原图上标记!
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int M = 1e3 + 10;
using namespace std;
char s[M*5][M*7];
int len[M*5];
struct node{
int x,y,step;
};
int dir[6][2]={-2,-6,-4,0,-2,6,4,0,2,-6,2,6};
void solve(){
int t;
cin>>t;
while(t--){
int r,c,x,y;
cin>>r>>c;
getchar();//
for(int i=0;i<4*r+3;++i){
gets(s[i]);//
len[i]=strlen(s[i]);
for(int j=0;j<len[i];++j){
if(s[i][j]=='S'){
x=i;
y=j;
break;
}
}
}
queue<node>q;
int ans=-1;
q.push({x,y,1});
while(!q.empty()&&ans==-1){
auto e=q.front();
if(s[e.x][e.y]=='T'){
ans=e.step;
break;
}
q.pop();
for(int i=0;i<6;++i){
int nx=e.x+dir[i][0],ny=e.y+dir[i][1];
if(nx>=0&&ny>=0&&nx<4*r+3&&ny<len[nx]&&s[nx][ny]!='*'&&s[(e.x+nx)/2][(e.y+ny)/2]!='-'&&s[(e.x+nx)/2][(e.y+ny)/2]!='/'&&s[(e.x+nx)/2][(e.y+ny)/2]!='\\'){
if(s[nx][ny]=='T') {ans=e.step+1;break;}
s[nx][ny]='*';
q.push({nx,ny,e.step+1});
}
}
}
cout<<ans<<endl;
}
}
int main()
{
solve();
return 0;
}
I - Distance
题意
给出n个点间的距离,依次求出取1~n个点所取点的最大距离
思路
每次先左后右依此取点即可得到最大距离,取奇数个点的距离贡献等于上一个点,偶数个等于上一个点的贡献加上两点间的距离。
答案
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
#define ll long long
#define mem(f,x) memset(f,x,sizeof(f));
#define sca(x) scanf("%d",&x);
#define scl(x) scanf("%lld",&x);
#define sca2(x,y) scanf("%d %d",&x,&y);
#define sca3(x,y,z) scanf("%d %d %d",&x,&y,&z);
#define pu puts("");
#define pri(x) printf("%d\n",x);
#define mp make_pair
#define pb push_back
void solve() {
ll arr[100020];
ll n,m,t;
scl(t);
while(t--){
scl(n);
arr[0]=0;
scl(arr[1]);
for(int i=2;i<=n-1;i++){
scl(arr[i]);
arr[i]+=arr[i-1];
}
ll ans=0;
ll key=0;
for(int i=1;i<=n;i++){
if(i%2==0){
ans+=arr[n-i/2]-arr[i/2-1];
}
key+=ans;
if(i==1) printf("%lld",key);
else printf(" %lld",key);
}
pu;
}
}
int main() {
solve();
return 0;
}