oj.uz

답안 #523537

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523537 2022-02-07T18:10:36 Z Farhan_HY Cat (info1cup19_cat) C++14
3.5 / 100
 1000 ms 19096 KB 
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(); cin.tie(0); cout.tie(0);

using namespace std;

const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
int a[N];
int n, m;
map<int, int> Pos;
vector<pair<int, int>> v;

void Swap(int i, int p)
{
    swap(Pos[a[i]], Pos[a[p]]);
    swap(a[i], a[p]);
    v.pb({i, p});
    swap(Pos[a[n - p + 1]], Pos[a[n - p + 1]]);
    swap(a[n - i + 1], a[n - p + 1]);
}

main()
{
    T
    {
        v.clear();
        Pos.clear();
        cin >> n;
        for(int i = 1; i <= n ; i++)
            cin >> a[i], Pos[a[i]] = i;
        for(int i = 1; i <= n / 2; i++)
        {
            int p = Pos[i];
            if (a[i] == i)
                continue;
            if (p < n / 2)
                Swap(i, p);
            else
            {
                if (n - p - 1 == i)
                {
                    Swap(i, i + 1);
                    Swap(i, p);
                }
                else
                    Swap(i, p);
            }
        }
        bool ok = true;
        for(int i = 1; i <= n; i++)
            ok &= a[i] >= a[i - 1];
        if (!ok)
        {
            cout << "-1\n";
            continue;
        }
        cout << v.size() << ' ' << v.size() << '\n';
        for(auto x: v)
            cout << x.F << ' ' << x.S << '\n';
    }
}

Compilation message

cat.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main()
      | ^~~~

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 308 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
3.5 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 84 ms 520 KB Valid reconstruction
2 Partially correct 70 ms 928 KB Valid reconstruction

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 308 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 84 ms 520 KB Valid reconstruction
2 Partially correct 70 ms 928 KB Valid reconstruction
3 Execution timed out 1072 ms 19096 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 308 KB Wrong answer
2 Halted 0 ms 0 KB -