oj.uz

Submission #59185

# Submission time Handle Problem Language Result Execution time Memory
59185 2018-07-21T00:26:05 Z Benq Teams (CEOI11_tea) C++11
70 / 100
 2500 ms 30680 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, pre[MX];
pi v[MX];

template<class T, int SZ> struct Seg {
    T seg[2*SZ], MN = {-MOD,-MOD};
    
    Seg() {
        memset(seg,0,sizeof seg);
    }
    
    T comb(T a, T b) { return max(a,b); } // easily change this to min or max
    
    void upd(int p, T value) {  // set value at position p
        for (seg[p += SZ] = value; p > 1; p >>= 1)
            seg[p>>1] = comb(seg[(p|1)^1],seg[p|1]); // non-commutative operations
    }
    
    void build() {
        F0Rd(i,SZ) seg[i] = comb(seg[2*i],seg[2*i+1]);
    }
    
    T query(int l, int r) {  // sum on interval [l, r]
        T res1 = MN, res2 = MN; r++;
        for (l += SZ, r += SZ; l < r; l >>= 1, r >>= 1) {
            if (l&1) res1 = comb(res1,seg[l++]);
            if (r&1) res2 = comb(seg[--r],res2);
        }
        return comb(res1,res2);
    }
};

Seg<pi,1<<20> S;

int get(int mid) {
    FOR(i,1,n+1) {
        pi x = S.query(max(i-mid,0),i-v[i].f);
        if (x.f != -MOD) x.f ++;
        pre[i] = x.s;
        S.upd(i,{x.f,i});
        if (i == n) return x.f;
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    FOR(i,1,n+1) {
        cin >> v[i].f;
        v[i].s = i;
    }
    sort(v+1,v+n+1);
    int x = get(n);
    int lo = 1, hi = n;
    while (lo < hi) {
        int mid = (lo+hi)/2;
        if (get(mid) == x) hi = mid;
        else lo = mid+1;
    }
    get(lo);
    /*cout << lo << "\n";
    FOR(i,1,n+1) cout << pre[i] << " ";
    cout << "\n";*/
    int cur = n;
    vector<vi> ans;
    while (cur) {
        int CUR = pre[cur];
        vi ret; FOR(i,CUR+1,cur+1) ret.pb(v[i].s); ans.pb(ret);
        cur = CUR;
    }
    cout << sz(ans) << "\n";
    for (auto a: ans) {
        cout << sz(a) << " ";
        for (int i: a) cout << i << " ";
        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
*/

Compilation message

tea.cpp: In function 'int get(int)':
tea.cpp:85:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 16760 KB Output is correct
2 Correct 17 ms 16760 KB Output is correct
3 Correct 14 ms 16800 KB Output is correct
4 Correct 14 ms 16852 KB Output is correct
5 Correct 14 ms 16860 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16912 KB Output is correct
2 Correct 14 ms 16968 KB Output is correct
3 Correct 14 ms 17112 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 17112 KB Output is correct
2 Correct 17 ms 17112 KB Output is correct
3 Correct 15 ms 17112 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 17232 KB Output is correct
2 Correct 36 ms 17232 KB Output is correct
3 Correct 36 ms 17248 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 17408 KB Output is correct
2 Correct 32 ms 17472 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 19504 KB Output is correct
2 Correct 392 ms 19780 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 20520 KB Output is correct
2 Correct 375 ms 20688 KB Output is correct
3 Correct 461 ms 20780 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2559 ms 27616 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 2556 ms 30680 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 2559 ms 30680 KB Time limit exceeded
2 Halted 0 ms 0 KB -