ACMB6

吃了次重定向的亏

F - Folding Gym - 101142F

折叠问题，只有当长大于等于目标长，宽大于等于目标宽时才成立，而折叠方式也有两种，长变长和长变宽，比较
谁小即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    freopen("folding.in","r",stdin);
    freopen("folding.out","w",stdout);
    ll a, b;
    ll aa, bb;
    cin >> a >> b;
    cin >> aa >> bb;
    ll max1 = max(a, b);
    ll max2 = max(aa, bb);
    ll min1 = min(a, b);
    ll min2 = min(aa, bb);
    ll cnt = 0;
    if (max1 >= max2 && min1 >= min2)
    {
        while (max1 > max2)
        {
            cnt++;
            max2 *= 2;
        }
        while (min1 > min2)
        {
            cnt++;
            min2 *= 2;
        }
    }
    else
    {
        cout << "-1" << endl;
        //system("pause");
        return 0;
    }
    max1 = max(a, b);
    max2 = max(aa, bb);
    min1 = min(a, b);
    min2 = min(aa, bb);
    ll cnt2 = 0;
    if (max1 >= min2 && min1 >= max2)
    {
        while (max1 > min2)
        {
            min2 *= 2;
            cnt2++;
        }
        while (min1 > max2)
        {
            max2 *= 2;
            cnt2++;
        }
    }
    if (cnt2 != 0)
        cout << min(cnt, cnt2) << endl;
    else
    {
        cout << cnt << endl;
    }
    //system("pause");
    return 0;
}

C - CodeCoder vs TopForces

启示：数据可以分成两部分存储，一部分存储数据，一部分存储关系

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define N 100010
struct node
{
    int a, b, id;
}x[N], y[N];
int xid[N], yid[N], sum, ans[N];
bool vis[N];

bool cmp1(const node &a, const node &b)
{
    if(a.a == b.a) return a.b < b.b;
    return a.a < b.a;
}

bool cmp2(const node &a, const node &b)
{
    if(a.b == b.b) return a.a < b.a;
    return a.b < b.b;
}

void dfs(int x)
{
    vis[x] = true;
    sum++;
    int idx = xid[x], idy = yid[x];
    if(!vis[idx] && xid[idx] != 0) dfs(idx);
    if(!vis[idy] && yid[idy] != 0) dfs(idy);
}

int main()
{
    freopen("codecoder.in","r",stdin);
    freopen("codecoder.out","w",stdout);
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d%d", &x[i].a, &x[i].b);
        x[i].id = i;
        y[i] = x[i];
    }
    memset(xid, 0, sizeof(xid));
    memset(yid, 0, sizeof(yid));
    memset(vis, 0, sizeof(vis));
    sum = 0;
    sort(x + 1, x + 1 + n, cmp1);
    sort(y + 1, y + 1 + n, cmp2);
    for(int i = 2; i <= n; i++) {
        if(x[i].a > x[i-1].a) xid[x[i].id] = x[i-1].id;
        if(y[i].b > y[i-1].b) yid[y[i].id] = y[i-1].id;
    }
    for(int i = 1; i <= n; i++) {
        if(!vis[x[i].id]) dfs(x[i].id);
        if(!vis[y[i].id]) dfs(y[i].id);
        ans[x[i].id] = sum - 1;
    }
    for(int i = 1; i <= n; i++) printf("%d\n", ans[i]);
    return 0;
}
//https://blog.csdn.net/weixin_46227016/article/details/107294586