답안 #57109 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57109	2018-07-14T03:33:18 Z	Benq	Money (IZhO17_money)	C++14	25 / 100	9 ms	8612 KB

money

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

Compilation message

money.cpp: In instantiation of 'int BIT<T, SZ>::getFst(int) [with T = int; int SZ = 1000000]':
money.cpp:81:23:   required from here
money.cpp:55:35: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
         F0Rd(i,20) if (cur^(1<<i) <= SZ && bit[cur^(1<<i)] < x) {
                            ~~~~~~~^~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	7 ms	4328 KB	Output is correct
3	Correct	5 ms	4408 KB	Output is correct
4	Correct	6 ms	4488 KB	Output is correct
5	Correct	6 ms	4560 KB	Output is correct
6	Correct	7 ms	4560 KB	Output is correct
7	Correct	5 ms	4560 KB	Output is correct
8	Correct	5 ms	4592 KB	Output is correct
9	Correct	3 ms	4592 KB	Output is correct
10	Correct	6 ms	4592 KB	Output is correct
11	Correct	5 ms	4592 KB	Output is correct
12	Correct	6 ms	4592 KB	Output is correct
13	Correct	5 ms	4592 KB	Output is correct
14	Correct	4 ms	4592 KB	Output is correct
15	Correct	6 ms	4592 KB	Output is correct
16	Correct	6 ms	4592 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	7 ms	4328 KB	Output is correct
3	Correct	5 ms	4408 KB	Output is correct
4	Correct	6 ms	4488 KB	Output is correct
5	Correct	6 ms	4560 KB	Output is correct
6	Correct	7 ms	4560 KB	Output is correct
7	Correct	5 ms	4560 KB	Output is correct
8	Correct	5 ms	4592 KB	Output is correct
9	Correct	3 ms	4592 KB	Output is correct
10	Correct	6 ms	4592 KB	Output is correct
11	Correct	5 ms	4592 KB	Output is correct
12	Correct	6 ms	4592 KB	Output is correct
13	Correct	5 ms	4592 KB	Output is correct
14	Correct	4 ms	4592 KB	Output is correct
15	Correct	6 ms	4592 KB	Output is correct
16	Correct	6 ms	4592 KB	Output is correct
17	Correct	8 ms	4592 KB	Output is correct
18	Correct	6 ms	4592 KB	Output is correct
19	Correct	6 ms	4592 KB	Output is correct
20	Correct	6 ms	4592 KB	Output is correct
21	Correct	6 ms	4592 KB	Output is correct
22	Correct	6 ms	4592 KB	Output is correct
23	Correct	6 ms	4592 KB	Output is correct
24	Correct	5 ms	4592 KB	Output is correct
25	Correct	7 ms	4592 KB	Output is correct
26	Correct	6 ms	4592 KB	Output is correct

Subtask #3
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	7 ms	4328 KB	Output is correct
3	Correct	5 ms	4408 KB	Output is correct
4	Correct	6 ms	4488 KB	Output is correct
5	Correct	6 ms	4560 KB	Output is correct
6	Correct	7 ms	4560 KB	Output is correct
7	Correct	5 ms	4560 KB	Output is correct
8	Correct	5 ms	4592 KB	Output is correct
9	Correct	3 ms	4592 KB	Output is correct
10	Correct	6 ms	4592 KB	Output is correct
11	Correct	5 ms	4592 KB	Output is correct
12	Correct	6 ms	4592 KB	Output is correct
13	Correct	5 ms	4592 KB	Output is correct
14	Correct	4 ms	4592 KB	Output is correct
15	Correct	6 ms	4592 KB	Output is correct
16	Correct	6 ms	4592 KB	Output is correct
17	Correct	8 ms	4592 KB	Output is correct
18	Correct	6 ms	4592 KB	Output is correct
19	Correct	6 ms	4592 KB	Output is correct
20	Correct	6 ms	4592 KB	Output is correct
21	Correct	6 ms	4592 KB	Output is correct
22	Correct	6 ms	4592 KB	Output is correct
23	Correct	6 ms	4592 KB	Output is correct
24	Correct	5 ms	4592 KB	Output is correct
25	Correct	7 ms	4592 KB	Output is correct
26	Correct	6 ms	4592 KB	Output is correct
27	Correct	6 ms	4592 KB	Output is correct
28	Correct	6 ms	4592 KB	Output is correct
29	Correct	5 ms	4592 KB	Output is correct
30	Correct	5 ms	4592 KB	Output is correct
31	Correct	7 ms	4592 KB	Output is correct
32	Correct	6 ms	4592 KB	Output is correct
33	Correct	7 ms	4592 KB	Output is correct
34	Correct	6 ms	4592 KB	Output is correct
35	Correct	7 ms	4592 KB	Output is correct
36	Correct	6 ms	4592 KB	Output is correct
37	Runtime error	9 ms	8612 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
38	Halted	0 ms	0 KB	-

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	4216 KB	Output is correct
2	Correct	7 ms	4328 KB	Output is correct
3	Correct	5 ms	4408 KB	Output is correct
4	Correct	6 ms	4488 KB	Output is correct
5	Correct	6 ms	4560 KB	Output is correct
6	Correct	7 ms	4560 KB	Output is correct
7	Correct	5 ms	4560 KB	Output is correct
8	Correct	5 ms	4592 KB	Output is correct
9	Correct	3 ms	4592 KB	Output is correct
10	Correct	6 ms	4592 KB	Output is correct
11	Correct	5 ms	4592 KB	Output is correct
12	Correct	6 ms	4592 KB	Output is correct
13	Correct	5 ms	4592 KB	Output is correct
14	Correct	4 ms	4592 KB	Output is correct
15	Correct	6 ms	4592 KB	Output is correct
16	Correct	6 ms	4592 KB	Output is correct
17	Correct	8 ms	4592 KB	Output is correct
18	Correct	6 ms	4592 KB	Output is correct
19	Correct	6 ms	4592 KB	Output is correct
20	Correct	6 ms	4592 KB	Output is correct
21	Correct	6 ms	4592 KB	Output is correct
22	Correct	6 ms	4592 KB	Output is correct
23	Correct	6 ms	4592 KB	Output is correct
24	Correct	5 ms	4592 KB	Output is correct
25	Correct	7 ms	4592 KB	Output is correct
26	Correct	6 ms	4592 KB	Output is correct
27	Correct	6 ms	4592 KB	Output is correct
28	Correct	6 ms	4592 KB	Output is correct
29	Correct	5 ms	4592 KB	Output is correct
30	Correct	5 ms	4592 KB	Output is correct
31	Correct	7 ms	4592 KB	Output is correct
32	Correct	6 ms	4592 KB	Output is correct
33	Correct	7 ms	4592 KB	Output is correct
34	Correct	6 ms	4592 KB	Output is correct
35	Correct	7 ms	4592 KB	Output is correct
36	Correct	6 ms	4592 KB	Output is correct
37	Runtime error	9 ms	8612 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
38	Halted	0 ms	0 KB	-

답안 #57109

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 20.0

Subtask #4
0 / 55.0