oj.uz

Submission #679012

# Submission time Handle Problem Language Result Execution time Memory
679012 2023-01-07T07:56:51 Z Sam_a17 Money (IZhO17_money) C++17
100 / 100
 163 ms 12504 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << 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(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e6 + 10;
int n, a[N];

struct fenwick {
  int n;
  vector<int> tr;

  void init(int m) {
    n = m, tr.assign(m + 1, 0);
  }

  void upd(int u, long long value) {
    while(u <= n) {
      tr[u] += value;
      u += u & (-u);
    }
  }
  
  long long qry(int u) {
    long long s = 0;
    while(u > 0) {
      s += tr[u];
      u -= u & (-u);
    }
    return s;
  }
  
  long long sum(int l, int r) {
    if(l > r) {
      return 0;
    }
    return qry(r) - qry(l - 1);
  }
} ft;

void solve_() {
  cin >> n;
  ft.init(1e6 + 10);

  for(int i = 1; i <= n; i++) {
    cin >> a[i];
  }

  int last = 1, answ = 0;
  for(int i = 2; i <= n; i++) {
    if(a[i - 1] > a[i] || ft.sum(a[last] + 1, a[i] - 1) > 0) {
      answ++;
      for(int j = last; j < i; j++) {
        ft.upd(a[j], 1);
      }
      last = i;
    }
  }

  cout << answ + 1 << '\n';
}
 
int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      // cout << "Case #" << i << ": ";
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

money.cpp: In function 'void setIO(std::string)':
money.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
money.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4172 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 3 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4184 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4172 KB Output is correct
13 Correct 3 ms 4224 KB Output is correct
14 Correct 2 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4156 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4172 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 3 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4184 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4172 KB Output is correct
13 Correct 3 ms 4224 KB Output is correct
14 Correct 2 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4156 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4172 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 3 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4184 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4172 KB Output is correct
13 Correct 3 ms 4224 KB Output is correct
14 Correct 2 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4156 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 2 ms 4180 KB Output is correct
29 Correct 3 ms 4176 KB Output is correct
30 Correct 3 ms 4180 KB Output is correct
31 Correct 2 ms 4212 KB Output is correct
32 Correct 2 ms 4180 KB Output is correct
33 Correct 2 ms 4180 KB Output is correct
34 Correct 2 ms 4176 KB Output is correct
35 Correct 3 ms 4180 KB Output is correct
36 Correct 2 ms 4180 KB Output is correct
37 Correct 2 ms 4180 KB Output is correct
38 Correct 3 ms 4180 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4172 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 3 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4184 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4172 KB Output is correct
13 Correct 3 ms 4224 KB Output is correct
14 Correct 2 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4156 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4180 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4180 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 2 ms 4180 KB Output is correct
29 Correct 3 ms 4176 KB Output is correct
30 Correct 3 ms 4180 KB Output is correct
31 Correct 2 ms 4212 KB Output is correct
32 Correct 2 ms 4180 KB Output is correct
33 Correct 2 ms 4180 KB Output is correct
34 Correct 2 ms 4176 KB Output is correct
35 Correct 3 ms 4180 KB Output is correct
36 Correct 2 ms 4180 KB Output is correct
37 Correct 2 ms 4180 KB Output is correct
38 Correct 3 ms 4180 KB Output is correct
39 Correct 64 ms 9292 KB Output is correct
40 Correct 98 ms 11640 KB Output is correct
41 Correct 45 ms 8296 KB Output is correct
42 Correct 48 ms 7868 KB Output is correct
43 Correct 31 ms 6840 KB Output is correct
44 Correct 144 ms 12396 KB Output is correct
45 Correct 145 ms 12488 KB Output is correct
46 Correct 121 ms 12420 KB Output is correct
47 Correct 114 ms 12388 KB Output is correct
48 Correct 131 ms 12492 KB Output is correct
49 Correct 144 ms 12448 KB Output is correct
50 Correct 124 ms 12504 KB Output is correct
51 Correct 149 ms 12436 KB Output is correct
52 Correct 128 ms 12456 KB Output is correct
53 Correct 146 ms 12484 KB Output is correct
54 Correct 127 ms 12412 KB Output is correct
55 Correct 151 ms 12468 KB Output is correct
56 Correct 141 ms 12392 KB Output is correct
57 Correct 142 ms 12460 KB Output is correct
58 Correct 131 ms 12476 KB Output is correct
59 Correct 163 ms 12416 KB Output is correct
60 Correct 143 ms 12500 KB Output is correct
61 Correct 140 ms 12492 KB Output is correct
62 Correct 154 ms 12424 KB Output is correct