답안 #851794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
851794	2023-09-20T16:01:17 Z	vjudge1	Bubble Sort 2 (JOI18_bubblesort2)	C++17	17 / 100	9000 ms	732 KB

bubblesort2

// by me
#include "bubblesort2.h"

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define all(x) x.begin(), x.end()

std::vector<int> countScans(std::vector<int> A, std::vector<int> X, std::vector<int> V){
	int Q = X.size();
	vector<int> ans(Q, 0);
    for(int i = 0; i < Q; i++){
		A[X[i]] = V[i];
		auto f = A;
		while(1){
			bool sort = 1;
			for(int i = 1; i < f.size(); i++){
				if(f[i] < f[i - 1]){
					sort = 0;
					swap(f[i], f[i - 1]);
				}
			}
			if(sort) break;
			ans[i]++;
		}
    }
	return ans;
}

//
/*
int readInt(){
	int i;
	if(scanf("%d",&i)!=1){
		fprintf(stderr,"Error while reading input\n");
		exit(1);
	}
	return i;
}

int main(){
	int N,Q;
	N=readInt();
	Q=readInt();

	std::vector<int> A(N);
	for(int i=0;i<N;i++)
		A[i]=readInt();

	std::vector<int> X(Q),V(Q);
	for(int j=0;j<Q;j++){
		X[j]=readInt();
		V[j]=readInt();
	}

	std::vector<int> res=countScans(A,X,V);

	for(int j=0;j<int(res.size());j++)
		printf("%d\n",res[j]);
}
//*/
// by me

Compilation message

bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:18:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |    for(int i = 1; i < f.size(); i++){
      |                   ~~^~~~~~~~~~

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	168 ms	424 KB	Output is correct
2	Correct	619 ms	436 KB	Output is correct
3	Correct	8572 ms	472 KB	Output is correct
4	Correct	8524 ms	472 KB	Output is correct
5	Correct	3813 ms	472 KB	Output is correct
6	Correct	645 ms	468 KB	Output is correct
7	Correct	1531 ms	468 KB	Output is correct
8	Correct	2345 ms	596 KB	Output is correct
9	Correct	3877 ms	472 KB	Output is correct
10	Correct	6683 ms	732 KB	Output is correct
11	Correct	6679 ms	472 KB	Output is correct
12	Correct	6590 ms	476 KB	Output is correct
13	Correct	6730 ms	472 KB	Output is correct
14	Correct	6644 ms	472 KB	Output is correct
15	Correct	6684 ms	468 KB	Output is correct
16	Correct	6613 ms	468 KB	Output is correct
17	Correct	6641 ms	468 KB	Output is correct
18	Correct	6626 ms	468 KB	Output is correct

Subtask #2

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	168 ms	424 KB	Output is correct
2	Correct	619 ms	436 KB	Output is correct
3	Correct	8572 ms	472 KB	Output is correct
4	Correct	8524 ms	472 KB	Output is correct
5	Correct	3813 ms	472 KB	Output is correct
6	Correct	645 ms	468 KB	Output is correct
7	Correct	1531 ms	468 KB	Output is correct
8	Correct	2345 ms	596 KB	Output is correct
9	Correct	3877 ms	472 KB	Output is correct
10	Correct	6683 ms	732 KB	Output is correct
11	Correct	6679 ms	472 KB	Output is correct
12	Correct	6590 ms	476 KB	Output is correct
13	Correct	6730 ms	472 KB	Output is correct
14	Correct	6644 ms	472 KB	Output is correct
15	Correct	6684 ms	468 KB	Output is correct
16	Correct	6613 ms	468 KB	Output is correct
17	Correct	6641 ms	468 KB	Output is correct
18	Correct	6626 ms	468 KB	Output is correct
19	Execution timed out	9023 ms	604 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	9041 ms	604 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	168 ms	424 KB	Output is correct
2	Correct	619 ms	436 KB	Output is correct
3	Correct	8572 ms	472 KB	Output is correct
4	Correct	8524 ms	472 KB	Output is correct
5	Correct	3813 ms	472 KB	Output is correct
6	Correct	645 ms	468 KB	Output is correct
7	Correct	1531 ms	468 KB	Output is correct
8	Correct	2345 ms	596 KB	Output is correct
9	Correct	3877 ms	472 KB	Output is correct
10	Correct	6683 ms	732 KB	Output is correct
11	Correct	6679 ms	472 KB	Output is correct
12	Correct	6590 ms	476 KB	Output is correct
13	Correct	6730 ms	472 KB	Output is correct
14	Correct	6644 ms	472 KB	Output is correct
15	Correct	6684 ms	468 KB	Output is correct
16	Correct	6613 ms	468 KB	Output is correct
17	Correct	6641 ms	468 KB	Output is correct
18	Correct	6626 ms	468 KB	Output is correct
19	Execution timed out	9023 ms	604 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-