Submission #758158

# Submission time Handle Problem Language Result Execution time Memory
758158 2023-06-14T08:24:53 Z vjudge1 Money (IZhO17_money) C++17
100 / 100
673 ms 30692 KB
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
 
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
 
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
 
 
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <fstream>
#define endl '\n'
#define int long long
using namespace std;
int seg[3000001],a[1000001];
int N,Left,Right;


void Update(int pos){
    int ind = N + pos - 1;
    seg[ind]++;
    while(ind /= 2) seg[ind] = seg[ind * 2 + 1] + seg[ind * 2];
}

int Query(int l = 1, int r = N, int ind = 1){
    if(l > Right or r < Left) return 0;
    if(l >= Left and r <= Right) return seg[ind];
    int mid = (l + r ) / 2;
    return Query(l, mid, ind * 2) + Query(mid + 1, r, ind * 2 + 1);
}


signed main() {
    int n, ans = 0; cin >> n;
    N = exp2(ceil(log2(1e6)));
    for(int i = 0; i < n; i++) cin >> a[i];
    
    
    int v = a[0];
    vector<int>k;
    Update(v);
    for(int i = 1; i < n; i++){
        if(a[i] >= a[i - 1]){
            Left = v + 1; Right = a[i] - 1;
            if(Query() == 0) {
                k.push_back(a[i]);
                continue;
            }
        }
        ans++;
        v = a[i];
        for(auto s : k) Update(s);
        k.clear();
        k.push_back(a[i]);
    }
    cout << ans + 1;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 568 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 564 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 432 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 568 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 564 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 432 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 692 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 2 ms 3284 KB Output is correct
38 Correct 3 ms 3252 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 568 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 564 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 432 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 692 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 2 ms 3284 KB Output is correct
38 Correct 3 ms 3252 KB Output is correct
39 Correct 214 ms 7452 KB Output is correct
40 Correct 356 ms 12172 KB Output is correct
41 Correct 172 ms 6092 KB Output is correct
42 Correct 158 ms 5708 KB Output is correct
43 Correct 112 ms 4300 KB Output is correct
44 Correct 455 ms 15064 KB Output is correct
45 Correct 468 ms 15052 KB Output is correct
46 Correct 479 ms 15276 KB Output is correct
47 Correct 427 ms 15056 KB Output is correct
48 Correct 451 ms 15136 KB Output is correct
49 Correct 590 ms 30692 KB Output is correct
50 Correct 518 ms 30576 KB Output is correct
51 Correct 548 ms 30668 KB Output is correct
52 Correct 537 ms 30580 KB Output is correct
53 Correct 556 ms 30496 KB Output is correct
54 Correct 583 ms 30420 KB Output is correct
55 Correct 673 ms 30524 KB Output is correct
56 Correct 611 ms 30524 KB Output is correct
57 Correct 630 ms 30552 KB Output is correct
58 Correct 644 ms 30528 KB Output is correct
59 Correct 645 ms 30544 KB Output is correct
60 Correct 640 ms 30504 KB Output is correct
61 Correct 637 ms 30528 KB Output is correct
62 Correct 640 ms 30524 KB Output is correct