oj.uz

Submission #57110

# Submission time Handle Problem Language Result Execution time Memory
57110 2018-07-14T03:33:51 Z Benq Money (IZhO17_money) C++14
100 / 100
 746 ms 96192 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 = 100001;

template<class T, int SZ> struct BIT {
    T bit[SZ+1];
    
    BIT() { memset(bit,0,sizeof bit); }
    
    void upd(int k, T val) { // add val to index k
        for( ;k <= SZ; k += (k&-k)) bit[k] += val;
    }
    
    int getFst(int x) {
        int cur = 0;
        F0Rd(i,20) if ((cur^(1<<i)) <= SZ && bit[cur^(1<<i)] < x) {
            x -= bit[cur^(1<<i)];
            cur ^= (1<<i);
        }
        return cur+1;
    }
    
    T query(int k) {
        T temp = 0;
        for (;k > 0;k -= (k&-k)) temp += bit[k];
        return temp;
    }
    T query(int l, int r) { return query(r)-query(l-1); } // range query [l,r]
};

BIT<int,1000000> T;

int n;
bool fixe = 0;

bool nex(int a, int b) {
    int x = T.query(b-1), y = T.query(b);
    if (y-x > 1) {
        if (a == b) return 1;
        if (fixe == 1) return 0;
    }
    int z = T.getFst(x);
    return a == z;
}

vi v;

void stuff() {
    T.upd(v.back(),-1);
    v.pop_back();
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n; v.resize(n);
    F0R(i,n) {
        cin >> v[i];
        T.upd(v[i],1);
    }
    int ans = 0;
    while (sz(v)) {
        fixe = 0;
        while (sz(v) > 1 && nex(v[sz(v)-2],v[sz(v)-1])) {
            if (v[sz(v)-2] != v[sz(v)-1]) fixe = 1;
            stuff();
        }
        stuff(); ans ++;
    }
    cout << ans;
}

/* 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
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 7 ms 4328 KB Output is correct
3 Correct 5 ms 4404 KB Output is correct
4 Correct 5 ms 4480 KB Output is correct
5 Correct 5 ms 4480 KB Output is correct
6 Correct 5 ms 4548 KB Output is correct
7 Correct 5 ms 4548 KB Output is correct
8 Correct 4 ms 4548 KB Output is correct
9 Correct 7 ms 4548 KB Output is correct
10 Correct 5 ms 4548 KB Output is correct
11 Correct 6 ms 4548 KB Output is correct
12 Correct 6 ms 4676 KB Output is correct
13 Correct 5 ms 4676 KB Output is correct
14 Correct 5 ms 4676 KB Output is correct
15 Correct 5 ms 4676 KB Output is correct
16 Correct 5 ms 4676 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 7 ms 4328 KB Output is correct
3 Correct 5 ms 4404 KB Output is correct
4 Correct 5 ms 4480 KB Output is correct
5 Correct 5 ms 4480 KB Output is correct
6 Correct 5 ms 4548 KB Output is correct
7 Correct 5 ms 4548 KB Output is correct
8 Correct 4 ms 4548 KB Output is correct
9 Correct 7 ms 4548 KB Output is correct
10 Correct 5 ms 4548 KB Output is correct
11 Correct 6 ms 4548 KB Output is correct
12 Correct 6 ms 4676 KB Output is correct
13 Correct 5 ms 4676 KB Output is correct
14 Correct 5 ms 4676 KB Output is correct
15 Correct 5 ms 4676 KB Output is correct
16 Correct 5 ms 4676 KB Output is correct
17 Correct 6 ms 4676 KB Output is correct
18 Correct 5 ms 4676 KB Output is correct
19 Correct 6 ms 4676 KB Output is correct
20 Correct 5 ms 4676 KB Output is correct
21 Correct 6 ms 4676 KB Output is correct
22 Correct 6 ms 4676 KB Output is correct
23 Correct 6 ms 4676 KB Output is correct
24 Correct 5 ms 4676 KB Output is correct
25 Correct 6 ms 4676 KB Output is correct
26 Correct 5 ms 4676 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 7 ms 4328 KB Output is correct
3 Correct 5 ms 4404 KB Output is correct
4 Correct 5 ms 4480 KB Output is correct
5 Correct 5 ms 4480 KB Output is correct
6 Correct 5 ms 4548 KB Output is correct
7 Correct 5 ms 4548 KB Output is correct
8 Correct 4 ms 4548 KB Output is correct
9 Correct 7 ms 4548 KB Output is correct
10 Correct 5 ms 4548 KB Output is correct
11 Correct 6 ms 4548 KB Output is correct
12 Correct 6 ms 4676 KB Output is correct
13 Correct 5 ms 4676 KB Output is correct
14 Correct 5 ms 4676 KB Output is correct
15 Correct 5 ms 4676 KB Output is correct
16 Correct 5 ms 4676 KB Output is correct
17 Correct 6 ms 4676 KB Output is correct
18 Correct 5 ms 4676 KB Output is correct
19 Correct 6 ms 4676 KB Output is correct
20 Correct 5 ms 4676 KB Output is correct
21 Correct 6 ms 4676 KB Output is correct
22 Correct 6 ms 4676 KB Output is correct
23 Correct 6 ms 4676 KB Output is correct
24 Correct 5 ms 4676 KB Output is correct
25 Correct 6 ms 4676 KB Output is correct
26 Correct 5 ms 4676 KB Output is correct
27 Correct 6 ms 4676 KB Output is correct
28 Correct 6 ms 4676 KB Output is correct
29 Correct 5 ms 4676 KB Output is correct
30 Correct 5 ms 4676 KB Output is correct
31 Correct 7 ms 4676 KB Output is correct
32 Correct 6 ms 4676 KB Output is correct
33 Correct 5 ms 4676 KB Output is correct
34 Correct 8 ms 4676 KB Output is correct
35 Correct 5 ms 4676 KB Output is correct
36 Correct 6 ms 4676 KB Output is correct
37 Correct 6 ms 4676 KB Output is correct
38 Correct 6 ms 4676 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 7 ms 4328 KB Output is correct
3 Correct 5 ms 4404 KB Output is correct
4 Correct 5 ms 4480 KB Output is correct
5 Correct 5 ms 4480 KB Output is correct
6 Correct 5 ms 4548 KB Output is correct
7 Correct 5 ms 4548 KB Output is correct
8 Correct 4 ms 4548 KB Output is correct
9 Correct 7 ms 4548 KB Output is correct
10 Correct 5 ms 4548 KB Output is correct
11 Correct 6 ms 4548 KB Output is correct
12 Correct 6 ms 4676 KB Output is correct
13 Correct 5 ms 4676 KB Output is correct
14 Correct 5 ms 4676 KB Output is correct
15 Correct 5 ms 4676 KB Output is correct
16 Correct 5 ms 4676 KB Output is correct
17 Correct 6 ms 4676 KB Output is correct
18 Correct 5 ms 4676 KB Output is correct
19 Correct 6 ms 4676 KB Output is correct
20 Correct 5 ms 4676 KB Output is correct
21 Correct 6 ms 4676 KB Output is correct
22 Correct 6 ms 4676 KB Output is correct
23 Correct 6 ms 4676 KB Output is correct
24 Correct 5 ms 4676 KB Output is correct
25 Correct 6 ms 4676 KB Output is correct
26 Correct 5 ms 4676 KB Output is correct
27 Correct 6 ms 4676 KB Output is correct
28 Correct 6 ms 4676 KB Output is correct
29 Correct 5 ms 4676 KB Output is correct
30 Correct 5 ms 4676 KB Output is correct
31 Correct 7 ms 4676 KB Output is correct
32 Correct 6 ms 4676 KB Output is correct
33 Correct 5 ms 4676 KB Output is correct
34 Correct 8 ms 4676 KB Output is correct
35 Correct 5 ms 4676 KB Output is correct
36 Correct 6 ms 4676 KB Output is correct
37 Correct 6 ms 4676 KB Output is correct
38 Correct 6 ms 4676 KB Output is correct
39 Correct 118 ms 6396 KB Output is correct
40 Correct 246 ms 7548 KB Output is correct
41 Correct 100 ms 7548 KB Output is correct
42 Correct 121 ms 7548 KB Output is correct
43 Correct 71 ms 7548 KB Output is correct
44 Correct 311 ms 8468 KB Output is correct
45 Correct 402 ms 8468 KB Output is correct
46 Correct 346 ms 8468 KB Output is correct
47 Correct 248 ms 8468 KB Output is correct
48 Correct 278 ms 8468 KB Output is correct
49 Correct 474 ms 8468 KB Output is correct
50 Correct 513 ms 15372 KB Output is correct
51 Correct 475 ms 21948 KB Output is correct
52 Correct 426 ms 28808 KB Output is correct
53 Correct 467 ms 35692 KB Output is correct
54 Correct 441 ms 42296 KB Output is correct
55 Correct 620 ms 49060 KB Output is correct
56 Correct 687 ms 55676 KB Output is correct
57 Correct 710 ms 62532 KB Output is correct
58 Correct 731 ms 69232 KB Output is correct
59 Correct 663 ms 75908 KB Output is correct
60 Correct 694 ms 82780 KB Output is correct
61 Correct 746 ms 89524 KB Output is correct
62 Correct 626 ms 96192 KB Output is correct