oj.uz

Submission #547752

# Submission time Handle Problem Language Result Execution time Memory
547752 2022-04-11T15:15:28 Z cig32 Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 452 ms 28244 KB 
#include "bubblesort2.h"
 
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<long long, long long>, null_type, less<pair<long long, long long> >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int long long
const int lmao = 4001000;
int qwq = 1000003;
struct node {
  long long upd = 0, val = 0;
} st[lmao];
 
void u(int l, int r, int constl, int constr, int idx, long long val) {
  if(l <= constl && constr <= r) {
    st[idx].upd += val;
    st[idx].val += val;
    return;
  }
  int mid = (constl + constr) >> 1;
  st[2*idx+1].upd += st[idx].upd;
  st[2*idx+2].upd += st[idx].upd;
  st[2*idx+1].val += st[idx].upd;
  st[2*idx+2].val += st[idx].upd;
  st[idx].upd = 0;
  if(mid < l || r < constl) u(l, r, mid+1, constr, 2*idx+2, val);
  else if(constr < l || r < mid+1) u(l, r, constl, mid, 2*idx+1, val);
  else {
    u(l, r, constl, mid, 2*idx + 1, val);
    u(l, r, mid+1, constr, 2*idx + 2, val);
  }
  st[idx].val = max(st[2*idx+1].val, st[2*idx+2].val);
}
 
long long qu(int l, int r, int constl, int constr, int idx) {
  if(l <= constl && constr <= r) return st[idx].val;
  int mid = (constl + constr) >> 1;
  st[2*idx+1].upd += st[idx].upd;
  st[2*idx+2].upd += st[idx].upd;
  st[2*idx+1].val += st[idx].upd;
  st[2*idx+2].val += st[idx].upd;
  st[idx].upd = 0;
  if(mid < l || r < constl) return qu(l, r, mid+1, constr, 2*idx+2);
  else if(constr < l || r < mid+1) return qu(l, r, constl, mid, 2*idx+1);
  else {
    return max(qu(l, r, constl, mid, 2*idx+1), qu(l, r, mid+1, constr, 2*idx+2));
  }
}
 
void range_add(int l, int r, long long v) {
  u(l, r, 0, qwq, 0, v);
}
 
long long query_max(int l, int r) {
  return qu(l, r, 0, qwq, 0);
}
 
std::vector<int32_t> countScans(std::vector<int32_t> A,std::vector<int32_t> X,std::vector<int32_t> V){
  ordered_set ost;
  int N=A.size();
	int Q=X.size();
	std::vector<int32_t> answer(Q);
  set<int> s;
  for(int i=0; i<N; i++) {
    s.insert(A[i]);
  }
  for(int i=0; i<Q; i++) s.insert(V[i]);
  map<int, int> is;
  int nxt = 0;
  for(int x: s) {
    is[x] = nxt++;
  }
  for(int i=0; i<N; i++) A[i] = is[A[i]];
  for(int i=0; i<Q; i++) V[i] = is[V[i]];
  for(int i=0; i<N; i++) ost.insert({A[i], i});
  pair<int, int> B[N];
  for(int i=0; i<N; i++) {
    B[i] = {A[i], i};
  }
  sort(B, B+N);
  multiset<pair<long long, long long> > ms[N+Q];
  map<long long, long long> ono[N+Q];
  for(int i=0; i<N; i++) {
    ms[B[i].first].insert({B[i].second - i, B[i].second});
    ono[B[i].first][B[i].second] = B[i].second - i;
  }
  for(int i=0; i<N+Q; i++) {
    if(ms[i].empty()) {
      range_add(i, i, -1e10);
    }
    else {
      range_add(i, i, (*ms[i].rbegin()).first);
    }
  }
  for(int i=0; i<Q; i++) { 
    int x = A[X[i]];
    int y = V[i];
    if(A[X[i]] == V[i]) {
      answer[i] = query_max(0, N+Q - 1);
      continue;
    }
    if(x > y) swap(x, y);
    if(x + 1 < y) {
      if(A[X[i]] > V[i]) {
        range_add(x+1, y-1, -1);
      }
      else {
        range_add(x+1, y-1, 1);
      }
    }
    x = A[X[i]];
    y = V[i];
    int one = ms[x].size();
    ms[x].erase({ono[x][X[i]], X[i]});
    int two = ms[x].size();
    assert(one != two);
    if(ms[x].size()) {
      long long ogname = query_max(x, x);
      long long q = (*ms[x].rbegin()).second;
      ost.erase({x, X[i]});
      ost.insert({y, X[i]});
      range_add(x, x, q - (int)ost.order_of_key({A[q], q}) - ogname);
      //cout << "tar " << q - (int)ost.order_of_key({A[q], q}) << "\n";
      ost.erase({y, X[i]});
    }
    else {
    //  cout << "rip :rofl:\n";
      ost.erase({x, X[i]});
      long long ogname = query_max(x, x);
      range_add(x, x, -1e10 - ogname); // res = -1e17
    }
    ost.insert({y, X[i]});
    A[X[i]] = V[i];
    ms[y].insert({X[i] - (int)ost.order_of_key({V[i], X[i]}), X[i]});
    ono[y][X[i]] = X[i] - (int)ost.order_of_key({V[i], X[i]});
   // cout << X[i] << " " << (int)ost.order_of_key({V[i], X[i]}) << " " << X[i] - (int)ost.order_of_key({V[i], X[i]}) << " g\n";
    long long q = (*ms[y].rbegin()).second;
    long long ogname = query_max(V[i], V[i]);
    range_add(V[i], V[i], q - (int)ost.order_of_key({A[q], q}) - ogname);
    answer[i] = query_max(0, N + Q - 1);
    /*
    pair<int, int> B[N];
    for(int j=0; j<N; j++) B[j] = {A[j], j};
    sort(B, B+N);
    int expected = 0;
    for(int j=0; j<N; j++) expected = max(expected, B[j].second - j);
    if(expected != answer[i]) {
      cout << "fuck!!\n";
    //  cout << "query "<<i<<": expected "<<expected<<" found "<<answer[i]<<"\n";
    }
    // for(int j=0; j<N+Q; j++) cout << (query_max(j, j) < -1e15 ? "q" : to_string(query_max(j, j))) << " ";
    //  cout << "\n";
    */
  }
  
	return answer;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 9 ms 1948 KB Output is correct
4 Correct 9 ms 1876 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 9 ms 1896 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 10 ms 1896 KB Output is correct
9 Correct 12 ms 1888 KB Output is correct
10 Correct 10 ms 1824 KB Output is correct
11 Correct 11 ms 1732 KB Output is correct
12 Correct 10 ms 1748 KB Output is correct
13 Correct 8 ms 1748 KB Output is correct
14 Correct 11 ms 1748 KB Output is correct
15 Correct 8 ms 1724 KB Output is correct
16 Correct 8 ms 1748 KB Output is correct
17 Correct 10 ms 1724 KB Output is correct
18 Correct 8 ms 1744 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 9 ms 1948 KB Output is correct
4 Correct 9 ms 1876 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 9 ms 1896 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 10 ms 1896 KB Output is correct
9 Correct 12 ms 1888 KB Output is correct
10 Correct 10 ms 1824 KB Output is correct
11 Correct 11 ms 1732 KB Output is correct
12 Correct 10 ms 1748 KB Output is correct
13 Correct 8 ms 1748 KB Output is correct
14 Correct 11 ms 1748 KB Output is correct
15 Correct 8 ms 1724 KB Output is correct
16 Correct 8 ms 1748 KB Output is correct
17 Correct 10 ms 1724 KB Output is correct
18 Correct 8 ms 1744 KB Output is correct
19 Correct 42 ms 5940 KB Output is correct
20 Correct 55 ms 6656 KB Output is correct
21 Correct 50 ms 6604 KB Output is correct
22 Correct 43 ms 6772 KB Output is correct
23 Correct 48 ms 6260 KB Output is correct
24 Correct 40 ms 6204 KB Output is correct
25 Correct 35 ms 6072 KB Output is correct
26 Correct 35 ms 6092 KB Output is correct
27 Correct 46 ms 5908 KB Output is correct
28 Correct 46 ms 5968 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 10152 KB Output is correct
2 Correct 192 ms 19156 KB Output is correct
3 Correct 387 ms 28244 KB Output is correct
4 Correct 452 ms 28180 KB Output is correct
5 Correct 337 ms 28104 KB Output is correct
6 Correct 338 ms 28108 KB Output is correct
7 Correct 432 ms 27984 KB Output is correct
8 Incorrect 422 ms 28184 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 9 ms 1948 KB Output is correct
4 Correct 9 ms 1876 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 9 ms 1896 KB Output is correct
7 Correct 9 ms 1876 KB Output is correct
8 Correct 10 ms 1896 KB Output is correct
9 Correct 12 ms 1888 KB Output is correct
10 Correct 10 ms 1824 KB Output is correct
11 Correct 11 ms 1732 KB Output is correct
12 Correct 10 ms 1748 KB Output is correct
13 Correct 8 ms 1748 KB Output is correct
14 Correct 11 ms 1748 KB Output is correct
15 Correct 8 ms 1724 KB Output is correct
16 Correct 8 ms 1748 KB Output is correct
17 Correct 10 ms 1724 KB Output is correct
18 Correct 8 ms 1744 KB Output is correct
19 Correct 42 ms 5940 KB Output is correct
20 Correct 55 ms 6656 KB Output is correct
21 Correct 50 ms 6604 KB Output is correct
22 Correct 43 ms 6772 KB Output is correct
23 Correct 48 ms 6260 KB Output is correct
24 Correct 40 ms 6204 KB Output is correct
25 Correct 35 ms 6072 KB Output is correct
26 Correct 35 ms 6092 KB Output is correct
27 Correct 46 ms 5908 KB Output is correct
28 Correct 46 ms 5968 KB Output is correct
29 Correct 59 ms 10152 KB Output is correct
30 Correct 192 ms 19156 KB Output is correct
31 Correct 387 ms 28244 KB Output is correct
32 Correct 452 ms 28180 KB Output is correct
33 Correct 337 ms 28104 KB Output is correct
34 Correct 338 ms 28108 KB Output is correct
35 Correct 432 ms 27984 KB Output is correct
36 Incorrect 422 ms 28184 KB Output isn't correct
37 Halted 0 ms 0 KB -