【AtCoder】AGC001

時間 2019-12-14

標籤 AtCoder agc001 agc 简体版

原文原文鏈接

AGC001

A - BBQ Easy

從第\(2n - 1\)個隔一個加一下加到1便可node

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
#define MOD 99994711
#define ba 47
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
    if(c == '-') f = -1;
    c = getchar();
    }
    while(c >= '0' && c <= '9') {
    res = res * 10 +c - '0';
    c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
    out(x / 10);
    }
    putchar('0' + x % 10);
}
int N;
int a[205];
void Solve() {
    read(N);
    for(int i = 1 ; i <= 2 * N ; ++i) read(a[i]);
    sort(a + 1,a + 2 * N + 1);
    int ans = 0;
    for(int i = 2 * N - 1 ; i >= 1 ; i -= 2) {
    ans += a[i];
    }
    out(ans);enter;
}

int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

B - Mysterious Light

在拐第二次的時候，設\(A = N - x,B = x\)c++

若是\(B\)小就交換A和Bide

這個時候至關於用A在B上走，每走A的長度用掉兩個Aui

最後一次回到原點時會少走一個A距離spa

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
#define MOD 99994711
#define ba 47
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
    if(c == '-') f = -1;
    c = getchar();
    }
    while(c >= '0' && c <= '9') {
    res = res * 10 +c - '0';
    c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
    out(x / 10);
    }
    putchar('0' + x % 10);
}
int64 N,X;
void Solve() {
    read(N);read(X);
    int64 ans = N;
    int64 A = X,B = N - X;
    while(A && B) {
    if(B < A) swap(A,B);
    ans += (B / A) * A * 2;
    int64 t = B % A;
    if(t == 0) ans -= A;
    B = A;A = t;
    }
    out(ans);enter;
}

int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

C - Shorten Diameter

枚舉中心點使得直徑不大於某個偶數code

枚舉兩個相鄰點做爲奇數直徑的兩個中心，使得直徑不大於某個奇數排序

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 2005
#define MOD 99994711
#define ba 47
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
    if(c == '-') f = -1;
    c = getchar();
    }
    while(c >= '0' && c <= '9') {
    res = res * 10 +c - '0';
    c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
    out(x / 10);
    }
    putchar('0' + x % 10);
}
struct node {
    int to,next;
}E[MAXN * 2];
int N,sumE,head[MAXN],dep[MAXN],K,fa[MAXN],ans,cnt[MAXN];
vector<pii > Ed;
void add(int u,int v) {
    E[++sumE].to = v;
    E[sumE].next = head[u];
    head[u] = sumE;
}
void dfs(int u) {
    cnt[dep[u]]++;
    for(int i = head[u] ; i ; i = E[i].next) {
        int v = E[i].to;
        if(v != fa[u]) {
            fa[v] = u;
            dep[v] = dep[u] + 1;
            dfs(v);
        }
    }
}
void Solve() {
    read(N);read(K);
    int a,b;
    for(int i = 1 ; i < N ; ++i) {
        read(a);read(b);
        add(a,b);add(b,a);
        Ed.pb(mp(a,b));
    }
    int ans = N;
    for(int i = 1 ; i <= N ; ++i) {
        int u = i;
        fa[u] = 0;dep[u] = 0;
        memset(cnt,0,sizeof(cnt));
        dfs(u);
        int res = 0;
        for(int j = K / 2 + 1 ; j <= N ; ++j) res += cnt[j];
        ans = min(ans,res);
    }
    if(K % 2 == 0) --K;
    for(auto t : Ed) {
        fa[t.fi] = t.se;fa[t.se] = t.fi;dep[t.fi] = dep[t.se] = 0;
        memset(cnt,0,sizeof(cnt));
        dfs(t.fi);dfs(t.se);
        int res = 0;
        for(int i = K / 2 + 1 ; i <= N ; ++i) res += cnt[i];
        ans = min(ans,res);
    }
    out(ans);enter;
}

int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

D - Arrays and Palindrome

硬核構造。。。get

奇數段只能放在最前或最後，若是超過兩個就不合法it

不然構造出第一段-1，第2到M-1段同樣，第M段+1的b便可io

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 2005
#define MOD 99994711
#define ba 47
//define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
    if(c == '-') f = -1;
    c = getchar();
    }
    while(c >= '0' && c <= '9') {
    res = res * 10 +c - '0';
    c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
    out(x / 10);
    }
    putchar('0' + x % 10);
}
int N,M;
int a[105];
vector<int> v,ans[2];
void Solve() {
    read(N);read(M);
    for(int i = 1 ; i <= M ; ++i) read(a[i]);
    for(int i = 1 ; i <= M ; ++i) {
    if(a[i] & 1) v.pb(a[i]);
    }
    if(v.size() > 2) {puts("Impossible");return;}
    if(v.size()) {
    int t = v.back();
    ans[0].pb(t);
    v.pop_back();
    }
    for(int i = 1 ; i <= M ; ++i) {
    if(a[i] % 2 == 0) {
        ans[0].pb(a[i]);
    }
    }
    if(v.size()) {
    int t = v.back();
    ans[0].pb(t);
    v.pop_back();
    }
    
    for(int i = 0 ; i < ans[0].size() ; ++i) {
    if(i == 0) {
        if(ans[0][i] != 1) ans[1].pb(ans[0][i] - 1);
    }
    else if(i == ans[0].size() - 1){
        ans[1].pb(ans[0][i] + 1);
    }
    else ans[1].pb(ans[0][i]);
    }
    if(ans[0].size() == 1) ans[1].pb(1);
    for(auto t : ans[0]) {
    out(t);space;
    
    }
    enter;
    out(ans[1].size());enter;
    for(auto t : ans[1]) {
    out(t);space;
    }
    enter;
}

int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

E - BBQ Hard

實際上就是匹配兩個點就是從\((-A_{i},-B_{i})\)走到\((A_{j},B_{j})\)

咱們把全部\((-A_{i},-B_{i})\)設成1，而後dp到全部\((A_{i},A_{i})\)的方案數

最後去重只要減掉本身到本身的方案數再除二便可

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
#define ba 47
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
    if(c == '-') f = -1;
    c = getchar();
    }
    while(c >= '0' && c <= '9') {
    res = res * 10 +c - '0';
    c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
    out(x / 10);
    }
    putchar('0' + x % 10);
}
const int MOD = 1000000007;
int N,V = 2000;
int A[MAXN],B[MAXN],dp[4005][4005];
int fac[100005],invfac[100005];
int inc(int a,int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}
int mul(int a,int b) {
    return 1LL * a * b % MOD;
}
void update(int &x,int y) {
    x = inc(x,y);
}
int C(int n,int m) {
    if(n < m) return 0;
    return mul(fac[n],mul(invfac[m],invfac[n - m]));
}
int fpow(int x,int c) {
    int res = 1,t = x;
    while(c) {
    if(c & 1) res = mul(res,t);
    t = mul(t,t);
    c >>= 1;
    }
    return res;
}
void Solve() {
    read(N);
    for(int i = 1 ; i <= N ; ++i) {read(A[i]);read(B[i]);dp[V - A[i]][V - B[i]]++;}
    fac[0] = 1;
    for(int i = 1 ; i <= 100000 ; ++i) fac[i] = mul(fac[i - 1],i);
    invfac[100000] = fpow(fac[100000],MOD - 2);
    for(int i = 99999 ; i >= 0 ; --i) invfac[i] = mul(invfac[i + 1],i + 1);
    for(int i = 0 ; i <= 2 * V ; ++i) {
    for(int j = 0 ; j <= 2 * V ; ++j) {
        if(!dp[i][j]) continue;
        update(dp[i + 1][j],dp[i][j]);
        update(dp[i][j + 1],dp[i][j]);
    }
    }
    int ans = 0;
    for(int i = 1 ; i <= N ; ++i) {
    update(ans,dp[V + A[i]][V + B[i]]);
    update(ans,MOD - C(2 * (A[i] + B[i]),2 * A[i]));
    }
    ans = mul(ans,(MOD + 1) / 2);
    out(ans);enter;
}

int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

F - Wide Swap

建出一個反排列使得\(q_{p_{i}} = i\)

咱們就是儘量的把1往前移，而後再把2儘量的往前移

這個反排列至關於交換相鄰的兩個數，而後要求這相臨兩個數差值大於等於K

而某一個數在它以前且差值小於K的，是沒法被越過的

這個關係有傳遞性，咱們只須要在排在這個數後面的數中，小於這個數差值不小於K的連一個最近的，大於這個數差值不小於K連一個最近的，表示這個數必須在這些數的前面

這樣的話每次取一個最小值作拓撲排序便可

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 500005
#define ba 47
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
    if(c == '-') f = -1;
    c = getchar();
    }
    while(c >= '0' && c <= '9') {
    res = res * 10 +c - '0';
    c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
    out(x / 10);
    }
    putchar('0' + x % 10);
}
int N,K,q[MAXN],deg[MAXN],ans[MAXN];
vector<int> to[MAXN];
struct node {
    int v,l,r;
}tr[MAXN * 4];
void update(int u) {
    tr[u].v = min(tr[u << 1].v,tr[u << 1 | 1].v);
}
void build(int u,int l,int r) {
    tr[u].l = l;tr[u].r = r;tr[u].v = N + 1;
    if(l == r) return; 
    int mid = (l + r) >> 1;
    build(u << 1,l,mid);
    build(u << 1 | 1,mid + 1,r);
    update(u);
}
void add(int u,int x,int v) {
    if(tr[u].l == tr[u].r) {tr[u].v = v;return;}
    int mid = (tr[u].l + tr[u].r) >> 1;
    if(x <= mid) add(u << 1,x,v);
    else add(u << 1 | 1,x,v);
    update(u);
}
int Query(int u,int l,int r) {
    l = max(l,1);r = min(r,N);
    if(r < l) return N + 1;
    if(l == tr[u].l && r == tr[u].r) return tr[u].v;
    int mid = (tr[u].l + tr[u].r) >> 1;
    if(r <= mid) return Query(u << 1,l,r);
    else if(l > mid) return Query(u << 1 | 1,l,r);
    else return min(Query(u << 1,l,mid),Query(u << 1 | 1,mid + 1,r));
}
set<int> S;
void Solve() {
    read(N);read(K);
    int a = 0;
    build(1,1,N);
    for(int i = 1 ; i <= N ; ++i) {
    read(a);q[a] = i;
    }
    for(int i = N ; i >= 1 ; --i) {
    int r = Query(1,q[i] + 1,q[i] + K - 1);
    if(r != N + 1) {
        to[q[i]].pb(q[r]);
        ++deg[q[r]];
    }
    int l = Query(1,q[i] - K + 1,q[i] - 1);
    if(l != N + 1) {
        to[q[i]].pb(q[l]);
        ++deg[q[l]];
    }
    add(1,q[i],i);
    }
    for(int i = 1 ; i <= N ; ++i) {
    if(!deg[i]) S.insert(i);
    }
    int cnt = 0;
    while(S.size()) {
    int u =  *S.begin();
    S.erase(S.begin());
    ans[u] = ++cnt;
    for(auto v : to[u]) {
        if(!(--deg[v])) {
        S.insert(v);
        }
    }
    }
    for(int i = 1 ; i <= N ; ++i) {
    out(ans[i]);enter;
    }
}

int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

相關標籤/搜索

atcoder

每日一句

每一个你不满意的现在，都有一个你没有努力的曾经。