oj.uz

Submission #59184

# Submission time Handle Problem Language Result Execution time Memory
59184 2018-07-20T23:23:51 Z Benq Teams (CEOI11_tea) C++14
30 / 100
 497 ms 94304 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 1000001;

int n; 
vi ret[MX];
pi v[MX];
priority_queue<pi,vpi,greater<pi>> p;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    FOR(i,1,n+1) {
        int x; cin >> x;
        v[i] = {x,i};
    }
    sort(v+1,v+n+1);
    for (int i = n; i > 0; ) {
        if (v[i].f > i) {
            for (;i>0;--i) {
                auto a = p.top(); p.pop();
                ret[a.s].pb(v[i].s);
                p.push({a.f+1,a.s});
            }
            break;
        } else {
            int I = i;
            for (;i>I-v[I].f;--i) ret[I].pb(v[i].s);
            p.push({v[I].f,I});
        }
    }
    int ans = 0;
    FOR(i,1,n+1) if (sz(ret[i])) ans ++;
    cout << ans << "\n";
    FOR(i,1,n+1) if (sz(ret[i])) {
        cout << sz(ret[i]) << " ";
        for (int j: ret[i]) cout << j << " ";
        cout << "\n";
    }
    
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 23800 KB Output is correct
2 Correct 22 ms 23856 KB Output is correct
3 Correct 25 ms 24032 KB Output is correct
4 Correct 29 ms 24032 KB Output is correct
5 Correct 21 ms 24032 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24124 KB Output is correct
2 Incorrect 25 ms 24124 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 24344 KB Output is correct
2 Correct 25 ms 24344 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 26996 KB Output is correct
2 Correct 48 ms 27024 KB Output is correct
3 Correct 50 ms 27644 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 54248 KB Output is correct
2 Correct 487 ms 94304 KB Output is correct
3 Incorrect 373 ms 94304 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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