oj.uz

답안 #70923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70923 2018-08-23T17:33:28 Z ASG1065 Bubble Sort 2 (JOI18_bubblesort2) C++14
0 / 100
 9000 ms 936 KB 
#include "bubblesort2.h"
#include<bits/stdc++.h>

std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
	int n = A.size();
	int q = X.size();
	std::vector<int> answer;
	for (int i = 0; i < q; ++i)
    {
        A[X[i]] = V[i];
        std::vector<int> B = A;
        int ct = 0;
        for (int j = 0; j < n; ++j)
        {
            bool s = false;
            for (int k = 0; k < n-1; ++k)
            {
                if (B[k] > B[k+1]) {std::swap(B[k], B[k+1]); s = true;}
            }
            if (!s) {break;}
            ++ct;
        }
        answer.push_back(ct);
    }
    return answer;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 341 ms 376 KB Output is correct
2 Correct 1302 ms 616 KB Output is correct
3 Execution timed out 9029 ms 616 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 341 ms 376 KB Output is correct
2 Correct 1302 ms 616 KB Output is correct
3 Execution timed out 9029 ms 616 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 341 ms 376 KB Output is correct
2 Correct 1302 ms 616 KB Output is correct
3 Execution timed out 9029 ms 616 KB Time limit exceeded
4 Halted 0 ms 0 KB -