제출 #1155965

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1155965	2025-02-23 14:26:12	Otalp	Bubble Sort 2 (JOI18_bubblesort2)	C++20	60 / 100	9091 ms	5260 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;
#define pb push_back
int a[500100];
int dp[500100];
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
  int t = X.size();
  int n = A.size();
  for(int i=1; i<=n; i++){
    a[i] = A[i-1];
  }
  for(int i=1; i<=n; i++){
    dp[i] = 0;
    for(int j=1; j<=i; j++){
      dp[i] += (a[i] < a[j]);
    }
  }
  vector<int> res;
  for(int j=0; j<t; j++){
    int pos = X[j] + 1;
    int x = V[j];
    for(int i=pos+1; i<=n; i++){
      dp[i] -= (a[i] < a[pos]);
    }
    a[pos] = x;
    for(int i=pos+1; i<=n; i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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