Submission #145707

#	Time	Username	Problem	Language	Result	Execution time	Memory
145707		jacynkaa	Teams (CEOI11_tea)	C++14	0 / 100	349 ms	25460 KiB

tea

#include <bits/stdc++.h>
#include <math.h>
#include <chrono>
using namespace std;
#pragma GCC optimize("-O3")
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10) //cin.tie(0); cout.tie(0);
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FWD(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define all(c) (c).begin(), (c).end()
#define what(x) cerr << #x << " is " << x << endl;

const int MAXN = 1e6 + 1e2;
vector<pii> L;
int dp[MAXN];
bool brac[MAXN];
int n;

void solve()
{
    for (int i = 1; i <= n; i++)
    {
        if ((i - L[i].st >= 0 && dp[i - L[i].st] + 1 >= dp[i - 1]) || i == n - 1)
        {
            brac[i] = true;
            dp[i] = dp[i - L[i].st] + 1;
        }
        else
            dp[i] = dp[i - 1];
    }
    cout << dp[n] << endl;

    int j = n;
    while (j > 0)
    {

        vector<int> X;
        int k = j;
        for (; (k > j - L[j].st || brac[k] == false) && k > 0; k--)
            X.pb(L[k].nd);
        j = k;
        cout << X.size() << " ";
        for (int a : X)
            cout << a << " ";
        cout << endl;
    }
}
main()
{
    _upgrade;
    cin >> n;
    L.resize(n + 1);
    L[0] = {0, 0};
    rep(i, n)
    {
        cin >> L[i].st;
        L[i].nd = i + 1;
    }
    sort(all(L));
    solve();
}

Compilation message (stderr)

tea.cpp:55:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10