oj.uz

Submission #400222

# Submission time Handle Problem Language Result Execution time Memory
400222 2021-05-07T17:25:31 Z SavicS Teams (CEOI11_tea) C++14
0 / 100
 2500 ms 12472 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1000005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
pii niz[maxn];

int dp[maxn]; // (i) - za prvih i max broj timova
int put[maxn];

int main()
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    cin >> n;
    ff(i,1,n)cin >> niz[i].fi, niz[i].se = i;
    sort(niz + 1, niz + n + 1);

    memset(dp, -inf, sizeof(dp));

	dp[0] = 0;
    ff(i,1,n){
        int X = niz[i].fi;
        fb(j,i - X + 1,1){
            if(dp[j - 1] + 1 > dp[i]){
                dp[i] = dp[j - 1] + 1;
                put[i] = j - 1;
            }
        }
    }

    vector<int> res;

    int pos = n;
    while(pos != 0){
        pos = put[pos];
        res.pb(pos);
    }
    reverse(all(res));

    cout << dp[n] << endl;
    res.pb(n);

    ff(i,0,sz(res) - 2){
        int A = res[i] + 1;
        int B = res[i + 1];
        cout << B - A + 1 << " ";
        ff(j,A,B)cout << niz[j].se << " ";
        cout << endl;
    }

    return 0;
}
/**

5
2
1
2
2
3

// probati bojenje sahovski ili slicno

**/

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4300 KB Output is correct
2 Incorrect 12 ms 4332 KB Output isn't correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2560 ms 5448 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 2580 ms 10552 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 2560 ms 12472 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 2581 ms 12392 KB Time limit exceeded
2 Halted 0 ms 0 KB -