답안 #57108 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57108	2018-07-14T03:28:53 Z	Benq	Money (IZhO17_money)	C++14	45 / 100	1500 ms	53000 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;

multiset<int> T;
int n;
bool fixe = 0;

bool nex(int a, int b) {
    auto it = prev(T.ub(b));
    if (it != T.begin() && *prev(it) == a) return 1;
    if (fixe) return 0;
    it = T.lb(b);
    if (it != T.begin() && *prev(it) == a) return 1;
    return 0;
}

vi v;

void stuff() {
    T.erase(T.find(v.back()));
    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.insert(v[i]);
    }
    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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	496 KB	Output is correct
3	Correct	2 ms	548 KB	Output is correct
4	Correct	2 ms	548 KB	Output is correct
5	Correct	3 ms	600 KB	Output is correct
6	Correct	3 ms	600 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	3 ms	600 KB	Output is correct
10	Correct	3 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	3 ms	600 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	3 ms	644 KB	Output is correct
16	Correct	2 ms	648 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	496 KB	Output is correct
3	Correct	2 ms	548 KB	Output is correct
4	Correct	2 ms	548 KB	Output is correct
5	Correct	3 ms	600 KB	Output is correct
6	Correct	3 ms	600 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	3 ms	600 KB	Output is correct
10	Correct	3 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	3 ms	600 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	3 ms	644 KB	Output is correct
16	Correct	2 ms	648 KB	Output is correct
17	Correct	3 ms	652 KB	Output is correct
18	Correct	3 ms	664 KB	Output is correct
19	Correct	3 ms	664 KB	Output is correct
20	Correct	2 ms	664 KB	Output is correct
21	Correct	3 ms	668 KB	Output is correct
22	Correct	3 ms	672 KB	Output is correct
23	Correct	2 ms	676 KB	Output is correct
24	Correct	3 ms	680 KB	Output is correct
25	Correct	3 ms	684 KB	Output is correct
26	Correct	3 ms	688 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	496 KB	Output is correct
3	Correct	2 ms	548 KB	Output is correct
4	Correct	2 ms	548 KB	Output is correct
5	Correct	3 ms	600 KB	Output is correct
6	Correct	3 ms	600 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	3 ms	600 KB	Output is correct
10	Correct	3 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	3 ms	600 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	3 ms	644 KB	Output is correct
16	Correct	2 ms	648 KB	Output is correct
17	Correct	3 ms	652 KB	Output is correct
18	Correct	3 ms	664 KB	Output is correct
19	Correct	3 ms	664 KB	Output is correct
20	Correct	2 ms	664 KB	Output is correct
21	Correct	3 ms	668 KB	Output is correct
22	Correct	3 ms	672 KB	Output is correct
23	Correct	2 ms	676 KB	Output is correct
24	Correct	3 ms	680 KB	Output is correct
25	Correct	3 ms	684 KB	Output is correct
26	Correct	3 ms	688 KB	Output is correct
27	Correct	3 ms	704 KB	Output is correct
28	Correct	2 ms	704 KB	Output is correct
29	Correct	3 ms	704 KB	Output is correct
30	Correct	2 ms	704 KB	Output is correct
31	Correct	2 ms	708 KB	Output is correct
32	Correct	3 ms	716 KB	Output is correct
33	Correct	3 ms	716 KB	Output is correct
34	Correct	3 ms	720 KB	Output is correct
35	Correct	2 ms	720 KB	Output is correct
36	Correct	4 ms	720 KB	Output is correct
37	Correct	3 ms	760 KB	Output is correct
38	Correct	2 ms	760 KB	Output is correct

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	496 KB	Output is correct
3	Correct	2 ms	548 KB	Output is correct
4	Correct	2 ms	548 KB	Output is correct
5	Correct	3 ms	600 KB	Output is correct
6	Correct	3 ms	600 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	3 ms	600 KB	Output is correct
10	Correct	3 ms	600 KB	Output is correct
11	Correct	2 ms	600 KB	Output is correct
12	Correct	3 ms	600 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	3 ms	644 KB	Output is correct
16	Correct	2 ms	648 KB	Output is correct
17	Correct	3 ms	652 KB	Output is correct
18	Correct	3 ms	664 KB	Output is correct
19	Correct	3 ms	664 KB	Output is correct
20	Correct	2 ms	664 KB	Output is correct
21	Correct	3 ms	668 KB	Output is correct
22	Correct	3 ms	672 KB	Output is correct
23	Correct	2 ms	676 KB	Output is correct
24	Correct	3 ms	680 KB	Output is correct
25	Correct	3 ms	684 KB	Output is correct
26	Correct	3 ms	688 KB	Output is correct
27	Correct	3 ms	704 KB	Output is correct
28	Correct	2 ms	704 KB	Output is correct
29	Correct	3 ms	704 KB	Output is correct
30	Correct	2 ms	704 KB	Output is correct
31	Correct	2 ms	708 KB	Output is correct
32	Correct	3 ms	716 KB	Output is correct
33	Correct	3 ms	716 KB	Output is correct
34	Correct	3 ms	720 KB	Output is correct
35	Correct	2 ms	720 KB	Output is correct
36	Correct	4 ms	720 KB	Output is correct
37	Correct	3 ms	760 KB	Output is correct
38	Correct	2 ms	760 KB	Output is correct
39	Correct	429 ms	26584 KB	Output is correct
40	Correct	889 ms	42092 KB	Output is correct
41	Correct	265 ms	42092 KB	Output is correct
42	Correct	325 ms	42092 KB	Output is correct
43	Correct	260 ms	42092 KB	Output is correct
44	Correct	904 ms	52884 KB	Output is correct
45	Correct	812 ms	52916 KB	Output is correct
46	Correct	1057 ms	52916 KB	Output is correct
47	Correct	830 ms	53000 KB	Output is correct
48	Correct	663 ms	53000 KB	Output is correct
49	Execution timed out	1582 ms	53000 KB	Time limit exceeded
50	Halted	0 ms	0 KB	-

답안 #57108

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0