oj.uz

답안 #939190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
939190 2024-03-06T06:37:04 Z gaga999 Nekameleoni (COCI15_nekameleoni) C++17
140 / 140
 915 ms 77936 KB 
#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 size(x) (int)x.size()
#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 = 1e5 + 5;
llt kk;
struct P
{
    vector<llt> ll, rr;
    vector<int> lp, rp;
    int ans;
    inline void ini(int p)
    {
        llt x;
        rd(x), x = 1ll << (x - 1);
        ll = rr = vector<llt>(1, x);
        lp = rp = vector<int>(1, p);
        ans = x == kk ? 1 : INF;
    }
} tr[N << 2];
int qp;

P operator+(const P &a, const P &b)
{
    P cr;
    cr.ans = min(a.ans, b.ans);
    cr.ll = a.ll, cr.rr = b.rr;
    cr.lp = a.lp, cr.rp = b.rp;
    for (int i = 0; i < size(a.rr); i++)
        if ((cr.rr.back() | a.rr[i]) != cr.rr.back())
            cr.rr.pb(cr.rr.back()), cr.rr.back() |= a.rr[i], cr.rp.pb(a.rp[i]);
    for (int i = 0; i < size(b.ll); i++)
        if ((cr.ll.back() | b.ll[i]) != cr.ll.back())
            cr.ll.pb(cr.ll.back()), cr.ll.back() |= b.ll[i], cr.lp.pb(b.lp[i]);
    for (int i = size(a.rr) - 1, j = 0; i >= 0; i--)
    {
        while (j < size(b.ll) && (a.rr[i] | b.ll[j]) != kk)
            j++;
        if (j == size(b.ll))
            break;
        tmin(cr.ans, b.lp[j] - a.rp[i] + 1);
    }
    return cr;
}

void blt(int l, int r, int id)
{
    if (l == r)
    {
        tr[id].ini(r);
        return;
    }
    int m = (l + r) >> 1;
    blt(l, m, ls(id)), blt(m + 1, r, rs(id));
    tr[id] = tr[ls(id)] + tr[rs(id)];
}

void cg(int l, int r, int id)
{
    if (l == r)
    {
        tr[id].ini(l);
        return;
    }
    int m = (l + r) >> 1;
    if (qp <= m)
        cg(l, m, ls(id));
    else
        cg(m + 1, r, rs(id));
    tr[id] = tr[ls(id)] + tr[rs(id)];
}

signed main()
{
    int n, k, q;
    rd(n, k, q), kk = (1ll << k) - 1;
    blt(1, n, 1);
    while (q--)
    {
        rd(k);
        if (k == 2)
            prt(tr[1].ans == INF ? -1 : tr[1].ans), putchar('\n');
        else
            rd(qp), cg(1, n, 1);
    }
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 42328 KB Output is correct
2 Correct 18 ms 42120 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 42588 KB Output is correct
2 Correct 25 ms 42588 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 43096 KB Output is correct
2 Correct 33 ms 43096 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 225 ms 48784 KB Output is correct
2 Correct 684 ms 67152 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 372 ms 61020 KB Output is correct
2 Correct 852 ms 76416 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 513 ms 56752 KB Output is correct
2 Correct 806 ms 71628 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 626 ms 64592 KB Output is correct
2 Correct 784 ms 73048 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 649 ms 63408 KB Output is correct
2 Correct 877 ms 74712 KB Output is correct

Subtask #9
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 828 ms 77480 KB Output is correct
2 Correct 847 ms 77732 KB Output is correct

Subtask #10
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 829 ms 77500 KB Output is correct
2 Correct 915 ms 77936 KB Output is correct