제출 #757325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757325		drdilyor	자리 배치 (IOI18_seats)	C++17	5 / 100	4081 ms	36936 KiB

seats

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

int h, w;
std::vector<int> r, c;
vector<vector<int>> arr;

struct Fenwick {
    int n, m;
    vector<vector<ll>> t;
    Fenwick() = default;
    Fenwick(int n, int m) : n(n), m(m), t(n, vector<ll>(m)) {}
    ll sum(int r, int c) {
        ll s = 0;
        for (int i = r; i >= 0; i = (i&(i+1))-1)
            for (int j = c; j >= 0; j = (j&(j+1))-1)
                s += t[i][j];
        return s;
    }
    ll sum(int r1, int c1, int r2, int c2) {
        return sum(r2, c2) + sum(r1-1, c1-1) - sum(r1-1, c2) - sum(r2, c1-1);
    }
    void inc(int r, int c, int d) {
        for (; r < n; r |= r+1)
            for (int i = c; i < m; i |= i+1)
                t[r][i] += d;
    }
};

Fenwick ft;


void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    h = H;
    w = W;
    r = R;
    c = C;
    arr = vector(H, vector<int>(W, 0));
    ft = Fenwick(H, W);
    for (int i = 0; i < H * W; i++) {
        arr[r[i]][c[i]] = i;
        ft.inc(r[i], c[i], i);
    }
#ifdef ONPC
    for (int i = 0; i < H; i++)
        for (int j = 0; j < W; j++)
            cout << arr[i][j] << " \n"[j == W-1];
#endif
}

ll sum(int r1, int c1, int r2, int c2) {
    ll res = 0;
    for (int i = r1; i <= r2; i++) {
        for (int j = c1; j <= c2; j++) {
            res += arr[i][j];
        }
    }
    return res;
}

int swap_seats(int a, int b) {
    ft.inc(r[a], c[a], -a +b);
    ft.inc(r[b], c[b], -b +a);
    swap(arr[r[a]][c[a]], arr[r[b]][c[b]]);
    swap(r[a], r[b]);
    swap(c[a], c[b]);
    int ans = 0;
    for (int r1 = 0; r1 < h; r1++) {
        for (int r2 = r1; r2 < h; r2++) {
            for (int c1 = 0; c1 < w; c1++) {
                for (int c2 = c1; c2 < w; c2++) {
                    ll k = (r2 - r1 + 1) * (c2 - c1 + 1);
                    if (ft.sum(r1, c1, r2, c2) == k * (k-1) / 2)
                        ans ++;
                }
            }
        }
    }
    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30