oj.uz

답안 #315187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315187 2020-10-22T04:14:54 Z 2qbingxuan Cat (info1cup19_cat) C++14
100 / 100
 597 ms 13356 KB 
#include <bits/stdc++.h>
#ifdef local
#define debug(args...) ppbx(#args, args)
template <typename ...T> void ppbx(const char *s, T ...args) {
    int cnt = sizeof...(T);
    (std::cerr << "(" << s << ") = (" , ... , (std::cerr << args << (--cnt ? ", " : ")\n")));
}
#else
#define debug(...) ((void)0)
#endif // local
#define pb emplace_back
#define all(v) begin(v), end(v)
using namespace std;
using ll = long long;

void solve() {
    int n;
    cin >> n;
    vector<int> p(n);
    for(int i = 0; i < n; i++) cin >> p[i], --p[i];
    for(int i = 0; i < n; i++) if(p[i] + p[n-1-i] != n-1) return cout << -1 << '\n', void();
    vector<pair<int,int>> ans;
    int H = n/2;
    vector<int> pos(H);
    for(int i = 0; i < H; i++) pos[p[i] < H ? p[i] : n-1-p[i]] = i;
    vector<int> vis(H);
    int last = -1;
    auto go = [&](int a, int b) {
        swap(p[a], p[b]);
        swap(p[n-1-a], p[n-1-b]);
        ans.pb(a, b);
    };
    for(int i = 0; i < H; i++) {
        if(!vis[i]) {
            vector<int> cyc;
            for(int x = i; !vis[x]; x = pos[x]) {
                vis[x] = true;
                if(p[x] >= H)
                    cyc.pb(x);
            }
            if(cyc.size() % 2 == 1) {
                if(last == -1) last = cyc.back();
                else go(last, n-1-cyc.back()), last = -1;
                cyc.pop_back();
            }
            for(int i = 0; i < int(cyc.size()); i += 2) {
                int a = cyc[i], b = cyc[i+1];
                debug(a, b);
                go(a, n-1-b);
            }
        }
    }
    if(last != -1) return cout << -1 << '\n', void();
    /* for(int i = 0; i < n; i++) cerr << p[i]+1 << (i+1==n ? '\n' : ' '); */
    /* for(int i = 0; i < H; i++) cerr << pos[i] << ' '; */
    /* cerr << '\n'; */
    for(int i = 0; i < H; i++) pos[p[i]] = i;
    vis = vector<int>(n, 0);
    for(int i = 0; i < H; i++) {
        if(!vis[i]) {
            vector<int> cyc;
            for(int x = i; !vis[x]; x = pos[x]) {
                vis[x] = true;
                cyc.pb(x);
            }
            /* cerr << "cyc = "; */
            /* for(int x: cyc) cerr << x << ' '; */
            /* cerr << '\n'; */
            for(int i = 1; i < int(cyc.size()); i++) {
                go(cyc[i], cyc[i-1]);
            }
        }
    }
    /* for(int i = 0; i < n; i++) cerr << p[i]+1 << (i+1==n ? '\n' : ' '); */
    cout << ans.size() << ' ' << ans.size() << '\n';
    for(auto [a, b]: ans) cout << a+1 << ' ' << b+1 << '\n';
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
}

Compilation message

cat.cpp: In function 'void solve()':
cat.cpp:76:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |     for(auto [a, b]: ans) cout << a+1 << ' ' << b+1 << '\n';
      |              ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 632 KB Output is correct
2 Correct 26 ms 512 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 27 ms 632 KB Output is correct
3 Correct 26 ms 512 KB Output is correct
4 Correct 31 ms 632 KB Output is correct
5 Correct 11 ms 512 KB Output is correct
6 Correct 9 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 632 KB Output is correct
2 Correct 26 ms 512 KB Output is correct
3 Correct 519 ms 12308 KB Output is correct
4 Correct 492 ms 10944 KB Output is correct
5 Correct 559 ms 13356 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 27 ms 632 KB Output is correct
3 Correct 26 ms 512 KB Output is correct
4 Correct 31 ms 632 KB Output is correct
5 Correct 11 ms 512 KB Output is correct
6 Correct 9 ms 384 KB Output is correct
7 Correct 519 ms 12308 KB Output is correct
8 Correct 492 ms 10944 KB Output is correct
9 Correct 559 ms 13356 KB Output is correct
10 Correct 557 ms 11040 KB Output is correct
11 Correct 505 ms 8896 KB Output is correct
12 Correct 530 ms 10996 KB Output is correct
13 Correct 597 ms 12884 KB Output is correct
14 Correct 518 ms 10568 KB Output is correct