Submission #903170

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
903170	2024-01-11T06:02:03 Z	gaga999	Seats (IOI18_seats)	C++17	Compilation error	0 ms	0 KB

seats

#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}
const int N = 1e6 + 6;
int *xr, *yr;
vector<vector<int>> gd;
struct TR
{
    llt vl, tg;
    int num = 1;
    inline void add(llt x) { vl += x, tg += x; }
} tr[N << 2];
int ql, qr, vv, L, R, RT;
void cg(int l = L, int r = R, int id = RT)
{
    if (ql > qr)
        return;
    if (ql <= l && r <= qr)
    {
        tr[id].add(vv);
        return;
    }
    if (tr[id].tg)
    {
        tr[ls(id)].add(tr[id].tg);
        tr[rs(id)].add(tr[id].tg);
        tr[id].tg = 0;
    }
    int m = (l + r) >> 1;
    if (ql <= m)
        cg(l, m, ls(id));
    if (qr > m)
        cg(m + 1, r, rs(id));
    tr[id].vl = min(tr[ls(id)].vl, tr[rs(id)].vl);
    tr[id].num = 0;
    if (tr[ls(id)].vl == tr[id].vl)
        tr[id].num += tr[ls(id)].num;
    if (tr[rs(id)].vl == tr[id].vl)
        tr[id].num += tr[rs(id)].num;
}

void mod(int x, int y, int bl)
{
    int tp[4] = {gd[x][y], gd[x + 1][y + 1], gd[x][y + 1], gd[x + 1][y]};
    sort(tp, tp + 4);
    ql = tp[0], qr = tp[1] - 1, vv = bl, cg();
    ql = tp[2], qr = tp[3] - 1, vv = INF * bl, cg();
}

inline void slv(int x, int y, int bl)
{
    mod(x, y, bl);
    mod(x - 1, y - 1, bl);
    mod(x, y - 1, bl);
    mod(x - 1, y, bl);
}

int swap_seats(int l, int r)
{
    slv(xr[l], yr[l], -1);
    slv(xr[r], yr[r], -1);
    swap(gd[xr[l]][yr[l]], gd[xr[r]][yr[r]]);
    swap(xr[l], xr[r]), swap(yr[l], yr[r]);
    slv(xr[l], yr[l], 1);
    slv(xr[r], yr[r], 1);
    return tr[RT].num;
}

void give_initial_chart(int H, int W, int X[], int Y[])
{
    gd = vector<vector<int>>(H + 2, vector<int>(W + 2, INF));
    int A = H * W;
    xr = X, yr = Y;
    for (int i = 0; i < A; i++)
        gd[++xr[i]][++yr[i]] = i;
    L = 0, R = A - 1, RT = 1;
    for (int i = 0; i <= H; i++)
        for (int j = 0; j <= W; j++)
            mod(i, j, 1);
}

Compilation message

/usr/bin/ld: /tmp/ccrlgVbk.o: in function `main':
grader.cpp:(.text.startup+0x22f): undefined reference to `give_initial_chart(int, int, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status