Codeforces Round #698 (Div. 2) 1478

最新推荐文章于 2024-07-16 11:49:50 发布

夜朔辰

最新推荐文章于 2024-07-16 11:49:50 发布

阅读量77

点赞数

分类专栏：随笔

本文链接：https://blog.csdn.net/northsky0307/article/details/113529698

版权

随笔专栏收录该内容

54 篇文章 0 订阅

订阅专栏

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 3e5 + 7;
int t, n;
int a[maxn];
int cnt[maxn];
int ans;
int main()
{
    scanf("%d", &t);
    while(t --)
    {
        scanf("%d", &n);
        ans = 0;
        for(int i = 0; i <= n; i ++)
            cnt[i] = 0;
        for(int i = 0; i <n; i ++)
        {
            scanf("%d", &a[i]);
            cnt[a[i]] ++;
            ans = max(ans, cnt[a[i]]);
        }
        printf("%d\n", ans);
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 3e5 + 7;
int t, q, d;
int x;
int w[maxn];
int main()
{
    scanf("%d", &t);
    while(t --)
    {
        scanf("%d%d", &q, &d);
        for(int i = 0; i <= d * 1000; i ++)
            w[i] = 0;
        w[0] = 1;
        for(int i = 1; i <= d * 100; i ++)
        {
            for(int j = 0; j <= 10; j ++)
            {
                if(i >= d + j * 10)
                {
                    w[i] = max(w[i - d - j * 10], w[i]);
                }
                if(i >= d * 10 + j)
                {
                    w[i] = max(w[i - d  * 10 - j], w[i]);
                }
            }
            //cout<<i<<" "<<w[i]<<endl;

        }
        w[0] = 0;

        int flag;
        for(int i = 0; i < q; i ++)
        {
            scanf("%d", &x);
            flag = 0;
            if(x > d * 100)
            {
                int tem = x - d * 100;
                x -= tem / d * d;
                while(x > d * 100)
                    x -= d;
            }
            flag = w[x];

            if(flag)
                printf("YES\n");
            else
                printf("NO\n");
        }

    }
    return 0;
}
// 1 10 4 71

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 3e5 + 7;
int t, n;
ll a[maxn];
ll b[maxn];
ll pre[maxn];
int flag;
ll ans , tem;
int main()
{
    scanf("%d", &t);
    while(t --)
    {
        scanf("%d", &n);
        flag = 1;
        for(int i = 0; i < 2 * n; i ++)
        {
            scanf("%lld", &a[i]);
        }
        sort(a, a + 2 * n);
        for(int i = 0; i < n; i ++)
        {
            if(a[i * 2] == a[i * 2 + 1])
                b[i] = a[i * 2];
            else
                flag = 0;
            pre[i] = 0;
        }
        for(int i = 1; i < n; i ++)
        {
            tem = (b[i] - b[i - 1]) / i / 2;
            if ( tem * 2 * i != (b[i] - b[i - 1]))
                flag = 0;
            pre[i] = tem;

            if(tem == 0)
                flag = 0;
        }
        ans = 0;
        tem = 0;
        for(int i = 1; i < n; i ++)
        {
            ans += (tem + pre[i]) * 2;
            tem += pre[i];
        }
        a[0] -= ans ;
        if(a[0]<= 0)
            flag = 0;
        if(a[0] % (2 * n))
            flag = 0;
        if(flag)
                printf("YES\n");
        else
                printf("NO\n");

    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 3e5 + 7;
int t, n;
ll k, x[maxn];
int flag;
vector <ll> ans;
ll a[maxn];
int main()
{

    scanf("%d", &t);
    while(t --)
    {

        scanf("%d%lld", &n, &k);
        flag = 0;
        ans.clear();
        for(int i = 0; i < n; i ++)
        {
            scanf("%lld", &x[i]);
            if(x[i] == k)
                flag = 1;
            ans.pb(k - x[i]);
        }
        sort(x, x + n);
        ll g = 0;
        for(int i = 1; i < n; i ++)
        {
            a[i] = x[i] - x[i - 1];
            g = __gcd(g, abs(a[i]) );
        }
        for(auto tt : ans)
        {
            if(tt % g == 0)
                flag = 1;
        }


        if(flag)
                printf("YES\n");
            else
                printf("NO\n");
    }

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 2e5 + 7;
int tree[maxn << 2];
int lazy[maxn << 2];
int t, n, q;
int val[maxn];
void pushup(int p)
{
    tree[p] = tree[p << 1] + tree[(p << 1) + 1];
}
void build(int p, int l, int r)
{
    lazy[p] = -1;
    if(l == r)
    {
        tree[p] = val[l];
        return ;
    }
    int mid = l + r >> 1;
    build(p << 1, l, mid);
    build((p << 1) + 1, mid + 1, r);
    pushup(p);
}
void pushdown(int p, int l, int r)
{
    if(lazy[p] == -1)
        return ;
    int mid = l + r >> 1;
    lazy[p << 1] = lazy[p];
    tree[p << 1] = lazy[p] * (mid - l + 1);
    lazy[(p << 1) + 1] = lazy[p];
    tree[(p << 1) + 1] = lazy[p] * (r - mid - 1 + 1);
    lazy[p] = -1;
}
void update(ll p, ll nl, ll nr, ll l, ll r, ll val)
{
    if(nl <= l && r <= nr)
    {
        tree[p] = val * (r - l + 1); //sum
        lazy[p] = val; //update lazy
        return ;
    }
    pushdown(p, l, r);
    ll mid = l + r >> 1;
    if(nl <= mid)
        update(p << 1, nl, nr, l, mid, val);
    if(nr > mid)
        update((p << 1) + 1, nl, nr, mid + 1, r, val);
    pushup(p);
}
ll query(ll p, ll nl, ll nr, ll l, ll r)
{
    ll res = 0;
    if(nl <= l && r <= nr)
    {
        return tree[p];
    }
    ll mid = l + r >> 1;
    pushdown(p, l, r);
    if(nl <= mid)
        res += query(p << 1, nl, nr, l, mid);
    if(nr > mid)
        res += query((p << 1) + 1, nl, nr, mid + 1, r);
    return res;
}
int ans[maxn];
char s[maxn];
int x[maxn], y[maxn];
int ok[maxn];
int main()
{
    scanf("%d", &t);
    for(int kkk = 0; kkk < t; kkk ++)
    {
        scanf("%d%d", &n, &q);
        scanf("%s", s);
        for(int i = 1; i <= n; i ++)
            ans[i] = s[i - 1] - '0';
        scanf("%s", s);
        for(int i = 1; i <= n; i ++)
            val[i] = s[i - 1] - '0';
        build(1, 1, n);
        for(int i = 0; i <= n; i ++)
            ok[i] = 0;
        for(int i = 0; i < q; i ++)
        {
            scanf("%d%d", &x[i], &y[i]);
            ok[x[i]] ++;
            ok[y[i] + 1] --;
        }
        for(int i = 1; i <= n; i ++)
        {
            ok[i] += ok[i - 1];
        }
        bool flag = 1;
        for(int i = q - 1; i >= 0; i --)
        {
            int len = y[i] - x[i];
            int tt = query(1, x[i], y[i], 1, n);
            if(tt <= (len) / 2)
                update(1, x[i], y[i], 1, n, 0);
            else
            {
                tt = len + 1 - tt;
                if(tt <= (len) / 2)
                {
                    update(1, x[i], y[i], 1, n, 1);
                }
                else
                    flag = 0;
            }
        }
        for(int i = 1; i <= n; i ++)
        {
            if(query(1, i, i, 1, n) != ans[i] && ok[i] != 0)flag = 0;
        }


        if(flag)
            printf("YES\n");
        else
            printf("NO\n");

    }

    return 0;
}
/*
1
10000000
10000000
2 2
2 2
3 3
7 8
6 7
8 8
7 8
3 5
6 6
*/

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 5e3 + 7;
int n;
ll x[maxn], y[maxn];
ll dis[maxn][maxn];
int vis[maxn];

int main()
{
    scanf("%d", &n);

    for(int i = 0; i < n; i ++)
        scanf("%lld%lld", &x[i], &y[i]);
    for(int i = 0; i < n; i ++)
    {
        vis[i] = 0;
        for(int j = 0; j < n; j ++)
        {
            dis[i][j] = (x[i] - x[j]) * (x[i] - x[j])
            + (y[i] - y[j]) * (y[i] - y[j]);
        }
    }
    int ind = 0;
    int tem;
    ll l;
    vis[0] = 1;
    printf("1");
    //cout<<dis[1][2]<<endl;
    for(int i = 1; i < n; i ++)
    {
        l = 0;
        for(int j = 0; j < n; j ++)
        {
            //cout<<vis[j]<<endl;
            if(!vis[j] && dis[ind][j] > l)
            {
                l = dis[ind][j];
                tem = j;
            }
        }
        ind = tem;
        vis[ind] = 1;
        printf(" %d", ind + 1);
    }
    return 0;
}

夜朔辰

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Codeforces Round #698 (Div. 2) 1478

A:#include<bits/stdc++.h>using namespace std;#define pii pair<int,int>#define ll long long#define mp make_pair#define pb push_back#define mt(a,val) memset(a,val,sizeof(a))const int mod = 998244353;const int inf = 0x3f3f3f3f;const ll I
复制链接

扫一扫

专栏目录