oj.uz

Submission #224770

# Submission time Handle Problem Language Result Execution time Memory
224770 2020-04-18T18:45:22 Z MKopchev Teams (CEOI11_tea) C++14
0 / 100
 375 ms 37500 KB 
#include<bits/stdc++.h>
using namespace std;

const int nmax=1e6+42;
int n;
pair<int/*low*/,int/*id*/> inp[nmax];

pair<int/*max*/,int/*id*/> pref_max[nmax];

int dp[nmax];
int parent[nmax];

int main()
{
    scanf("%i",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%i",&inp[i].first);
        inp[i].second=i;
    }

    sort(inp+1,inp+n+1);

    pref_max[0]={0,0};
    dp[0]=0;

    for(int i=1;i<=n;i++)
    {
        dp[i]=-1;
        parent[i]=-1;

        if(i-inp[i].first>=0)
        {
            parent[i]=pref_max[i-inp[i].first].second;
            dp[i]=pref_max[i-inp[i].first].first+1;
        }

        pref_max[i]=max(pref_max[i-1],make_pair(dp[i],i));
    }

    printf("%i\n",dp[n]);
    int pos=n;

    for(int i=dp[n];i>=1;i--)
    {
        printf("%i",pos-parent[pos]);
        for(int j=parent[pos]+1;j<=pos;j++)
        {
            printf(" %i",inp[j].second);
        }
        printf("\n");
        pos=parent[pos];
    }
    return 0;
}

Compilation message

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

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Incorrect 6 ms 512 KB Output isn't correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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