oj.uz

답안 #674642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674642 2022-12-25T14:44:37 Z tamthegod Teams (CEOI11_tea) C++14
0 / 100
 26 ms 612 KB 
// Make the best become better
// No room for laziness
#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 5000 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, a[maxN], id[maxN];
int f[maxN], trace[maxN];
int pos[maxN];
int dp[maxN];
void ReadInput()
{
    cin >> n;
    for(int i=1; i<=n; i++)
        cin >> a[i];
}
bool chk(int val)
{
    memset(dp, -3, sizeof dp);
    dp[0] = 0;
    for(int i=1; i<=n; i++)
    {
        int t = id[i];
        for(int j=i-a[t]+1; j>=max(1ll, i-val+1); j--)
        {
            if(dp[i] < dp[j - 1] + 1)
            {
                dp[i] = dp[j - 1] + 1;
            }
        }
    }
    return dp[n] == f[n];
}
void Print(int val)
{
    memset(f, -3, sizeof f);
    f[0] = 0;
    for(int i=1; i<=n; i++)
    {
        int t = id[i];
        for(int j=i-a[t]+1; j>=max(1ll, i-val); j--)
        {
            if(f[i] < f[j - 1] + 1)
            {
                f[i] = f[j - 1] + 1;
                trace[i] = j;
            }
        }
    }
    cout << f[n] << '\n';
    int i = n;
    while(i)
    {
        cout << i - trace[i] + 1 << " ";
        for(int j=i; j>=trace[i]; j--)
            cout << id[j] << " ";
        i = trace[i] - 1;
        cout << '\n';
    }
}
void Solve()
{
    iota(id + 1, id + n + 1, 1);
    sort(id + 1, id + n + 1, [](int i, int j)
    {
        return a[i] < a[j];
    });
    memset(f, -3, sizeof f);
    f[0] = 0;
    for(int i=1; i<=n; i++)
    {
        int t = id[i];
        for(int j=i-a[t]+1; j>=1; j--)
        {
            if(f[i] < f[j - 1] + 1)
            {
                f[i] = f[j - 1] + 1;
                trace[i] = j;
            }
        }
    }
    int low = a[id[n]], high = n, mid;
   // cout << chk(n);return;
    while(low <= high)
    {
        mid = (low + high) / 2;
        if(chk(mid)) high = mid - 1;
        else low = mid + 1;
    }
    //cout << low;return;
    Print(low);
}
int32_t main()
{
    //freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 524 KB Output is correct
2 Incorrect 24 ms 528 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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