The 19th Zhejiang Provincial Collegiate Programming Contest

https://codeforces.com/gym/103687

A. JB Loves Math

题意：有T组数据，a,b，你可以选择让a + 正奇数x 或让a - 正偶数y,问最少多少次可以让a变成b

思路 : 当a<b时如果a-b是一个偶数并且这个数除于2后是一个偶数数则需要3次比如（2,6）

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 200005
//#define int long long
int mod = 998244353;
using namespace std;
int main() {
    int T; scanf("%d", &T);
    while (T--){
        int a, b, d; scanf("%d%d", &a, &b);
        d = a - b;
        if (d == 0) {
            printf("0\n");
        }
        else {
            if (d > 0) {
                if (d % 2 == 0) {
                    printf("1\n");
                }
                else {
                    printf("2\n");
                }
            }
            else {
                if (d % 2) {
                    printf("1\n");
                }
                else if (d / 2 % 2) {
                    printf("2\n");
                }
                else
                    printf("3\n");
            }
        }
    }
}

 

B.JB Loves Comma

题意 ：在字符串后添加‘，’

思路：。。。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 200005
//#define int long long
int mod = 998244353;
using namespace std;
char s[N];
int main() {
    scanf("%s", s + 3);
    int len = strlen(s+3)+3;
    for (int i = 3; i <= len; i++) {
        if (s[i - 1] == 'b' && s[i - 2] == 'j' && s[i - 3] == 'c')
            printf(",");
        if(len!=i)
        printf("%c", s[i]);
    }
}

C. JB Wants to Earn Big Money 

 

 题意：统计a中大于等于x和b中小于等于x的个数

思路：。。。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 200005
//#define int long long
int mod = 998244353;
using namespace std;
int a[N];
int main() {
    int n, m, k; scanf("%d%d%d", &n,&m,&k);
    int ans = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        if (a[i] >= k)ans++;
    }
    for (int i = 0; i < m; i++) {
        scanf("%d", &a[i]);
        if (a[i] <= k)ans++;
    }
    printf("%d", ans);
}

G. Easy Glide 

题意：计算起点到终点的最短路径，给你n个加速点到达之后可以获得3秒v2的速度，给你起点，终点，还有v1,v2。

思路，计算起点到加速点的时间，和个加速点到个点的时间，跑一遍 dijkstra

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#include<unordered_map>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 2000005
#define int  long long
int mod = 998244353;
using namespace std;
int v1, v2; int n;
struct P {
    int x, y;
}; P p[N];
double dis[N];
double e[1005][1005]; bool mark[N];
double cal(P j, P k) {
    return sqrt((j.x - k.x) * (j.x - k.x) + (j.y - k.y) * (j.y - k.y));
}
void djtsl(int s)
{
    int k;
    for (int i = 0; i < n; i++)
        mark[i] = false;
    for (int i = 0; i < n; i++)
        dis[i] = e[s][i];
    mark[s] = true;
    dis[s] = 0;
    int min;
    for (int i = 1; i < n; i++)
    {
        min = Max;
        for (int j = 0; j < n; j++)
        {
            if (!mark[j] && dis[j] < min)
            {
                min = dis[j];
                k = j;
            }
        }
        mark[k] = true;
        for (int j = 0; j < n; j++)
        {
            if (!mark[j] && (dis[j] > dis[k] + e[k][j]))
                dis[j] = dis[k] + e[k][j];
        }
    }
}
signed main() {
    scanf("%lld", &n);
    for (int i = 1; i <= n; i++) {
        int x, y; scanf("%lld%lld", &x, &y);
        p[i].x = x, p[i].y = y;
    }
    n++;
    scanf("%lld%lld%lld%lld", &p[0].x, &p[0].y, &p[n].x, &p[n].y);
    n++;
    scanf("%lld%lld", &v1, &v2);
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < n; j++) {
            double d = cal(p[i], p[j]);
            if (i == 0) {
                e[i][j] = d / v1;
            }
            else
                if (d > 3 * v2)
                    e[i][j] = (d - 3 * v2) / v1 + 3;
                else {
                    e[i][j] = d / v2;
                }
        }
    }
    djtsl(0);
    printf("%.12lf", dis[n - 1]);
}

L. Candy Machine 

 

题意：选择一个集合，你可以拿走你选定集合中严格大于当前集合平均值的糖果，问最多可以拿多少个。

思路：最优解应该是升序的一个前缀,

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<set>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 2000005
#define int long long
int mod = 998244353;
using namespace std;
int a[N],sum[N];
signed main() {
    int n; scanf("%lld", &n);
    for (int i = 1; i <= n; i++)scanf("%lld", &a[i]);
    sort(a+1, a +1+ n);
    for (int i = 1; i <= n; i++) {
        sum[i] = sum[i - 1] + a[i];
    }
    int maxx = 0;
    for (int i = n ; i > 0; i--) {
        int ave = sum[i] / i;
        int idx = upper_bound(a + 1, a + i+1 , ave) - a;
        maxx = max(maxx, i - idx+1);
    }
    printf("%lld", maxx);
}