oj.uz

Submission #730081

# Submission time Handle Problem Language Result Execution time Memory
730081 2023-04-25T08:38:26 Z Sam_a17 Fish 2 (JOI22_fish2) C++17
13 / 100
 4000 ms 19796 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(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
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(deque <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 << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// 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 != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "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 = 1e5 + 10;
int a[N], n, q, ok[N];

struct segTreeMin {
  vector<long long> mTree;
  int size;
 
  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, 0);
  }
 
  void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      mTree[x] = v;
      return;
    }
 
    int m = (lx + rx) / 2;
    if(u < m) {
      upd(u, v, 2 * x + 1, lx, m);
    }else {
      upd(u, v, 2 * x + 2, m, rx);
    }
    mTree[x] = mTree[2 * x + 1] + mTree[2 * x + 2];
  }
 
  void upd(int u, long long v) {
    upd(u, v, 0, 0, size);
  }
 
  long long qry (int l, int r, int x, int lx, int rx) { // range queries
    if(l >= rx || lx >= r) {
      return 0;
    }
    if(lx >= l && r >= rx) {
      return mTree[x];
    }
 
    int m = (rx + lx) / 2;
    long long s1 = qry(l, r, 2 * x + 1, lx, m);
    long long s2 = qry(l, r, 2 * x + 2, m, rx);
    return s1 + s2;
  }
 
  long long qry(int l, int r) {
    return qry(l, r, 0, 0, size);
  }
};

segTreeMin seg;

void solve_() {
  cin >> n;

  seg.init(n + 10);
  for(int i = 1; i <= n; i++) {
    cin >> a[i];
    seg.upd(i, a[i]);
  }

  int q; cin >> q;
  while(q--) {
    int type; cin >> type;

    if(type == 1) {
      int x, y; cin >> x >> y;
      a[x] = y;
      seg.upd(x, y);
    } else {
      int l, r; cin >> l >> r;
      map<int, vector<int>> mp;
      for(int i = l; i <= r; i++) {
        mp[-a[i]].push_back(i);
        ok[i] = false;
      }

      set<int> st;
      int it = 0, answ = 0;
      for(auto i: mp) {
        if(it != 0) {
          for(auto j: i.second) {
            int li = l - 1, ri = r + 1;
            auto it = st.lower_bound(j);
            if(it != st.end()) {
              ri = *it;
            }

            if(it != st.begin()) {
              it = prev(it);
              li = *it;
            }

            long long s = seg.qry(li + 1, ri);
            if(st.find(li) != st.end() && s >= a[li] && ok[li]) {
              ok[j] = true;
            }
            if(st.find(ri) != st.end() && s >= a[ri] && ok[ri]) {
              ok[j] = true;
            }
          }
        }

        for(auto j: i.second) {
          if(it == 0) ok[j] = true;

          if(ok[j]) answ++;
          st.insert(j);
        }
        it++;
      }

      cout << answ << '\n';
    }
  }


}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

fish2.cpp: In function 'void setIO(std::string)':
fish2.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((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fish2.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((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 22 ms 340 KB Output is correct
7 Correct 6 ms 380 KB Output is correct
8 Correct 17 ms 384 KB Output is correct
9 Correct 30 ms 336 KB Output is correct
10 Correct 18 ms 340 KB Output is correct
11 Correct 41 ms 416 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 27 ms 340 KB Output is correct
14 Correct 8 ms 340 KB Output is correct
15 Correct 16 ms 396 KB Output is correct
16 Correct 27 ms 384 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 31 ms 380 KB Output is correct
19 Correct 14 ms 396 KB Output is correct
20 Correct 66 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 109 ms 11124 KB Output is correct
3 Correct 93 ms 9084 KB Output is correct
4 Correct 109 ms 11140 KB Output is correct
5 Correct 80 ms 9136 KB Output is correct
6 Correct 184 ms 19796 KB Output is correct
7 Correct 80 ms 8712 KB Output is correct
8 Correct 202 ms 19728 KB Output is correct
9 Correct 65 ms 8776 KB Output is correct
10 Correct 99 ms 10384 KB Output is correct
11 Correct 67 ms 8804 KB Output is correct
12 Correct 66 ms 8588 KB Output is correct
13 Correct 66 ms 8668 KB Output is correct
14 Correct 67 ms 9028 KB Output is correct
15 Correct 86 ms 8936 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 22 ms 340 KB Output is correct
7 Correct 6 ms 380 KB Output is correct
8 Correct 17 ms 384 KB Output is correct
9 Correct 30 ms 336 KB Output is correct
10 Correct 18 ms 340 KB Output is correct
11 Correct 41 ms 416 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 27 ms 340 KB Output is correct
14 Correct 8 ms 340 KB Output is correct
15 Correct 16 ms 396 KB Output is correct
16 Correct 27 ms 384 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 31 ms 380 KB Output is correct
19 Correct 14 ms 396 KB Output is correct
20 Correct 66 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 109 ms 11124 KB Output is correct
23 Correct 93 ms 9084 KB Output is correct
24 Correct 109 ms 11140 KB Output is correct
25 Correct 80 ms 9136 KB Output is correct
26 Correct 184 ms 19796 KB Output is correct
27 Correct 80 ms 8712 KB Output is correct
28 Correct 202 ms 19728 KB Output is correct
29 Correct 65 ms 8776 KB Output is correct
30 Correct 99 ms 10384 KB Output is correct
31 Correct 67 ms 8804 KB Output is correct
32 Correct 66 ms 8588 KB Output is correct
33 Correct 66 ms 8668 KB Output is correct
34 Correct 67 ms 9028 KB Output is correct
35 Correct 86 ms 8936 KB Output is correct
36 Execution timed out 4104 ms 8980 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 109 ms 11124 KB Output is correct
3 Correct 93 ms 9084 KB Output is correct
4 Correct 109 ms 11140 KB Output is correct
5 Correct 80 ms 9136 KB Output is correct
6 Correct 184 ms 19796 KB Output is correct
7 Correct 80 ms 8712 KB Output is correct
8 Correct 202 ms 19728 KB Output is correct
9 Correct 65 ms 8776 KB Output is correct
10 Correct 99 ms 10384 KB Output is correct
11 Correct 67 ms 8804 KB Output is correct
12 Correct 66 ms 8588 KB Output is correct
13 Correct 66 ms 8668 KB Output is correct
14 Correct 67 ms 9028 KB Output is correct
15 Correct 86 ms 8936 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Execution timed out 4022 ms 8968 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 109 ms 11124 KB Output is correct
3 Correct 93 ms 9084 KB Output is correct
4 Correct 109 ms 11140 KB Output is correct
5 Correct 80 ms 9136 KB Output is correct
6 Correct 184 ms 19796 KB Output is correct
7 Correct 80 ms 8712 KB Output is correct
8 Correct 202 ms 19728 KB Output is correct
9 Correct 65 ms 8776 KB Output is correct
10 Correct 99 ms 10384 KB Output is correct
11 Correct 67 ms 8804 KB Output is correct
12 Correct 66 ms 8588 KB Output is correct
13 Correct 66 ms 8668 KB Output is correct
14 Correct 67 ms 9028 KB Output is correct
15 Correct 86 ms 8936 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Execution timed out 4054 ms 11444 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 22 ms 340 KB Output is correct
7 Correct 6 ms 380 KB Output is correct
8 Correct 17 ms 384 KB Output is correct
9 Correct 30 ms 336 KB Output is correct
10 Correct 18 ms 340 KB Output is correct
11 Correct 41 ms 416 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 27 ms 340 KB Output is correct
14 Correct 8 ms 340 KB Output is correct
15 Correct 16 ms 396 KB Output is correct
16 Correct 27 ms 384 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 31 ms 380 KB Output is correct
19 Correct 14 ms 396 KB Output is correct
20 Correct 66 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 109 ms 11124 KB Output is correct
23 Correct 93 ms 9084 KB Output is correct
24 Correct 109 ms 11140 KB Output is correct
25 Correct 80 ms 9136 KB Output is correct
26 Correct 184 ms 19796 KB Output is correct
27 Correct 80 ms 8712 KB Output is correct
28 Correct 202 ms 19728 KB Output is correct
29 Correct 65 ms 8776 KB Output is correct
30 Correct 99 ms 10384 KB Output is correct
31 Correct 67 ms 8804 KB Output is correct
32 Correct 66 ms 8588 KB Output is correct
33 Correct 66 ms 8668 KB Output is correct
34 Correct 67 ms 9028 KB Output is correct
35 Correct 86 ms 8936 KB Output is correct
36 Execution timed out 4104 ms 8980 KB Time limit exceeded
37 Halted 0 ms 0 KB -