oj.uz

답안 #986812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986812 2024-05-21T09:21:55 Z LOLOLO Teams (CEOI11_tea) C++17
0 / 100
 300 ms 165360 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e6 + 10;
vector <int> pos[N];
int a[N], dp[N], pr[N], n;
pair <int, int> b[N];
vector <int> val[N];
int trace[N];

int bin(int lim) {
    val[0].pb(0);
    for (int i = 1; i <= n; i++) {
        int t = dp[i];
        if (t == -1)
            continue;

        int p = lower_bound(all(val[t - 1]), i - lim) - val[t - 1].begin();
        if (p < sz(val[t - 1]) && b[i].f <= i - val[t - 1][p]) {
            trace[i] = val[t - 1][p];
            val[t].pb(i);
        }
    } 

    for (int i = 0; i <= n; i++)
        val[i].clear();

    return trace[n];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pos[a[i]].pb(i);
    }

    int sz = 0;
    for (int i = 1; i <= n; i++) {
        for (auto x : pos[i]) {
            sz++;
            b[sz] = {i, x};
        } 
    }

    dp[0] = pr[0] = 0;
    val[0].pb(0);

    for (int i = 1; i <= n; i++) {
        if (i < b[i].f) {
            dp[i] = -1;
        } else {
            dp[i] = pr[i - b[i].f] + 1;
        }

        pr[i] = dp[i] > dp[pr[i - 1]] ? i : pr[i - 1];
    }

    int l = 1, r = n, m, ans = n;
    while (l <= r) {
        mem(trace, -1);
        trace[n] = -1;
        m = (l + r) / 2;
        if (bin(m) >= 0) {
            ans = m;
            r = m - 1;
        } else {
            l = m + 1;
        }
    }

    cout << dp[n] << '\n';
    
    mem(trace, -1);
    bin(ans);

    vector < vector <int>> save;

    for (int i = n; i >= 1; i--) {
        assert(trace[i] != -1);
        cout << i - trace[i] << " ";
        for (int j = i; j > trace[i]; j--) {
            cout << b[j].s << " ";
        }

        i = trace[i] + 1;
        cout << '\n';
    }

    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 52828 KB Output is correct
2 Runtime error 63 ms 106956 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 64 ms 106928 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 63 ms 107016 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 72 ms 107352 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 65 ms 107372 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 77 ms 111696 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 80 ms 112464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 214 ms 148008 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 271 ms 160516 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 300 ms 165360 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -