标签：Seating ll hard pos will Arrangements seats nodes sum

题目：
It is the hard version of the problem. The only difference is that in this version 1≤n≤300

In the cinema seats can be represented as the table with n rows and m columns. The rows are numbered with integers from 1 to n. The seats in each row are numbered with consecutive integers from left to right: in the k-th row from m(k−1)+1 to mk for all rows 1≤k≤n.

There are nm people who want to go to the cinema to watch a new film. They are numbered with integers from 1 to nm

. You should give exactly one seat to each person.

It is known, that in this cinema as lower seat index you have as better you can see everything happening on the screen. i
-th person has the level of sight ai. Let’s define si as the seat index, that will be given to i-th person. You want to give better places for people with lower sight levels, so for any two people i, j such that ai<aj it should be satisfied that si<sj

.After you will give seats to all people they will start coming to their seats. In the order from 1 to nm, each person will enter the hall and sit in their seat. To get to their place, the person will go to their seat’s row and start moving from the first seat in this row to theirs from left to right. While moving some places will be free, some will be occupied with people already seated. The inconvenience of the person is equal to the number of occupied seats he or she will go through.

Let’s consider an example: m=5 , the person has the seat 4 in the first row, the seats 1, 3, 5 in the first row are already occupied, the seats 2 and 4 are free. The inconvenience of this person will be 2, because he will go through occupied seats 1 and 3

.Find the minimal total inconvenience (the sum of inconveniences of all people), that is possible to have by giving places for all people (all conditions should be satisfied).

Input：
7
1 2
1 2
3 2
1 1 2 2 3 3
3 3
3 4 4 1 1 1 1 1 2
2 2
1 1 2 1
4 2
50 50 50 50 3 50 50 50
4 2
6 6 6 6 2 2 9 6
2 9
1 3 3 3 3 3 1 1 3 1 3 1 1 3 3 1 1 3

Output：
1
0
4
0
0
0
1

分析：
按照题意先记录下每个人的座位号，ai相同的人的座位号进行特殊处理，然后按顺序模拟入座过程，用树状数组维护

Code:

#include <bits/stdc++.h>
#define DEBUG freopen("_in.txt", "r", stdin);
// #define DEBUG freopen("_in.txt", "r", stdin), freopen("_out.txt", "w", stdout);
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll maxn = 1e5 + 10;
const ll maxm = 1e3 + 10;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.1415926;
const ll mod = 998244353;
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

ll t, n, m;

struct Node
{
    ll v, pos, fl;
    bool operator<(Node other) const
    {
        if (v != other.v)
            return v < other.v;
        else
        {
            return pos < other.pos;
        }
    }
} nodes[maxn];

ll arr[maxn], c[maxm][maxm], brr[maxn];
map<ll, ll> mp;

ll lowbit(ll i)
{
    return i & (-i);
}

void update(ll x, ll v, ll fl)
{
    for (ll i = x; i <= m; i += lowbit(i))
    {
        c[fl][i] += v;
    }
}

ll query(ll x, ll fl)
{
    ll sum = 0;
    for (ll i = x; i > 0; i -= lowbit(i))
    {
        sum += c[fl][i];
    }
    return sum;
}

int main()
{
    // DEBUG;
    scanf("%lld", &t);
    while (t--)
    {
        mp.clear();
        scanf("%lld%lld", &n, &m);
        for (ll i = 1; i <= m * n; i++)
        {
            scanf("%lld", &nodes[i].v);
            nodes[i].pos = i;
        }
        sort(nodes + 1, nodes + m * n + 1);
        ll index = 0;
        for (ll i = 1; i <= m * n; i++)
        {
            if (i > 1 && nodes[i].v == nodes[i - 1].v)
            {
                arr[nodes[i].pos] = index;
            }
            else
                arr[nodes[i].pos] = ++index;
            mp[index]++;
        }
        ll sum = 0;
        for (ll i = 1; i <= index; i++)
        {
            if (mp[i] > 1)
            {
                ll num1 = i + sum, fl1 = ceil(num1 * 1.0 / m);
                ll num2 = i + sum + mp[i] - 1, fl2 = ceil(num2 * 1.0 / m);
                if (fl1 == fl2)
                {
                    for (ll j = 0; j < mp[i]; j++)
                    {
                        // nodes[num1 + j].pos
                        brr[nodes[num1 + j].pos] = num2 - j;
                    }
                }
                else
                {
                    ll sub = fl2 - fl1;
                    ll pos1 = i + sum - 1;
                    for (ll j = 0; j <= fl1 * m - num1; j++)
                    {
                        brr[nodes[++pos1].pos] = fl1 * m - j;
                    }

                    for (ll j = 1; j <= sub - 1; j++)
                    {
                        for (ll k = 0; k <= m - 1; k++)
                        {
                            brr[nodes[++pos1].pos] = (fl1 + j) * m - k;
                        }
                    }
                    for (ll j = 0; j <= num2 - (fl2 - 1) * m - 1; j++)
                    {
                        brr[nodes[++pos1].pos] = num2 - j;
                    }
                }
                sum += mp[i] - 1;
            }
            else
                brr[nodes[i + sum].pos] = i + sum;
        }
        ll ans = 0;
        for (ll i = 1; i <= m * n; i++)
        {
            ll v = brr[i] % m, u = ceil(brr[i] * 1.0 / m);
            if (v == 0)
            {
                v = m;
            }
            ans += query(v, u);
            update(v, 1, u);
        }
        printf("%lld\n", ans);
        for (ll i = 1; i <= n; i++)
        {
            for (ll j = 1; j <= m; j++)
            {
                c[i][j] = 0;
            }
        }
    }
    return 0;
}

标签：Seating,ll,hard,pos,will,Arrangements,seats,nodes,sum
来源： https://blog.csdn.net/m0_51270992/article/details/120276330

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。