oj.uz

Submission #884045

# Submission time Handle Problem Language Result Execution time Memory
884045 2023-12-06T14:57:12 Z vjudge1 Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 9000 ms 3696 KB 
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

int const NMAX = 5e5;
int arr[1 + NMAX];

int const MMAX = 1e6;
int aib[1 + MMAX];

void update(int pos, int add, int m) {
  //cerr << "Update : ";
  for(int i = pos;i <= m;i = 2 * i - (i & (i-1))) {
    //cerr << i << ' ';
    aib[i] += add;
  }
  //cerr << ";\n";
}

int query(int pos, int m) {
  int ans = 0;
  //cerr << "Query : ";
  for(int i = pos;i > 0;i = (i & (i-1))) {
    ans += aib[i];
    //cerr << i << ' ';
  }
  //cerr << ";\n";
  return ans;
}

int solve(int n, int m) {
  for(int i = 0;i <= m;i++) {
    aib[i] = 0;
  }
  int ans = 0;
  //cerr << "  ";
  for(int i = 0;i < n;i++) {
    //cerr << arr[i] << ' ';
    ans = max(ans, (query(m, m) - query(arr[i], m)));
    update(arr[i], 1, m);
  }
  //cerr << "\n";
  return ans;
}

vector <int> countScans(vector <int> vec, vector <int> pos, vector <int> val) {
  // Normalize
  //cerr << "Normalize ... must be bad\n";
  vector <int> all;
  for(int i = 0;i < vec.size();i++){
    all.push_back(vec[i]);
  }
  for(int i = 0;i < val.size();i++){
    all.push_back(val[i]);
  }
  sort(all.begin(), all.end());
  all.erase(unique(all.begin(), all.end()), all.end());

  map <int, int> norm;
  for(int i = 0;i < all.size();i++) {
    norm[all[i]] = i+1;
  }
  int n = vec.size();
  for(int i = 0;i < vec.size();i++) {
    vec[i] = norm[vec[i]];
    arr[i] = vec[i];
  }
  for(int i = 0;i < val.size();i++) {
    val[i] = norm[val[i]];
  }
  //cerr << "Normalize Accepted : Failed Solve\n";
  // Solve
  vector <int> ans;
  int t = pos.size();

  for(int q = 0;q < t;q++) {
    arr[pos[q]] = val[q];
    //cerr << "  Can't solve this\n";
    ans.push_back(solve(n, all.size()));
  }
  return ans;
}
/*
void test() {
  int n, t;
  cin >> n >> t;
  vector <int> vec, pos, val;
  vector <int> ans;
  for(int i = 0;i < n;i++) {
    int c;
    cin >> c;
    vec.push_back(c);
  }
  for(int i = 0;i < t;i++) {
    int c1, c2;
    cin >> c1 >> c2;
    pos.push_back(c1);
    val.push_back(c2);
  }
  ans = countScans(vec, pos, val);
  for(int i = 0;i < ans.size();i++) {
    cout << ans[i] << ' ';
  }
}
/*
Example:
4 2
1 2 3 4
0 3
2 1

5 4
2 2 2 2 1
0 2
4 5
0 6
1 6

int main() {

  test();
  return 0;
}
*/

Compilation message

bubblesort2.cpp:108:1: warning: "/*" within comment [-Wcomment]
  108 | /*
      |  
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:53:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for(int i = 0;i < vec.size();i++){
      |                 ~~^~~~~~~~~~~~
bubblesort2.cpp:56:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for(int i = 0;i < val.size();i++){
      |                 ~~^~~~~~~~~~~~
bubblesort2.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for(int i = 0;i < all.size();i++) {
      |                 ~~^~~~~~~~~~~~
bubblesort2.cpp:67:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |   for(int i = 0;i < vec.size();i++) {
      |                 ~~^~~~~~~~~~~~
bubblesort2.cpp:71:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |   for(int i = 0;i < val.size();i++) {
      |                 ~~^~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2392 KB Output is correct
2 Correct 11 ms 2392 KB Output is correct
3 Correct 70 ms 2752 KB Output is correct
4 Correct 71 ms 2752 KB Output is correct
5 Correct 71 ms 2648 KB Output is correct
6 Correct 65 ms 2652 KB Output is correct
7 Correct 80 ms 2648 KB Output is correct
8 Correct 71 ms 2748 KB Output is correct
9 Correct 70 ms 2648 KB Output is correct
10 Correct 67 ms 2724 KB Output is correct
11 Correct 71 ms 2652 KB Output is correct
12 Correct 74 ms 2652 KB Output is correct
13 Correct 59 ms 2648 KB Output is correct
14 Correct 56 ms 2652 KB Output is correct
15 Correct 54 ms 2812 KB Output is correct
16 Correct 58 ms 2700 KB Output is correct
17 Correct 58 ms 2652 KB Output is correct
18 Correct 58 ms 2648 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2392 KB Output is correct
2 Correct 11 ms 2392 KB Output is correct
3 Correct 70 ms 2752 KB Output is correct
4 Correct 71 ms 2752 KB Output is correct
5 Correct 71 ms 2648 KB Output is correct
6 Correct 65 ms 2652 KB Output is correct
7 Correct 80 ms 2648 KB Output is correct
8 Correct 71 ms 2748 KB Output is correct
9 Correct 70 ms 2648 KB Output is correct
10 Correct 67 ms 2724 KB Output is correct
11 Correct 71 ms 2652 KB Output is correct
12 Correct 74 ms 2652 KB Output is correct
13 Correct 59 ms 2648 KB Output is correct
14 Correct 56 ms 2652 KB Output is correct
15 Correct 54 ms 2812 KB Output is correct
16 Correct 58 ms 2700 KB Output is correct
17 Correct 58 ms 2652 KB Output is correct
18 Correct 58 ms 2648 KB Output is correct
19 Correct 1393 ms 3692 KB Output is correct
20 Correct 1588 ms 3696 KB Output is correct
21 Correct 1505 ms 3584 KB Output is correct
22 Correct 1575 ms 3664 KB Output is correct
23 Correct 1348 ms 3496 KB Output is correct
24 Correct 1408 ms 3492 KB Output is correct
25 Correct 1260 ms 3444 KB Output is correct
26 Correct 1199 ms 3448 KB Output is correct
27 Correct 1304 ms 3416 KB Output is correct
28 Correct 1295 ms 3364 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 960 ms 2908 KB Output is correct
2 Execution timed out 9013 ms 3552 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2392 KB Output is correct
2 Correct 11 ms 2392 KB Output is correct
3 Correct 70 ms 2752 KB Output is correct
4 Correct 71 ms 2752 KB Output is correct
5 Correct 71 ms 2648 KB Output is correct
6 Correct 65 ms 2652 KB Output is correct
7 Correct 80 ms 2648 KB Output is correct
8 Correct 71 ms 2748 KB Output is correct
9 Correct 70 ms 2648 KB Output is correct
10 Correct 67 ms 2724 KB Output is correct
11 Correct 71 ms 2652 KB Output is correct
12 Correct 74 ms 2652 KB Output is correct
13 Correct 59 ms 2648 KB Output is correct
14 Correct 56 ms 2652 KB Output is correct
15 Correct 54 ms 2812 KB Output is correct
16 Correct 58 ms 2700 KB Output is correct
17 Correct 58 ms 2652 KB Output is correct
18 Correct 58 ms 2648 KB Output is correct
19 Correct 1393 ms 3692 KB Output is correct
20 Correct 1588 ms 3696 KB Output is correct
21 Correct 1505 ms 3584 KB Output is correct
22 Correct 1575 ms 3664 KB Output is correct
23 Correct 1348 ms 3496 KB Output is correct
24 Correct 1408 ms 3492 KB Output is correct
25 Correct 1260 ms 3444 KB Output is correct
26 Correct 1199 ms 3448 KB Output is correct
27 Correct 1304 ms 3416 KB Output is correct
28 Correct 1295 ms 3364 KB Output is correct
29 Correct 960 ms 2908 KB Output is correct
30 Execution timed out 9013 ms 3552 KB Time limit exceeded
31 Halted 0 ms 0 KB -