oj.uz

Submission #861442

# Submission time Handle Problem Language Result Execution time Memory
861442 2023-10-16T08:03:38 Z Vanilla Money (IZhO17_money) C++17
0 / 100
 0 ms 504 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return (a + b - 1) / b;}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 1e6 + 2;
int a [maxn];

void solve(int id){

  return;
}


int main(){
  ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++){
    cin >> a[i];
  }
  multiset <pii> s;
  int l = 1;
  for (int i = 2; i <= n; i++){
    if (a[i] < a[i-1]) {
      s.insert({a[1], a[i-1]});
      s.insert({0, a[1]});
      s.insert({a[i-1], 1e9});
      l = i;
      break;
    }
  }
  int rs = 1;
  auto fit = [&] (int mn, int mx) {
    auto it = --s.upper_bound({mn, 1e9});
    // cerr << "> " << mn << " " << mx << " " << it->first << " " << it->second << "\n";
    if (it->second >= mx) return 1;
    return 0;
  };
  for (int i = l + 1; i <= n; i++){
    if (a[i] < a[i-1] || !fit(a[l], a[i])) {
      // cerr << l << " " << i - 1 << "\n";
      // for (auto [x, y]: s) {
      //   cerr << x << " " << y << "\n";
      // }
      // cerr << "\n";
      auto it = --s.upper_bound({a[l], 1e9});
      int low = it->first, high = it->second;
      // cerr << low << " " << high << "\n";
      s.erase(it);
      s.insert({low, a[l]});
      s.insert({a[i-1], high});
      l = i;
      rs++;
    }
  }
  cout << rs + 1;
  return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -