제출 #297585

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
297585	2020-09-11 16:07:54	pit4h	Bubble Sort 2 (JOI18_bubblesort2)	C++14	38 / 100	9090 ms	2432 KiB

bubblesort2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bubblesort2.h"
#include<bits/stdc++.h>
using namespace std;
struct Dynamic_segtree {
};
vector<int> countScans(vector<int> a, vector<int> x, vector<int> v){
  int q = x.size();
  int n = a.size();
  vector<int> answer(q);
  vector<int> inv(n);
  for(int i=0; i<n; ++i) {
    for(int j=i+1; j<n; ++j) {
      if(a[i] > a[j]) {
        inv[j]++;
      }
    }
  }
  for(int i=0; i<q; ++i) {
    int old = a[x[i]];
    a[x[i]] = v[i];
    inv[x[i]] = 0;
    for(int j=0; j<x[i]; ++j) {
      if(a[j] > a[x[i]]) {
        inv[x[i]]++;
      }
    }
    for(int j=x[i]+1; j<n; ++j) {
      if(a[x[i]] > a[j] && old <= a[j]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 21 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40