UFBA Practice Session for Brazilian ICPC Regionals 2018

差两题AK。

题目链接：https://codeforces.com/gym/101962

---

B：

solver：czq

/* basic header */
#include <bits/stdc++.h>
/* define */
#define ll long long
#define pb emplace_back
#define mp make_pair
#define eps 1e-8
#define lson (curpos<<1)
#define rson (curpos<<1|1)
/* namespace */
using namespace std;
/* header end */

const int maxn = 2e3 + 10;
char a[maxn], b[maxn];
int len1, len2, ans = 0;

int main() {
    scanf("%s%s", a, b);
    len1 = strlen(a), len2 = strlen(b);
    set<char>zero, one;
    zero.clear(), one.clear();
    for (int i = 0; i <= len1 - len2; i++) {
        zero.clear(), one.clear();
        for (int j = 0; j < len2; j++)
            if (b[j] == '1') one.insert(a[i + j]);
            else zero.insert(a[i + j]);
        if ((int)zero.size() > 1 || (int)one.size() > 1) {
            zero.clear(), one.clear();
            for (int j = 0; j < len2; j++)
                if (b[j] == '1') one.insert(a[len2 + i - 1 - j]);
                else zero.insert(a[len2 + i - 1 - j]);
            if ((int)zero.size() > 1 || (int)one.size() > 1) continue;
            else ans++;
        } else {
            ans++;
        }
    }
    printf("%d\n", ans);
    return 0;
}

C：

solver：lzh

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

ll mod = 1e9 + 7;
ll qp(ll base, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1)
            res = res * base % mod;
        base = base * base % mod;
        b >>= 1;
    }
    return res;
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        ll n;
        cin >> n;
        ll ans = ((n - 3) % mod * qp(2, n) % mod + (3 + n) % mod) % mod;
        cout << ans << "\n";
    }
}

D：

solver：lzh、czq

/* basic header */
#include <bits/stdc++.h>
/* define */
#define ll long long
#define pb emplace_back
#define mp make_pair
#define eps 1e-8
#define lson (curpos<<1)
#define rson (curpos<<1|1)
/* namespace */
using namespace std;
/* header end */

const int maxn = 2e3 + 10, maxm = 5e4 + 10;
int n, m, tot = 1, head[maxn], vis[maxn], cnt[maxn][maxn];
vector<pair<int, int>>e, ans;
struct Edge {
    int to, next;
} edge[maxm];

void add(int from, int to) {
    edge[++tot].to = to;
    edge[tot].next = head[from];
    head[from] = tot;
}

bool bfs(int s, int t) {
    for (int i = 0; i < maxn; i++) vis[i] = 0;
    vis[s] = 1;
    queue<int>q;
    while (!q.empty()) q.pop();
    q.push(s);
    while (!q.empty()) {
        int curr = q.front();
        q.pop();
        for (int i = head[curr]; i; i = edge[i].next) {
            int to = edge[i].to;
            if ((curr == s && to == t) || vis[to]) continue;
            q.push(to); vis[to] = 1;
            if (to == t) return false;
        }
    }
    return vis[t] ? false : true;
}

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        int x, y; scanf("%d%d", &x, &y);
        add(x, y); e.pb(mp(x, y)); cnt[x][y]++;
    }
    for (auto i : e) {
        if (cnt[i.first][i.second] > 1) continue;
        if (bfs(i.first, i.second)) ans.pb(i);
    }
    printf("%d\n", (int)ans.size());
    for (auto i : ans) printf("%d %d\n", i.first, i.second);
    return 0;
}

E：

solver：czq

/* basic header */
#include <bits/stdc++.h>
/* define */
#define ll long long
#define pb emplace_back
#define mp make_pair
#define eps 1e-8
#define lson (curpos<<1)
#define rson (curpos<<1|1)
/* namespace */
using namespace std;
/* header end */

vector<int>a;

int main() {
    int x;
    while (~scanf("%1d", &x)) a.pb(x);
    if ((int)a.size() == 1) return puts("YES"), 0;
    int firstOne = a[0], back = 0;
    for (int i = 1; i < (int)a.size(); i++) back ^= a[i];
    if (firstOne == back) puts("YES"); else puts("NO");
    return 0;
}

F：

solver：czq

/* basic header */
#include <bits/stdc++.h>
/* define */
#define ll long long
#define pb emplace_back
#define mp make_pair
#define eps 1e-8
#define lson (curpos<<1)
#define rson (curpos<<1|1)
/* namespace */
using namespace std;
/* header end */

const int maxn = 1e5 + 10;
int n, minSize, maxSize, a[maxn];
ll f[maxn];

void init() {
    for (int i = 0; i < maxn; i++) f[i] = 0;
}

void maintain(int l, int r) {
    if (l > r) return;
    f[l]++, f[r + 1]--;
}

bool check(int x) {
    init();
    f[1] = 1, f[2] = -1;
    queue<int>q;
    while (!q.empty()) q.pop();
    for (int i = 1; i <= n; i++) if (a[i] >= x) q.push(i);
    for (int i = 1; i <= n; i++) {
        f[i] += f[i - 1];
        while (!q.empty() && i > q.front()) q.pop();
        if (!f[i] || q.empty()) continue;
        if (i + maxSize - 1 < (int)q.front()) continue;
        maintain(max((int)q.front(), i + minSize - 1) + 1, min(n + 1, i + maxSize - 1 + 1));
    }
    f[n + 1] += f[n];
    return f[n + 1] > 0;
}

int main() {
    scanf("%d%d%d", &n, &minSize, &maxSize);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    int l = 0, r = INT_MAX, ans = 0;
    while (l <= r) {
        int mid = l + r >> 1;
        if (check(mid)) {
            ans = mid;
            l = mid + 1;
        } else r = mid - 1;
    }
    printf("%d\n", ans);
    return 0;
}

G：

solver：czq

/* basic header */
#include <bits/stdc++.h>
/* define */
#define ll long long
#define pb emplace_back
#define mp make_pair
#define eps 1e-8
#define lson (curpos<<1)
#define rson (curpos<<1|1)
/* namespace */
using namespace std;
/* header end */

const int maxn = 1e5 + 10;
const double pi = acos(-1);
struct Ship {
    int visiable;
    double beta;
    ll x, y;
} a[maxn];
int n;
double x, alpha, t, ans[maxn];
ll d;

void fix(double &x) {
    if (x < 0) x += 360;
    if (x >= 360) x -= 360;
}

int main() {
    scanf("%d%lf", &n, &x);
    scanf("%lf%lf%lld", &alpha, &t, &d);
    for (int i = 1; i <= n; i++) {
        scanf("%lld%lld", &a[i].x, &a[i].y);
        a[i].visiable = a[i].x * a[i].x + a[i].y * a[i].y <= d * d;
        a[i].beta = atan2(a[i].y, a[i].x) / pi * 180;
        fix(a[i].beta); a[i].beta += alpha / 2; fix(a[i].beta);
    }
    ll round = (ll)floor(x / t);
    double timePerRound = alpha / 360 * t, remainTime = x - round * t;
    for (int i = 1; i <= n; i++) {
        ans[i] = round * timePerRound;
        if (a[i].beta < alpha && round) ans[i] -= (alpha - a[i].beta) / alpha * timePerRound;
    }
    double minAlpha = remainTime / t * 360, maxAlpha = minAlpha + alpha;
    for (int i = 1; i <= n; i++) {
        if (a[i].beta < minAlpha) {
            ans[i] += timePerRound;
            if (a[i].beta < alpha && !round) ans[i] -= (alpha - a[i].beta) / alpha * timePerRound;
        } else if (a[i].beta < maxAlpha) {
            if (!round) ans[i] += (maxAlpha - alpha) / alpha * timePerRound;
            else ans[i] += (maxAlpha - a[i].beta) / alpha * timePerRound;
        }
        // 如果转过去还大于360
        if (maxAlpha > 360) {
            double remainMaxAlpha = maxAlpha - 360;
            if (a[i].beta < remainMaxAlpha) ans[i] += (remainMaxAlpha - a[i].beta) / alpha * timePerRound;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (!a[i].visiable) ans[i] = 0;
        printf("%.11f\n", ans[i]);
    }
    return 0;
}

H：

solver：lzh

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

int main() {
    int t;
    cin >> t;
    while (t--) {
        ll n;
        cin >> n;
        ll ans = 0;
        for (ll base = 2, j = 1, p = 1; base <= n; base <<= 1, j++, p <<= 1) {
            ans += n / base * j * p;
        }
        cout << ans << "\n";
    }
}

I：

solver：lzh

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

int val[100010 << 2], pre[100010];
void upd(int x, int curl, int curr, int l, int v) {
    if (l == curl && curr == curl) {
        val[x] = v;
        return;
    }

    int mid = curl + curr >> 1;
    if (l <= mid)
        upd(x << 1, curl, mid, l, v);
    else
        upd(x << 1 | 1, mid + 1, curr, l, v);

    val[x] = max(val[x << 1], val[x << 1 | 1]);
}
int que(int x, int curl, int curr, int l, int r) {
    if (l <= curl && curr <= r) {
        //printf("que %d %d %d\n", curl, curr, val[x]);
        return val[x];
    }

    int mid = curl + curr >> 1;
    if (r <= mid)
        return que(x << 1, curl, mid, l, r);
    else if (l > mid)
        return que(x << 1 | 1, mid + 1, curr, l, r);
    else
        return max(que(x << 1, curl, mid, l, mid),
                   que(x << 1 | 1, mid + 1, curr, mid + 1, r));
}

int main() {
    int n, q;
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; i++)
        scanf("%d", &pre[i]);
    for (int i = 1; i < n; i++)
        upd(1, 1, n - 1, i, abs(pre[i] - pre[i + 1]));
    while (q--) {
        int x, y, z;
        scanf("%d%d%d", &x, &y, &z);
        if (x == 1) {
            pre[y] = z;
            if (y != 1)
                upd(1, 1, n - 1, y - 1, abs(pre[y - 1] - pre[y]));
            if (y != n)
                upd(1, 1, n - 1, y, abs(pre[y] - pre[y + 1]));
        } else {
            int ans = 1;
            if (y != 1) {
                int l = 1, r = y - 1, tmp = y;
                while (l <= r) {
                    int mid = l + r >> 1;
                    if (que(1, 1, n - 1, mid, y - 1) <= z)
                        r = mid - 1, tmp = min(tmp, mid);
                    else
                        l = mid + 1;
                }
                ans += y - tmp;
            }
            if (y != n) {
                int l = y, r = n - 1, tmp = y - 1;
                while (l <= r) {
                    int mid = l + r >> 1;
                    if (que(1, 1, n - 1, y, mid) <= z)
                        l = mid + 1, tmp = max(tmp, mid);
                    else
                        r = mid - 1;
                }
                ans += tmp - y + 1;
            }
            printf("%d\n", ans);
        }
    }
}

J：

solver：czq

/* basic header */
#include <bits/stdc++.h>
/* define */
#define ll long long
#define pb emplace_back
#define mp make_pair
#define eps 1e-8
#define lson (curpos<<1)
#define rson (curpos<<1|1)
/* namespace */
using namespace std;
/* header end */

const int maxn = 1e5 + 10;
struct Street {
    int l, r;
} str[maxn];
int n, k, ans[maxn];
vector<int>boss[maxn];

/* 树上启发式合并 (CF 741D)----------------------------------------------------------- */
// 以下内容全抄
int fa[maxn], _size[maxn], remain;

void init() {
    for (int i = 0; i < maxn; i++) _size[i] = 1, fa[i] = i;
}

int findFa(int x) {
    return x == fa[x] ? x : (fa[x] = findFa(fa[x]));
}

void cleanInfo(int x) {
    fa[str[x].l] = str[x].l, fa[str[x].r] = str[x].r;
    for (int i : boss[x]) cleanInfo(i);
}

void merge(int x, int y) {
    int fx = findFa(x), fy = findFa(y);
    if (fx != fy) fa[fx] = fy, remain--;
}

void solve(int x) {
    merge(str[x].l, str[x].r);
    for (auto i : boss[x]) solve(i);
}

void dfs(int x) {
    int heavySon = -1;
    // 从最小的size开始处理
    for (auto i : boss[x]) if (_size[heavySon] < _size[i] || heavySon == -1) heavySon = i;
    for (auto i : boss[x]) {
        if (i == heavySon) continue;
        remain = k;
        dfs(i), cleanInfo(i); // dfs后不要忘记清除信息！
    }
    remain = k;
    if (heavySon != -1) dfs(heavySon);
    for (auto i : boss[x]) if (i != heavySon) solve(i);
    merge(str[x].l, str[x].r);
    ans[x] = remain;
}

/* ----------------------------------------------------------------------------------- */

int main() {
    init();
    scanf("%d%d", &n, &k);
    for (int i = 2; i <= n; i++) {
        int x; scanf("%d", &x);
        boss[x].pb(i);
    }
    for (int i = 1; i <= n; i++) scanf("%d%d", &str[i].l, &str[i].r);
    for (int i = n; i >= 1; i--) {
        for (auto j : boss[i]) _size[i] += _size[j];
    }
    dfs(1);
    for (int i = 1; i <= n; i++) printf("%d\n", ans[i]);
    return 0;
}

K：

solver：lzh

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

int a[100010];
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        a[i] += a[i - 1];
    }
    for (int i = 1; i <= n; i++) {
        int ans = 0, j = i - 1, add = 3;
        while (j <= n) {
            int r = j + add;
            if (r > n)
                r = n;
            ans += max(0, a[r] - a[j]);
            j += add;
            add += 3;
        }
        printf("%d\n", ans);
    }
}

M：

solver：lzh

#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
 
vector<pii> v[15];
int main()
{
    int n;
    scanf("%d", &n);
    int add = 64, j = 1;
    if (add > n) {
        printf("1\n1\n1 %d\n", n);
        return 0;
    }
    while (add <= n) {
        int cur = 1;
        while (1) {
            v[j].push_back({ cur, min(n, cur - 1 + add) });
            cur += add;
            if (cur > n)
                break;
        }
        add = add * 4;
        j++;
    }
    v[j].push_back({ 1, n });
    printf("%d\n", j);
    for (int i = 1; i <= j; i++) {
        printf("%d\n", v[i].size());
        for (auto p : v[i])
            printf("%d %d\n", p.ff, p.ss);
    }
}