Codeforces Round #598 (Div. 3)

传送门

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    int q; scanf("%d",&q);
    while (q--) {
        ll a, b, n, S;
        scanf("%lld%lld%lld%lld",&a,&b,&n,&S);
        if (a*n + b < S) puts("NO");
        else if (a >= S/n) {
            if (S - S/n*n > b) puts("NO");
            else puts("YES");
        }
        else if (a < S/n) {
            if (S - a*n > b) puts("NO");
            else puts("YES");
        }
        else puts("YES");
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int a[maxn], n, q;
bool vis[maxn];
int find(int num) {
    for (int i = 1; i <= n; ++i) {
        if (a[i] == num) return i;
    }
}
int main() {
    scanf("%d",&q);
    while (q--) {
        memset(vis,false,sizeof(vis));
        scanf("%d",&n);
        for (int i = 1; i <= n; ++i) {
            scanf("%d",&a[i]);
        }
        for (int i = 1; i <= n; ++i) {
            int pos = find(i);
            for (int j = pos; j > i; --j) {
                if (vis[j-1] == true) break;
                if (a[j] > a[j-1]) break;
                vis[j-1] = true;
                swap(a[j-1],a[j]);
            }
        }
        printf("%d",a[1]);
        for (int i = 2; i <= n; ++i) {
            printf(" %d",a[i]);
        }
        putchar('\n');
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
const int maxn = 10005;
int a[maxn], c[maxn];
int n, m, d;
int main() {
    scanf("%d%d%d",&n,&m,&d);
    for (int i = 1; i <= m; ++i) {
        scanf("%d",&c[i]);
    }
    int pos = 0;
    for (int i = 1; i <= m; ++i) {
        pos = pos+d;
        /*
        for (int j = 0; j < c[i]; ++j) {
            a[pos+j] = i;
        }*/
        pos = pos+c[i]-1;
    }
    if (pos + d >= n+1) {
        puts("YES");
        int extra = pos+d-n-1;
        int pos = 0;
        for (int i = 1; i <= m; ++i) {
            if (extra == 0) pos = pos+d;
            else {
                if (extra >= d) pos += 1, extra -= d-1;
                else pos += d-extra, extra = 0;
            }
            for (int j = 0; j < c[i]; ++j) {
                a[pos+j] = i;
            }
            pos = pos+c[i]-1;
        }
        printf("%d",a[1]);
        for (int i = 2; i <= n; ++i) {
            printf(" %d",a[i]);
        }
        printf("\n");
    }
    else puts("NO");
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
char s[maxn];
int n, q;
ll k;
int main() {
    scanf("%d",&q);
    while (q--) {
        scanf("%d%lld",&n,&k);
        scanf("%s",s+1);
 
        int pos = 1;
        for (int i = 1; i <= n && k > 0; ++i) {
            if (s[i] == '1') continue;
            else {
                if (i == pos) {
                    pos++;
                    continue;
                }
                if (k >= i-pos) {
                    s[pos] = '0'; s[i] = '1';
                    k -= i-pos;
                    pos++;
                }
                else {
                    s[pos+i-pos-k] = '0'; s[i] = '1';
                    break;
                }
            }
            //printf("%s\n",s+1);
        }
        printf("%s\n",s+1);
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
const int inf = 0x3f3f3f3f;
pair<int,int> a[maxn];
int dp[maxn], p[maxn], t[maxn];
int main() {
    int n; scanf("%d",&n);
    for (int i = 0; i < n; ++i) {
        scanf("%d",&a[i].first);
        a[i].second = i; 
    }
    sort(a,a+n);
    fill(dp+1,dp+1+n,inf);
    fill(p+1,p+1+n,-1);
    for (int i = 0; i < n; ++i) {
        for (int j = 3; j <= 5 && i+j <= n; ++j) {
            int x = a[i+j-1].first - a[i].first;
            if (dp[i+j] > dp[i]+x) {
                p[i+j] = i;
                dp[i+j] = dp[i] + x;
            }
        }
    }
    int cnt = 1, pos = n;
    while (pos) {
        for (int i = pos-1; i >= p[pos]; --i) {
            t[a[i].second] = cnt;
        }
        cnt++;
        pos = p[pos];
    }
    printf("%d %d\n",dp[n],cnt-1);
    printf("%d",t[0]);
    for (int i = 1; i < n; ++i) {
        printf(" %d",t[i]);
    }
    printf("\n");
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
char s[maxn], t[maxn];
int mps[300], mpt[300];
int C[10005];
int lowbit(int x) {
    return x&(-x);
}
int sum(int x) {
    int ret = 0;
    while (x > 0) {
        ret += C[x]; x -= lowbit(x);
    }
    return ret;
}
void add(int x, int d) {
    while (x <= 1000) {
        C[x] += d; x += lowbit(x);
    }
}
int main() {
    int q; scanf("%d",&q);
    while (q--) {
        int n; scanf("%d",&n);
        scanf("%s%s",s+1,t+1);
        memset(mps,0,sizeof(mps));
        memset(mpt,0,sizeof(mpt));
        for (int i = 1; i <= n; ++i) {
            mps[s[i]]++, mpt[t[i]]++;
        }
        bool flag = true;
        for (char i = 'a'; i <= 'z'; ++i) {
            if (mps[i] != mpt[i]) flag = false;
        }
        if (flag == false) {
            puts("NO");
            continue;
        }
 
        memset(C,0,sizeof(C));
        ll ans1 = 0, ans2 = 0;
        for (int i = 1; i <= n; ++i) {
            ans1 += i-1 - sum(s[i]);
            add(s[i],1);
        }
        memset(C,0,sizeof(C));
        for (int i = 1; i <= n; ++i) {
            ans2 += i-1 - sum(t[i]);
            add(t[i],1);
        }
        //cout << ans1 << " " << ans2 << endl;
        if (ans1 % 2 == 1 && ans2 % 2 == 0) flag = false;
        else if (ans1 % 2 == 0 && ans2 % 2 == 1) flag = false;
 
        for (char i = 'a'; i <= 'z'; ++i) {
            if (mps[i] > 1) flag = true;
        }
 
        if (flag == true) puts("YES");
        else puts("NO");
    }
    return 0;
}