oj.uz

Submission #792845

# Submission time Handle Problem Language Result Execution time Memory
792845 2023-07-25T09:49:11 Z Sam_a17 Bubble Sort 2 (JOI18_bubblesort2) C++17
17 / 100
 9000 ms 616 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
#define ll long long
 
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;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
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(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> void print(Tree <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 << "]";}
 
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// 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 if(str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}


vector<int> countScans(vector<int> a, vector<int> X, vector<int> V) {
  int n = sz(a), q = sz(X);

  vector<int> pat;
  for(int t = 0; t < q; t++) {
    a[X[t]] = V[t];

    int mx = 0;
    for(int i = 0; i < n; i++) {
      int cnt = 0;
      for(int j = 0; j < i; j++) {
        cnt += a[j] > a[i];
      }
      mx = max(mx, cnt);
    }

    pat.push_back(mx);
  }

  return pat;
}

Compilation message

bubblesort2.cpp: In function 'void setIO(std::string)':
bubblesort2.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bubblesort2.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
bubblesort2.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bubblesort2.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 212 KB Output is correct
2 Correct 184 ms 328 KB Output is correct
3 Correct 2578 ms 396 KB Output is correct
4 Correct 2605 ms 388 KB Output is correct
5 Correct 2643 ms 524 KB Output is correct
6 Correct 2610 ms 396 KB Output is correct
7 Correct 2573 ms 392 KB Output is correct
8 Correct 2519 ms 392 KB Output is correct
9 Correct 2485 ms 372 KB Output is correct
10 Correct 2542 ms 496 KB Output is correct
11 Correct 2568 ms 384 KB Output is correct
12 Correct 2537 ms 380 KB Output is correct
13 Correct 2609 ms 388 KB Output is correct
14 Correct 2619 ms 508 KB Output is correct
15 Correct 2558 ms 376 KB Output is correct
16 Correct 2541 ms 388 KB Output is correct
17 Correct 2609 ms 388 KB Output is correct
18 Correct 2547 ms 364 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 212 KB Output is correct
2 Correct 184 ms 328 KB Output is correct
3 Correct 2578 ms 396 KB Output is correct
4 Correct 2605 ms 388 KB Output is correct
5 Correct 2643 ms 524 KB Output is correct
6 Correct 2610 ms 396 KB Output is correct
7 Correct 2573 ms 392 KB Output is correct
8 Correct 2519 ms 392 KB Output is correct
9 Correct 2485 ms 372 KB Output is correct
10 Correct 2542 ms 496 KB Output is correct
11 Correct 2568 ms 384 KB Output is correct
12 Correct 2537 ms 380 KB Output is correct
13 Correct 2609 ms 388 KB Output is correct
14 Correct 2619 ms 508 KB Output is correct
15 Correct 2558 ms 376 KB Output is correct
16 Correct 2541 ms 388 KB Output is correct
17 Correct 2609 ms 388 KB Output is correct
18 Correct 2547 ms 364 KB Output is correct
19 Execution timed out 9031 ms 616 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 9043 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 212 KB Output is correct
2 Correct 184 ms 328 KB Output is correct
3 Correct 2578 ms 396 KB Output is correct
4 Correct 2605 ms 388 KB Output is correct
5 Correct 2643 ms 524 KB Output is correct
6 Correct 2610 ms 396 KB Output is correct
7 Correct 2573 ms 392 KB Output is correct
8 Correct 2519 ms 392 KB Output is correct
9 Correct 2485 ms 372 KB Output is correct
10 Correct 2542 ms 496 KB Output is correct
11 Correct 2568 ms 384 KB Output is correct
12 Correct 2537 ms 380 KB Output is correct
13 Correct 2609 ms 388 KB Output is correct
14 Correct 2619 ms 508 KB Output is correct
15 Correct 2558 ms 376 KB Output is correct
16 Correct 2541 ms 388 KB Output is correct
17 Correct 2609 ms 388 KB Output is correct
18 Correct 2547 ms 364 KB Output is correct
19 Execution timed out 9031 ms 616 KB Time limit exceeded
20 Halted 0 ms 0 KB -