oj.uz

답안 #674647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674647 2022-12-25T15:01:09 Z tamthegod Teams (CEOI11_tea) C++17
70 / 100
 2500 ms 47212 KB 
// Make the best become better
// No room for laziness
#include<bits/stdc++.h>

#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 = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e9;
int n, a[maxN], id[maxN];
int f[maxN], trace[maxN];
int dp[maxN];
pair<int, int> st[4 * maxN];
void ReadInput()
{
    cin >> n;
    for(int i=1; i<=n; i++)
        cin >> a[i];
}
void update(int id, int l, int r, int pos, pair<int, int> val)
{
    if(l == r)
    {
        st[id] = val;
        return;
    }
    int mid = (l + r) / 2;
    if(pos <= mid) update(id * 2, l, mid, pos, val);
    else update(id * 2 + 1, mid + 1, r, pos, val);
    st[id] = max(st[id * 2], st[id * 2 + 1]);
}
pair<int, int> get(int id, int l, int r, int u, int v)
{
    if(l > v || r < u) return {-oo, -oo};
    if(l >= u && r <= v) return st[id];
    int mid = (l + r) / 2;
    return max(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
bool chk(int val)
{
    memset(st, -3, sizeof st);
    memset(dp, -3, sizeof dp);
    dp[0] = 0;
    for(int i=1; i<=n; i++)
    {
        update(1, 1, n, i, {dp[i - 1], i});
        int t = id[i];
        int l = max(1, i - val + 1), r = i - a[t] + 1;
        pair<int, int> tmp = get(1, 1, n, l, r);
        dp[i] = tmp.fi + 1;
    }
    //cout << dp[4];exit(0);
    return dp[n] == f[n];
}
void Print(int val)
{
    memset(st, -3, sizeof st);
    memset(f, -3, sizeof f);
    f[0] = 0;
    for(int i=1; i<=n; i++)
    {
        update(1, 1, n, i, {f[i - 1], i});
        int t = id[i];
        int l = max(1, i - val + 1), r = i - a[t] + 1;
        pair<int, int> tmp = get(1, 1, n, l, r);
        f[i] = tmp.fi + 1;
        trace[i] = tmp.se;
    }
    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(st, -3, sizeof st);
    memset(f, -3, sizeof f);
    f[0] = 0;
    for(int i=1; i<=n; i++)
    {
        update(1, 1, n, i, {f[i - 1], i});
        int t = id[i];
        int l = 1, r = i - a[t] + 1;
        pair<int, int> tmp = get(1, 1, n, l, r);
        f[i] = tmp.fi + 1;
    }
    int low = a[id[n]], high = max(n, a[id[n]] + 50), mid;
    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();
}

Compilation message

tea.cpp: In function 'bool chk(int)':
tea.cpp:47:29: warning: 'void* memset(void*, int, size_t)' writing to an object of type 'struct std::pair<int, int>' with no trivial copy-assignment [-Wclass-memaccess]
   47 |     memset(st, -3, sizeof st);
      |                             ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from tea.cpp:3:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<int, int>' declared here
  211 |     struct pair
      |            ^~~~
tea.cpp: In function 'void Print(int)':
tea.cpp:63:29: warning: 'void* memset(void*, int, size_t)' writing to an object of type 'struct std::pair<int, int>' with no trivial copy-assignment [-Wclass-memaccess]
   63 |     memset(st, -3, sizeof st);
      |                             ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from tea.cpp:3:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<int, int>' declared here
  211 |     struct pair
      |            ^~~~
tea.cpp: In function 'void Solve()':
tea.cpp:93:29: warning: 'void* memset(void*, int, size_t)' writing to an object of type 'struct std::pair<int, int>' with no trivial copy-assignment [-Wclass-memaccess]
   93 |     memset(st, -3, sizeof st);
      |                             ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from tea.cpp:3:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<int, int>' declared here
  211 |     struct pair
      |            ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 39404 KB Output is correct
2 Correct 38 ms 39552 KB Output is correct
3 Correct 36 ms 39392 KB Output is correct
4 Correct 36 ms 39488 KB Output is correct
5 Correct 36 ms 39380 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 39480 KB Output is correct
2 Correct 47 ms 39380 KB Output is correct
3 Correct 43 ms 39380 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 39480 KB Output is correct
2 Correct 43 ms 39468 KB Output is correct
3 Correct 48 ms 39412 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 39512 KB Output is correct
2 Correct 83 ms 39528 KB Output is correct
3 Correct 83 ms 39576 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 39516 KB Output is correct
2 Correct 85 ms 39512 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 490 ms 40760 KB Output is correct
2 Correct 526 ms 40864 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 577 ms 40944 KB Output is correct
2 Correct 506 ms 40760 KB Output is correct
3 Correct 586 ms 40948 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2533 ms 45268 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2562 ms 47180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2583 ms 47212 KB Time limit exceeded
2 Halted 0 ms 0 KB -