oj.uz

Submission #998007

# Submission time Handle Problem Language Result Execution time Memory
998007 2024-06-13T07:45:25 Z piOOE MalnaRISC (COI21_malnarisc) C++17
40 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void parallel(vector<vector<pair<int, int>>> &x, vector<vector<pair<int, int>>> &y) {
    if (x.size() < y.size()) {
        x.resize(y.size());
    }
    for (int i = 0; i < y.size(); ++i) {
        x[i].insert(x[i].end(), y[i].begin(), y[i].end());
    }
}

vector<vector<pair<int, int>>> merge(vector<int> a) {
    if (a.size() == 1) {
        return {};
    }
    vector<int> l, r;
    if (a.size() == 2) {
        for (int x: a) {
            (l.size() <= r.size() ? l : r).push_back(x);
        }
    } else {
        int m = a.size() + 1 >> 1;
        for (int i = 0; i < a.size(); ++i) {
            if (i < m) {
                (i % 2 == 0 ? l : r).push_back(a[i]);
            } else {
                ((i - m) % 2 == 0 ? l : r).push_back(a[i]);
            }
        }
    }
    auto x = merge(l), y = merge(r);
    parallel(x, y);
    for (int t = a.size() > 2; t < 2; ++t) {
        x.push_back({});
        for (int i = t; i + 1 < a.size(); i += 2) {
            x.back().push_back({a[i], a[i + 1]});
        }
        if (x.back().empty()) {
            x.pop_back();
        }
    }
    return x;
}

vector<vector<pair<int, int>>> sort(int l, int r) {
    if (l + 1 == r) {
        return {};
    }
    int mid = l + r >> 1;
    auto x = sort(l, mid), y = sort(mid, r);
    parallel(x, y);
    vector<int> a(r - l, 0);
    iota(a.begin(), a.end(), l);
    auto z = merge(a);
    x.insert(x.end(), z.begin(), z.end());
    return x;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    auto res = sort(0, n);
    cout << res.size() << '\n';
    for (auto &t : res) {
        for (auto [i, j] : t) {
            cout << "CMPSWP " << "R" << i + 1 << " " << "R" << j + 1 << " ";
        }
        cout << '\n';
    }

    return 0;
}

Compilation message

malnarisc.cpp: In function 'void parallel(std::vector<std::vector<std::pair<int, int> > >&, std::vector<std::vector<std::pair<int, int> > >&)':
malnarisc.cpp:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0; i < y.size(); ++i) {
      |                     ~~^~~~~~~~~~
malnarisc.cpp: In function 'std::vector<std::vector<std::pair<int, int> > > merge(std::vector<int>)':
malnarisc.cpp:25:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |         int m = a.size() + 1 >> 1;
      |                 ~~~~~~~~~^~~
malnarisc.cpp:26:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int i = 0; i < a.size(); ++i) {
      |                         ~~^~~~~~~~~~
malnarisc.cpp:38:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i = t; i + 1 < a.size(); i += 2) {
      |                         ~~~~~~^~~~~~~~~~
malnarisc.cpp: In function 'std::vector<std::vector<std::pair<int, int> > > sort(int, int)':
malnarisc.cpp:52:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB not sorted
2 Halted 0 ms 0 KB -