2019 ICPC Asia Taipei Hsinchu Regional Contest

前期天胡开局各种1A，然后被弱智E题卡到集体降智。后面的题也太难了8

7题滚了，过于真实

---

A：

solver：zyh

#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
struct board {
    int arr[6][6];
    board() {
        memset(arr, 0, sizeof(arr));
    }
};
//EW:1 NS:2
int towards[11];
int len[11];
struct state {
    int x[11];
    int y[11];
    bool operator==(const state &b)const {
        for (int i = 1; i <= 10; ++i) if (x[i] != b.x[i] || y[i] != b.y[i]) return false;
        return true;
    }
};
struct myHash {
    size_t operator()(state State) const {
        size_t hash = 0;
        for (int i = 1; i <= 10; ++i) {
            hash = hash * 7 + size_t(State.x[i]);
            hash = hash * 7 + size_t(State.y[i]);
        }
        return hash;
    }
};
board st;
state st_state;
queue< pair<int, state> > que;
unordered_set<state, myHash> Set;
board generateBoard(state State) {
    board rnt;
    for (int i = 1; i <= 10; ++i)
        if (towards[i] > 0) {
            int dx = 0, dy = 0;
            int x = State.x[i];
            int y = State.y[i];
            if (towards[i] == 1) dy = 1;
            else dx = 1;
            for (int j = 0; j < len[i]; ++j) {
                rnt.arr[x][y] = i;
                x += dx; y += dy;
            }
        }
    return rnt;
}
void output(int s, state State) {
    //return;
    cout << "s=" << s << endl;
    board Board = generateBoard(State);
    for (int i = 0; i < 6; ++i) {
        for (int j = 0; j < 6; ++j) cout << Board.arr[i][j] << ' ';
        cout << endl;
    }
    system("pause");
}
int bfs() {
    que.push(pair<int, state>(0, st_state));
    Set.insert(st_state);
    while (!que.empty()) {
        auto tmp = que.front();
        int nows = tmp.first;
        state nowstate = tmp.second;
        que.pop();
        if (nows == 10) continue;
        board nowboard = generateBoard(nowstate);
        for (int i = 1; i <= 10; ++i) {
            //positive
            if (towards[i] == 0) continue;
            state tmpstate = nowstate;
            int dx = 0, dy = 0;
            if (towards[i] == 1) dy = 1;
            else dx = 1;
            for (int j = 1; j <= 1; ++j) {
                //positive
                if (nowstate.x[i] + dx * (len[i] + j - 1) < 6 &&
                        nowstate.y[i] + dy * (len[i] + j - 1) < 6 &&
                        nowboard.arr[nowstate.x[i] + dx * (len[i] + j - 1)][nowstate.y[i] + dy * (len[i] + j - 1)] == 0) {
                    tmpstate.x[i] = nowstate.x[i] + dx * j;
                    tmpstate.y[i] = nowstate.y[i] + dy * j;
                    if (Set.find(tmpstate) == Set.end()) {
                        if (tmpstate.y[1] + len[1] - 1 == 5) {
                            //output(nows+1,tmpstate);
                            if (nows + 1 + len[1] <= 10) return nows + 1 + len[1];
                            return -1;
                        }
                        //output(nows+1,tmpstate);
                        que.push(pair<int, state>(nows + 1, tmpstate));
                        Set.insert(tmpstate);
                    }
                } else break;
            }
            for (int j = 1; j <= 1; ++j) {
                if (nowstate.x[i] - dx * j >= 0 &&
                        nowstate.y[i] - dy * j >= 0 &&
                        nowboard.arr[nowstate.x[i] - dx * j][nowstate.y[i] - dy * j] == 0) {
                    tmpstate.x[i] = nowstate.x[i] - dx * j;
                    tmpstate.y[i] = nowstate.y[i] - dy * j;
                    if (Set.find(tmpstate) == Set.end()) {
                        if (tmpstate.y[1] + len[1] - 1 == 5) {
                            //output(nows+1,tmpstate);
                            if (nows + 1 + len[1] <= 10) return nows + 1 + len[1];
                            return -1;
                        }
                        //output(nows+1,tmpstate);

                        que.push(pair<int, state>(nows + 1, tmpstate));
                        Set.insert(tmpstate);
                    }
                } else break;
            }
        }
    }
    return -1;
}
int main() {
    for (int i = 0; i < 6; ++i)
        for (int j = 0; j < 6; ++j) scanf("%d", &st.arr[i][j]);
    for (int i = 0; i < 6; ++i)
        for (int j = 0; j < 6; ++j)
            if (st.arr[i][j] > 0) {
                int t = st.arr[i][j];
                if (towards[t] > 0) continue;
                st_state.x[t] = i;
                st_state.y[t] = j;
                int dx = 0, dy = 0;
                if (j + 1 < 6 && st.arr[i][j + 1] == t) {
                    towards[t] = 1;
                    dy = 1;
                } else {
                    towards[t] = 2;
                    dx = 1;
                }
                int x = i, y = j;
                len[t] = 0;
                while (st.arr[x][y] == t) {
                    len[t]++;
                    x += dx; y += dy;
                }
            }
    if (st_state.x[1] != 2 || towards[1] != 1) {
        printf("-1\n");
        return 0;
    }
    printf("%d", bfs());
}

B：

完全没看的神仙题

C：

solver：lzh

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define ff first
#define ss second

int a[100];
int main() {
    int n; scanf("%d", &n);
    for (int i = 1; i <= n; i++)scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
                if (i != j && i != k && j != k) {
                    if (abs(a[i] - a[j]) % a[k] != 0) {
                        printf("no\n"); return 0;
                    }
                }
    printf("yes\n");
}

D：

solver：lzh

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define ff first
#define ss second

char s[100];
char a[] = {" bubble"}, b[] = {" tapioka"};
int main() {
    int output = 0;
    while (~scanf("%s", s + 1)) {
        int n = strlen(s + 1);
        if (n == 6) {
            for (int i = 1; i <= 6; i++)if (a[i] != s[i]) {
                    printf("%s ", s + 1); output++; break;
                }
        } else if (n == 7) {
            for (int i = 1; i <= 7; i++)if (b[i] != s[i]) {
                    printf("%s ", s + 1); output++; break;
                }
        } else {
            printf("%s ", s + 1); output++;
        }
    }
    if (!output)printf("nothing\n");
}

E：

solver：czq

想了好久才醒悟到有sb做法

/* basic header */
#include <bits/stdc++.h>
/* define */
#define ll long long
#define dou double
#define pb emplace_back
#define mp make_pair
#define sot(a,b) sort(a+1,a+1+b)
#define rep1(i,a,b) for(int i=a;i<=b;++i)
#define rep0(i,a,b) for(int i=a;i<b;++i)
#define eps 1e-8
#define int_inf 0x3f3f3f3f
#define ll_inf 0x7f7f7f7f7f7f7f7f
#define lson (curpos<<1)
#define rson (curpos<<1|1)
/* namespace */
using namespace std;
/* header end */

const int maxn = 1999, lim = 1e6;
ll a[maxn], k, l;

int main() {
    int t; scanf("%d", &t);
    while (t--) {
        scanf("%lld%lld", &k, &l);
        if (l > maxn) {
            puts("-1");
            continue;
        }
        a[0] = -1;
        ll tmp = k + maxn;
        for (int i = 1; i < maxn - 1; i++) {
            a[i] = min(tmp, (ll)lim);
            tmp -= a[i];
        }
        a[maxn - 1] = tmp;
        printf("%d\n%lld", maxn, a[0]);
        for (int i = 1; i < maxn; i++) printf(" %lld", a[i]);
        puts("");
    }
    return 0;
}

H：

solver：lzh、zyh

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define ff first
#define ss second

int main() {
    int t; scanf("%d", &t);
    while (t--) {
        ll n; scanf("%lld", &n);
        ll x = (1ll * n * (n + 1)) ^ (n + 1);
        printf("%lld\n", x);
    }
}

I：

完全没看的神仙题

J：

solver：lzh、zyh

#include <bits/stdc++.h>
using namespace std;
bitset<500> number[30];
char str[1001];
int main(){
    int T;
    scanf("%d",&T);
    while (T--){
        int n,m;
        scanf("%d%d",&n,&m);
        for (int i=0;i<m;++i){
            scanf("%s",str);
            number[i]=bitset<500>(str);
        }
        int len=1<<m;
        int ans=m+1;
        
        for (int i=1;i<len;++i){
            int t=i;
            int s=0;
            bitset<500> now(0);
            for (int j=0;j<m && t>0;++j){
                if (t&1){ now=now|number[j]; s++;}
                t>>=1;
            }
            if (now.count()==n) ans=min(ans,s);
        }
        if (ans==m+1) printf("-1\n");
        else printf("%d\n",ans);
    }
}

K：

solver：zyh、czq

#include <bits/stdc++.h>
using namespace std;
priority_queue< int,vector<int>,greater<int> > que;
int main(){
    int T;
    scanf("%d",&T);
    while (T--){
        int n;
        scanf("%d",&n);
        que=priority_queue<int,vector<int>,greater<int>>();
        for (int i=0;i<n;++i){
            int t;
            scanf("%d",&t);
            que.push(t);
        }
        int ans=0;
        while (que.size()>1){
            int f1=que.top();
            que.pop();
            int f2=que.top();
            que.pop();
            ans+=f1+f2;
            que.push(f1+f2);
        }
        printf("%d\n",ans);
    }
}

L：

想得头皮发麻……这里给个500ms过的std

#include<cstdio>
#include<algorithm>
#include<bitset>
using namespace std;

struct Point {
    long long x, y;
    int num;
    bool operator <(const Point &p)const {
        return x != p.x ? x < p.x : y < p.y;
    }
    Point operator -(const Point &p)const {
        return { x - p.x, y - p.y };
    }
    Point Rotate() {
        return { -y, x };
    }
} w[4400], P[4400], st[4400];
long long Z[4400];
int n;

long long Mul(Point a, Point b) {
    return a.x * b.x + a.y * b.y;
}

long long getArea(Point a, Point b, Point c) {
    return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
}

void Solve() {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%lld%lld", &w[i].x, &w[i].y);
    }
    // 按x和y排序
    sort(w, w + n);
    for (int i = 0; i < n; i++) w[i].num = i; // 给点编号
    int cnt = 0, top = 0;
    // 求凸包？
    for (int i = 0; i < n; i++) {
        while (top > 1 && getArea(st[top - 1], st[top], w[i]) <= 0) top--;
        st[++top] = w[i];
    }
    for (int i = 1; i < top; i++) P[cnt++] = st[i];
    top = 0;
    for (int i = 0; i < n; i++) {
        while (top > 1 && getArea(st[top - 1], st[top], w[i]) >= 0)top--;
        st[++top] = w[i];
    }
    for (int i = top; i > 1; i--) P[cnt++] = st[i];
    if (cnt <= 2) {
        puts("0");
        return;
    }
    long long res = 0;
    for (int i = 0; i < cnt; i++) {
        Point V1 = P[(i + 1) % cnt] - P[i];
        Point V2 = V1.Rotate();
        long long Mx2 = -5e18;
        for (int j = 0; j < cnt; j++) {
            long long t = Mul(V2, P[j]);
            Z[j] = t;
            if (Mx2 < t)Mx2 = t;
        }
        for (int j = 0; j < cnt; j++) {
            if (Z[j] == Mx2) {
                Point VV = (P[j] - P[i]).Rotate();
                long long Mn = 5e18, Mx = -5e18;
                for (int k = 0; k < n; k++) {
                    if (k == P[i].num || k == P[j].num)continue;
                    long long t = Mul(VV, w[k]);
                    if (Mn > t)Mn = t;
                    if (Mx < t)Mx = t;
                }
                res = max(res, Mx - Mn);
            }
        }
    }
    if (res % 2)printf("%lld.5\n", res / 2);
    else printf("%lld\n", res / 2);
}

int main() {
    int TC;
    scanf("%d", &TC);
    while (TC--) {
        Solve();
    }
}

M：

贴个zzy大佬的代码

#include<iostream>
#include<vector>
#include<cmath>
#include<unordered_map>
using namespace std;
#define ll long long

ll M, N, mod, p[100], tot, num[100], cnt[100], ap[100], P[16000010], mu[16000010], cntt;
bool vis[16000010];
vector<int> factor;
unordered_map<ll, ll> mp2;
ll fuck_dp[16000010];

ll mypow(ll a, ll b) {
    ll ret = 1;
    while (b) {
        if (b & 1)ret = ret * a % mod;
        a = a * a % mod; b >>= 1;
    }
    return ret;
}

void init() {
    mu[1] = 1;
    for (int i = 2; i < 16000010; i++) {
        if (!vis[i])P[cntt++] = i, mu[i] = -1;
        for (int j = 0; j < cntt && P[j]*i < 16000010; j++) {

            int now = P[j] * i;
            vis[now] = 1;
            if (i % P[j] == 0) {
                mu[now] = 0;
                break;
            } else mu[now] = -mu[i];
        }
    }
}

void exgcd(ll a, ll b, ll &x, ll &y) {
    if (b == 0)x = 1, y = 0;
    else {
        exgcd(b, a % b, y, x);
        y -= a / b * x;
    }
}

ll inv(ll a) {
    ll x, y;
    exgcd(a, mod, x, y);
    return x < 0 ? x + mod : x;
}

void fuck_init() {
    fuck_dp[0] = 1;
    for (int i = 1; i <= mod; i++) {
        int tmp = i;
        for (int i = 1; i <= tot; i++) {
            if (tmp % p[i] == 0) {
                tmp = 1;
                break;
            }
        }
        fuck_dp[i] = fuck_dp[i - 1] * tmp % mod;
    }
}

inline ll calcu(int n) {
    return fuck_dp[n];
}

ll calcu2(ll n) {
    if (n == 0)return 1;
    if (mp2[n])return mp2[n];
    ll ret = mypow(calcu(mod - 1), n / mod) * calcu(n % mod) % mod;
    for (auto &it : factor) {

        ll tmp = calcu2(n / it);
        ret = ret * (mu[it] == 0 ? 1 : (mu[it] == -1 ? tmp : inv(tmp))) % mod;
    }
    return mp2[n] = ret;
}

ll calcu3(ll n, ll x) {
    ll ret = 0, base = x;
    while (x <= n) {
        ret += n / x;
        if (x > n / base)break;
        x *= base;
    }
    return ret;
}

int main() {
    init();
    cin >> M >> N >> mod;
    int D = mod;
    for (int i = 2; i * i <= D; i++) {
        if (D % i == 0) {
            int tmp = 0;
            while (D % i == 0) {
                tmp++;
                D /= i;
            }
            p[++tot] = i;
            num[tot] = tmp;
        }
    }
    if (D >= 2) {
        p[++tot] = D;
        num[tot] = 1;
    }
    for (int i = 2; i <= mod; i++) if (mod % i == 0) factor.push_back(i);
    fuck_init();
    ll ans = calcu2(M);
    ll ans2 = calcu2(N);
    ll ans3 = calcu2(M - N);
    for (int i = 1; i < mod; i++) {
        if (ans2 * i % mod == 1) ans = ans * i % mod;
        if (ans3 * i % mod == 1) ans = ans * i % mod;
    }
    ll minn = 9e18;
    for (int i = 1; i <= tot; i++) {
        cnt[i] += calcu3(M, p[i]);
        cnt[i] -= calcu3(N, p[i]) + calcu3(M - N, p[i]);
        ap[i] = cnt[i] / num[i];
        minn = min(minn, ap[i]);
    }
    for (int i = 1; i <= tot; i++) cnt[i] -= minn * num[i];
    ll anss = 1;
    for (int i = 1; i <= tot; i++) anss = anss * mypow(p[i], cnt[i]) % mod;
    cout << ans *anss % mod << endl;
}