Submission #648670

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
648670	2022-10-07T12:19:35 Z	messiuuuuu	Teams (CEOI11_tea)	C++14	0 / 100	2500 ms	8932 KB

///
#include<bits/stdc++.h>
#define task "C"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e6 + 5;
const ll INF = 1e18 + 5;

int n, a[MAXN];

void Input()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
}

pair<int, int> dp[MAXN];
int cs[MAXN], trace[MAXN];

bool upd(pair<int, int>& a, const pair<int, int>& b)
{
    if (a.fi < b.fi || (a.fi == b.fi && a.se > b.se))
    {
        a = b;
        return 1;
    }
    return 0;
}

void Solve()
{
    iota(cs + 1, cs + n + 1, 1);
    sort(cs + 1, cs + n + 1, [](int i, int j)
         {
             return a[i] < a[j];
         });
    for (int i = 1; i <= n; i++)
    {
        for (int j = i - a[cs[i]] + 1; j >= 1; j--)
        {
            if (upd(dp[i], {dp[j - 1].fi + 1, max(dp[j - 1].se, i - j + 1)}))
            {
                trace[i] = j;
            }
        }
    }
    cout << dp[n].fi << '\n';
    int i = n;
    while (i > 0)
    {
        int j = trace[i];
        cout << i - j + 1 << ' ';
        for (; i >= j; i--)
            cout << cs[i] << ' ';
        cout << '\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(task".INP","r"))
    {
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    Input();
    Solve();
}

Compilation message

tea.cpp: In function 'int main()':
tea.cpp:70:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	340 KB	Output is correct
2	Incorrect	340 KB	Expected EOF
3	Halted	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	340 KB	Expected EOF
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	340 KB	Expected EOF
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	13 ms	468 KB	Expected EOF
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	10 ms	412 KB	Expected EOF
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2559 ms	1884 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2577 ms	1848 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2582 ms	7084 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2588 ms	8932 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2597 ms	8780 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-