oj.uz

답안 #792861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792861 2023-07-25T10:03:15 Z Sam_a17 Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 9000 ms 8176 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> cnt(n);
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < i; j++) {
      cnt[i] += a[j] > a[i];
    }
  }

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

    int cur = X[t];
    cnt[cur] = 0;

    for(int i = 0; i < cur; i++) {
      cnt[cur] += a[i] > a[cur];
    }

    for(int i = cur + 1; i < n; i++) {
      cnt[i] -= lst > a[i];
      cnt[i] += a[cur] > a[i];
    }

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

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 10 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 12 ms 404 KB Output is correct
6 Correct 10 ms 352 KB Output is correct
7 Correct 10 ms 408 KB Output is correct
8 Correct 10 ms 316 KB Output is correct
9 Correct 12 ms 404 KB Output is correct
10 Correct 10 ms 400 KB Output is correct
11 Correct 10 ms 404 KB Output is correct
12 Correct 11 ms 384 KB Output is correct
13 Correct 10 ms 340 KB Output is correct
14 Correct 10 ms 340 KB Output is correct
15 Correct 10 ms 340 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 11 ms 340 KB Output is correct
18 Correct 10 ms 340 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 10 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 12 ms 404 KB Output is correct
6 Correct 10 ms 352 KB Output is correct
7 Correct 10 ms 408 KB Output is correct
8 Correct 10 ms 316 KB Output is correct
9 Correct 12 ms 404 KB Output is correct
10 Correct 10 ms 400 KB Output is correct
11 Correct 10 ms 404 KB Output is correct
12 Correct 11 ms 384 KB Output is correct
13 Correct 10 ms 340 KB Output is correct
14 Correct 10 ms 340 KB Output is correct
15 Correct 10 ms 340 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 11 ms 340 KB Output is correct
18 Correct 10 ms 340 KB Output is correct
19 Correct 122 ms 700 KB Output is correct
20 Correct 143 ms 836 KB Output is correct
21 Correct 145 ms 724 KB Output is correct
22 Correct 148 ms 704 KB Output is correct
23 Correct 144 ms 732 KB Output is correct
24 Correct 147 ms 724 KB Output is correct
25 Correct 139 ms 672 KB Output is correct
26 Correct 141 ms 716 KB Output is correct
27 Correct 138 ms 652 KB Output is correct
28 Correct 149 ms 716 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 732 KB Output is correct
2 Correct 2496 ms 1672 KB Output is correct
3 Correct 5828 ms 2620 KB Output is correct
4 Correct 5853 ms 2592 KB Output is correct
5 Correct 5926 ms 2808 KB Output is correct
6 Correct 5796 ms 2632 KB Output is correct
7 Correct 5789 ms 2636 KB Output is correct
8 Correct 5877 ms 2620 KB Output is correct
9 Correct 5892 ms 2616 KB Output is correct
10 Correct 5539 ms 2708 KB Output is correct
11 Correct 5482 ms 2636 KB Output is correct
12 Correct 5481 ms 2704 KB Output is correct
13 Correct 5389 ms 2704 KB Output is correct
14 Correct 5294 ms 2768 KB Output is correct
15 Correct 5344 ms 2628 KB Output is correct
16 Correct 5128 ms 2692 KB Output is correct
17 Correct 5122 ms 2764 KB Output is correct
18 Correct 5120 ms 2736 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 10 ms 340 KB Output is correct
4 Correct 11 ms 416 KB Output is correct
5 Correct 12 ms 404 KB Output is correct
6 Correct 10 ms 352 KB Output is correct
7 Correct 10 ms 408 KB Output is correct
8 Correct 10 ms 316 KB Output is correct
9 Correct 12 ms 404 KB Output is correct
10 Correct 10 ms 400 KB Output is correct
11 Correct 10 ms 404 KB Output is correct
12 Correct 11 ms 384 KB Output is correct
13 Correct 10 ms 340 KB Output is correct
14 Correct 10 ms 340 KB Output is correct
15 Correct 10 ms 340 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 11 ms 340 KB Output is correct
18 Correct 10 ms 340 KB Output is correct
19 Correct 122 ms 700 KB Output is correct
20 Correct 143 ms 836 KB Output is correct
21 Correct 145 ms 724 KB Output is correct
22 Correct 148 ms 704 KB Output is correct
23 Correct 144 ms 732 KB Output is correct
24 Correct 147 ms 724 KB Output is correct
25 Correct 139 ms 672 KB Output is correct
26 Correct 141 ms 716 KB Output is correct
27 Correct 138 ms 652 KB Output is correct
28 Correct 149 ms 716 KB Output is correct
29 Correct 354 ms 732 KB Output is correct
30 Correct 2496 ms 1672 KB Output is correct
31 Correct 5828 ms 2620 KB Output is correct
32 Correct 5853 ms 2592 KB Output is correct
33 Correct 5926 ms 2808 KB Output is correct
34 Correct 5796 ms 2632 KB Output is correct
35 Correct 5789 ms 2636 KB Output is correct
36 Correct 5877 ms 2620 KB Output is correct
37 Correct 5892 ms 2616 KB Output is correct
38 Correct 5539 ms 2708 KB Output is correct
39 Correct 5482 ms 2636 KB Output is correct
40 Correct 5481 ms 2704 KB Output is correct
41 Correct 5389 ms 2704 KB Output is correct
42 Correct 5294 ms 2768 KB Output is correct
43 Correct 5344 ms 2628 KB Output is correct
44 Correct 5128 ms 2692 KB Output is correct
45 Correct 5122 ms 2764 KB Output is correct
46 Correct 5120 ms 2736 KB Output is correct
47 Execution timed out 9093 ms 8176 KB Time limit exceeded
48 Halted 0 ms 0 KB -