oj.uz

Submission #530174

# Submission time Handle Problem Language Result Execution time Memory
530174 2022-02-24T18:19:42 Z Lawliet Teams (CEOI11_tea) C++17
0 / 100
 256 ms 104516 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000010;
const int INF = 1000000010;

int n;

int v[MAXN];
int ord[MAXN];

int maxSize[MAXN];
int dp[MAXN], opt[MAXN];

vector<int> indValues[MAXN];
vector<int> transitions[MAXN];

int main()
{
    scanf("%d",&n);

    for(int i = 1 ; i <= n ; i++)
    {
        scanf("%d",&v[i]);
        indValues[ v[i] ].push_back( i );
    }

    int cnt = 0;

    for(int i = n ; i > 0 ; i--)
        while( !indValues[i].empty() )
            ord[++cnt] = indValues[i].back(), indValues[i].pop_back();

    for(int i = 1 ; i < v[ ord[1] ] ; i++)
        dp[i] = -INF;

    dp[ v[ ord[1] ] ] = 1;
    opt[ v[ ord[1] ] ] = 1;
    maxSize[ v[ ord[1] ] ] = v[ ord[1] ];
    transitions[ v[ ord[1] ] ].push_back( v[ ord[1] ] );

    for(int i = v[ ord[1] ] + 1 ; i <= n ; i++)
    {
        dp[i] = dp[i - 1];
        opt[i] = opt[i - 1];
        maxSize[i] = maxSize[i - 1];

        if( (i - 1)%maxSize[i - 1] == 0 && (i - 1)/maxSize[i - 1] == dp[i - 1] )
            maxSize[i]++;

        if( v[ ord[i] ] + i - 1 <= n )
            transitions[ v[ ord[i] ] + i - 1 ].push_back( i );

        for(int j = 0 ; j < (int)transitions[i].size() ; j++)
        {
            int last = transitions[i][j];
            int newSize = max( maxSize[last - 1] , i - last + 1 );

            if( dp[i] < dp[last - 1] + 1 )
                dp[i] = dp[last - 1] + 1, maxSize[i] = newSize, opt[i] = last;
            else if( dp[i] == dp[last - 1] + 1 && maxSize[i] > newSize )
                maxSize[i] = newSize, opt[i] = last;
        }
    }

    printf("%d\n",dp[n]);

    int last = n;

    for(int i = 1 ; i <= dp[n] ; i++, last = opt[last] - 1)
    {
        printf("%d ",last - opt[last] + 1);

        for(int j = opt[last] ; j <= last ; j++)
            printf("%d ",ord[j]);

        printf("\n");
    }
}

Compilation message

tea.cpp: In function 'int main()':
tea.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
tea.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         scanf("%d",&v[i]);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47180 KB Output is correct
2 Correct 24 ms 47252 KB Output is correct
3 Incorrect 23 ms 47204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 47188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 47308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 47524 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47500 KB Output is correct
2 Incorrect 24 ms 47436 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 50848 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 51956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 94436 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 256 ms 104516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 224 ms 78524 KB Output isn't correct
2 Halted 0 ms 0 KB -