Submission #316692

#	Time	Username	Problem	Language	Result	Execution time	Memory
316692		anakib1	Seats (IOI18_seats)	C++17	5 / 100	4078 ms	110456 KiB

seats

//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a) {
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
    return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
    return *max_element(all(a));
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#include "seats.h"
vi r, c;
int n;
int ans = 1;
vi t;
struct simple_segtree {
    vi tree;
    int n;
    simple_segtree(int nn = 0) {
        n = nn;
        tree.resize(4 * n, -1e9);
    }
    void build(int v, int l, int r, const vector<int>& a) {
        if (l > r) return;
        if (l == r) return void(tree[v] = a[l]);
        int m = (l + r) / 2;
        build(v * 2, l, m, a);
        build(v * 2 + 1, m + 1, r, a);
        tree[v] = max(tree[v * 2], tree[v * 2 + 1]);
    };
    void ch(int v, int l, int r, int pos, int nv) {
        if (l > r)return;
        if (l == r)return void(tree[v] = nv);
        int m = l + r >> 1;
        if (pos <= m)ch(v << 1, l, m, pos, nv);
        else ch(v << 1 | 1, m + 1, r, pos, nv);
        tree[v] = max(tree[v << 1], tree[v << 1 | 1]);
    };
    void add(int v, int l, int r, int pos, int nv) {
        if (l > r)return;
        if (l == r)return void(tree[v] += nv);
        int m = l + r >> 1;
        if (pos <= m)add(v << 1, l, m, pos, nv);
        else add(v << 1 | 1, m + 1, r, pos, nv);
        tree[v] = tree[v << 1] + tree[v << 1 | 1];
    };
    int get(int v, int l, int r, int _l, int _r) {
        if (r < _l || _r < l)return -1e9;
        if (_l <= l && r <= _r)return tree[v];
        int m = l + r >> 1;
        return max(get(v << 1, l, m, _l, _r), get(v << 1 | 1, m + 1, r, _l, _r));
    };
    void add(int a, int b) {
        add(1, 0, n - 1, a, b);
    }
    void ch(int a, int b) {
        ch(1, 0, n - 1, a, b);
    }
    int get(int x, int y) {
        return get(1, 0, n - 1, x, y);
    }
};
simple_segtree xx, nx, xy, ny;

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    r = R, c = C;
    n = H * W;
    xx = nx = xy = ny = simple_segtree(n);
    auto f = [&](vi a) {vi b(a); for (auto& x : b)x = -x; return b; };
    nx.build(1, 0, n - 1, f(r));
    xx.build(1, 0, n - 1, r);
    xy.build(1, 0, n - 1, c);
    ny.build(1, 0, n - 1, f(c));
}

int swap_seats(int a, int b) {
    nx.ch(a, -r[b]);
    xx.ch(a, r[b]);
    ny.ch(a, -c[b]);
    xy.ch(a, c[b]);

    nx.ch(b, -r[a]);
    xx.ch(b, r[a]);
    ny.ch(b, -c[a]);
    xy.ch(b, c[a]);

    swap(r[a], r[b]);
    swap(c[a], c[b]);
    ans = 1;
    int i = 1;
    int mnx, mxx, mny, mxy; mnx = mxx = r[0], mny = mxy = c[0];
    while (i < n) {
        mnx = -nx.get(0, i);
        mxx = xx.get(0, i);
        mny = -ny.get(0, i);
        mxy = xy.get(0, i);
        if ((mxx - mnx + 1) * (mxy - mny + 1) == (i + 1)) i++, ans++;
        else i = (mxx - mnx + 1) * (mxy - mny + 1) - 1;
    }
    return ans;
}

Compilation message (stderr)

seats.cpp: In member function 'void simple_segtree::ch(int, int, int, int, int)':
seats.cpp:135:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  135 |         int m = l + r >> 1;
      |                 ~~^~~
seats.cpp: In member function 'void simple_segtree::add(int, int, int, int, int)':
seats.cpp:143:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  143 |         int m = l + r >> 1;
      |                 ~~^~~
seats.cpp: In member function 'int simple_segtree::get(int, int, int, int, int)':
seats.cpp:151:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  151 |         int m = l + r >> 1;
      |                 ~~^~~

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