oj.uz

Submission #554652

# Submission time Handle Problem Language Result Execution time Memory
554652 2022-04-29T03:56:48 Z SmolBrain Money (IZhO17_money) C++17
100 / 100
 967 ms 51676 KB 
// Om Namah Shivaya
// GM in 96 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    // reference code: https://oj.uz/submission/553185
    int n; cin >> n;
    vector<int> a(n + 5, inf1);
    rep1(i, n) cin >> a[i];

    set<int> st;
    int mx = -1;
    int ans = 0;

    rep1(i, n) {
        if (a[i] < a[i - 1] or a[i] > mx) {
            ans++;
            auto it = st.upper_bound(a[i]);
            if (it != st.end()) mx = *it;
            else mx = inf1;
        }

        st.insert(a[i]);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

money.cpp: In function 'void usaco(std::string)':
money.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
money.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 216 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 1 ms 216 KB Output is correct
15 Correct 1 ms 216 KB Output is correct
16 Correct 1 ms 216 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 216 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 1 ms 216 KB Output is correct
15 Correct 1 ms 216 KB Output is correct
16 Correct 1 ms 216 KB Output is correct
17 Correct 1 ms 216 KB Output is correct
18 Correct 0 ms 216 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 216 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 1 ms 216 KB Output is correct
15 Correct 1 ms 216 KB Output is correct
16 Correct 1 ms 216 KB Output is correct
17 Correct 1 ms 216 KB Output is correct
18 Correct 0 ms 216 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 212 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 216 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 216 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 1 ms 216 KB Output is correct
15 Correct 1 ms 216 KB Output is correct
16 Correct 1 ms 216 KB Output is correct
17 Correct 1 ms 216 KB Output is correct
18 Correct 0 ms 216 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 47 ms 2500 KB Output is correct
40 Correct 82 ms 3796 KB Output is correct
41 Correct 36 ms 2132 KB Output is correct
42 Correct 37 ms 2008 KB Output is correct
43 Correct 26 ms 1624 KB Output is correct
44 Correct 96 ms 4544 KB Output is correct
45 Correct 104 ms 4572 KB Output is correct
46 Correct 98 ms 4596 KB Output is correct
47 Correct 84 ms 4568 KB Output is correct
48 Correct 86 ms 4608 KB Output is correct
49 Correct 378 ms 23016 KB Output is correct
50 Correct 412 ms 23040 KB Output is correct
51 Correct 408 ms 23040 KB Output is correct
52 Correct 378 ms 23048 KB Output is correct
53 Correct 378 ms 23044 KB Output is correct
54 Correct 388 ms 23068 KB Output is correct
55 Correct 930 ms 51676 KB Output is correct
56 Correct 929 ms 51616 KB Output is correct
57 Correct 919 ms 51548 KB Output is correct
58 Correct 924 ms 51616 KB Output is correct
59 Correct 942 ms 51532 KB Output is correct
60 Correct 967 ms 51536 KB Output is correct
61 Correct 923 ms 51584 KB Output is correct
62 Correct 932 ms 51468 KB Output is correct