Submission #732421

#	Time	Username	Problem	Language	Result	Execution time	Memory
732421		Programmer123	Swap Swap Sort (CCO21_day1problem1)	C++17	0 / 25	5091 ms	980 KiB

Main

#include <bits/stdc++.h>

int main() {
    int N, K, Q;
    std::cin >> N >> K >> Q;
    int data[N];
    for (int i = 0; i < N; ++i) {
        std::cin >> data[i];
        data[i]--;
    }
    int nums[K];
    for (int i = 0; i < K; ++i) {
        nums[i] = i;
    }
    int pos[K];
    for (int i = 0; i < K; ++i) {
        pos[i] = i;
    }
    for (int _ = 0; _ < Q; ++_) {
        int index;
        std::cin >> index;
        std::swap(nums[index], nums[index - 1]);
        pos[nums[index]] = index;
        pos[nums[index - 1]] = index - 1;
#ifdef LOCAL
        for (int i = 0; i < K; ++i) {
            std::cout << nums[i] << " ";
        }
        std::cout << std::endl;
#endif
        int sort[N];
        for (int i = 0; i < N; ++i) {
            sort[i] = pos[data[i]];
        }
        int swaps = 0;
        while (true) {
            for (int i = 0; i < N - 1; ++i) {
                if (sort[i + 1] < sort[i]) {
                    goto unsorted;
                }
            }
            break;
        unsorted:
            for (int i = 0; i < N - 1; ++i) {
                if (sort[i + 1] < sort[i]) {
                    std::swap(sort[i + 1], sort[i]);
                    swaps++;
                }
            }
        }
        std::cout << swaps << std::endl;
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 5
• Subtask 4: 0 / 14