oj.uz

답안 #910484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910484 2024-01-18T05:23:28 Z gaga999 Teams (CEOI11_tea) C++17
100 / 100
 829 ms 49516 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 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 ar[N], br[N], dp[N], fr[N], ln[N], vl[N], t1[N << 1], t2[N << 1];

signed main()
{
    int n;
    rd(n);
    for (int i = 1; i <= n; i++)
        rd(ar[i]);
    iota(br + 1, br + n + 1, 1);
    sort(br + 1, br + n + 1, [&](int a, int b)
         { return ar[a] < ar[b]; });
#define mex(a, b) (mpr(dp[a], vl[a]) > mpr(dp[b], vl[b]) ? a : b)
    auto pul = [&](int p, int *tr) -> void
    {
        tr[p] = mex(tr[ls(p)], tr[rs(p)]);
    };
    auto qy = [&](int l, int r, int *tr) -> int
    {
        int res = n + 1;
        for (l += n + 1, r += n + 1; l <= r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                res = mex(res, tr[l]), l++;
            if (~r & 1)
                res = mex(res, tr[r]), r--;
        }
        return res;
    };
    auto cg = [&](int p, int *tr) -> void
    {
        for (p = (p + n + 1) >> 1; p; p >>= 1)
            pul(p, tr);
    };
#define f(i) ar[br[i]]
    fill(dp + 1, dp + n + 2, -INF);
    for (int i = 0; i <= n; i++)
        t1[i + n + 1] = t2[i + n + 1] = n + 1;
    t1[n + 1] = 0;
    for (int i = n; i > 0; i--)
        pul(i, t1), pul(i, t2);
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    pq.push(mpr(0, 0));
    for (int i = 1; i <= n; i++)
    {
        if (i - f(i) < 0)
            continue;
        while (!pq.empty() && pq.top().F < i)
        {
            int p = pq.top().S;
            t1[p + n + 1] = n + 1;
            cg(p, t1), vl[p] = p;
            t2[p + n + 1] = p, cg(p, t2);
            pq.pop();
        }
        int tp = qy(0, i - f(i), t1);
        pii res(dp[tp], vl[tp]);
        fr[i] = tp;
        tp = qy(0, i - f(i), t2);
        pii cr(dp[tp], vl[tp] - i);
        if (cr > res)
            res = cr, fr[i] = tp;
        dp[i] = res.F + 1, vl[i] = res.S;
        pq.push(mpr(i - vl[i], i));
        t1[i + n + 1] = i, cg(i, t1);
    }
    prt(dp[n]), putchar('\n');
    for (int i = n; i; i = fr[i])
    {
        prt(i - fr[i]);
        for (int j = i; j > fr[i]; j--)
            putchar(' '), prt(br[j]);
        putchar('\n');
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10692 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 10844 KB Output is correct
2 Correct 4 ms 10588 KB Output is correct
3 Correct 6 ms 11064 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 10844 KB Output is correct
2 Correct 4 ms 10840 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 15888 KB Output is correct
2 Correct 46 ms 15700 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 15952 KB Output is correct
2 Correct 46 ms 15880 KB Output is correct
3 Correct 51 ms 16468 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 38484 KB Output is correct
2 Correct 458 ms 38480 KB Output is correct
3 Correct 481 ms 43388 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 653 ms 44196 KB Output is correct
2 Correct 613 ms 47208 KB Output is correct
3 Correct 659 ms 46144 KB Output is correct
4 Correct 626 ms 46684 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 45236 KB Output is correct
2 Correct 83 ms 43964 KB Output is correct
3 Correct 671 ms 47276 KB Output is correct
4 Correct 829 ms 49516 KB Output is correct