oj.uz

답안 #363188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363188 2021-02-05T09:06:01 Z buyolitsez Bubble Sort 2 (JOI18_bubblesort2) C++17
0 / 100
 9000 ms 620 KB 
#include <bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;

vector <int> countScans(vector<int> a, vector<int> x, vector<int> v) {
    int n = a.size(), q = x.size();
    vector <int> s(q);
    for(int f = 0; f < q; ++f) {
        a[x[f]] = v[f];
        int cnt = 0;
        vector<int> b = a;
        for(int i = 0; i < n; ++i) {
            bool flag = 0;
            for (int j = 0; j + 1 < n; ++j) {
                if (a[j] > a[j + 1]) {
                    swap(a[j], a[j + 1]);
                    flag = 1;
                }
            }
            if (!flag) {break;}
            ++cnt;
        }
        swap(a, b);
        s[f] = cnt;
    }
    return s;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 364 KB Output is correct
2 Correct 1558 ms 492 KB Output is correct
3 Execution timed out 9076 ms 364 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 364 KB Output is correct
2 Correct 1558 ms 492 KB Output is correct
3 Execution timed out 9076 ms 364 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 364 KB Output is correct
2 Correct 1558 ms 492 KB Output is correct
3 Execution timed out 9076 ms 364 KB Time limit exceeded
4 Halted 0 ms 0 KB -