oj.uz

답안 #1089340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089340 2024-09-16T10:15:19 Z Has2008 Xor Sort (eJOI20_xorsort) C++17
60 / 100
 52 ms 1752 KB 
#include "bits/stdc++.h"
using namespace std;

#define int long long
#define endl endl

const int mod = 1e9 + 7;
const int maxn = 1e6;

int n, s, arr[maxn];
vector < pair < int, int >> ans;
void s1()
{
    for (int i = n - 1; i >= 0; i--)
    {
        int p = -1;
        for (int j = 0; j <= i; j++)
        {
            if (p == -1 || arr[p] < arr[j]) p = j;
            if (j) ans.push_back({j - 1, j});
        }
        for (int j = p + 1; j <= i; j++) ans.push_back({j, j - 1});

        for (int j = p - 2; j >= 0; j--) ans.push_back({j, j + 1});

        for (int j = p; j + 1 < n; j++) swap(arr[j], arr[j + 1]);

    }
    for (int i = n - 2; i >= 0; --i) ans.push_back({i, i + 1});
}

void s2()
{
    for(int i = 19; i >= 0; i--)
    {
        for(int j = 0; j < n; j++)
        {
            if(arr[j + 1] >= (1 << (i + 1))) break;
            if(!(arr[j] & (1 << i))) continue;
            if(!(arr[j + 1] & (1 << i))) ans.push_back({j + 1, j}), arr[j + 1] ^= arr[j];

            ans.push_back({j, j + 1});
            arr[j] ^= arr[j + 1];
        }
    }
}

void solve()
{
    cin >> n >> s;

    for(int i = 0; i < n; i++) cin >> arr[i];
    int arr2[n];


    if(s == 1) s1();
    else s2();

    cout << ans.size() << endl;
    for(auto [i, j] : ans) cout << i + 1 << " " << j + 1 << endl;

}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int tt = 1;
    //cin >> tt;

    while(tt--) solve();
}

Compilation message

xorsort.cpp: In function 'void solve()':
xorsort.cpp:53:9: warning: unused variable 'arr2' [-Wunused-variable]
   53 |     int arr2[n];
      |         ^~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 25 ms 1060 KB Output is correct
5 Correct 23 ms 988 KB Output is correct
6 Correct 24 ms 1044 KB Output is correct
7 Correct 23 ms 1064 KB Output is correct
8 Correct 24 ms 992 KB Output is correct
9 Correct 24 ms 1048 KB Output is correct
10 Correct 23 ms 992 KB Output is correct
11 Correct 24 ms 988 KB Output is correct
12 Correct 24 ms 992 KB Output is correct
13 Correct 24 ms 1104 KB Output is correct
14 Correct 25 ms 988 KB Output is correct
15 Correct 23 ms 988 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 25 ms 1060 KB Output is correct
5 Correct 23 ms 988 KB Output is correct
6 Correct 24 ms 1044 KB Output is correct
7 Correct 23 ms 1064 KB Output is correct
8 Correct 24 ms 992 KB Output is correct
9 Correct 24 ms 1048 KB Output is correct
10 Correct 23 ms 992 KB Output is correct
11 Correct 24 ms 988 KB Output is correct
12 Correct 24 ms 992 KB Output is correct
13 Correct 24 ms 1104 KB Output is correct
14 Correct 25 ms 988 KB Output is correct
15 Correct 23 ms 988 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 23 ms 1064 KB Output is correct
18 Correct 52 ms 1500 KB Output is correct
19 Correct 42 ms 1496 KB Output is correct
20 Correct 49 ms 1752 KB Output is correct
21 Correct 44 ms 1500 KB Output is correct
22 Correct 43 ms 1552 KB Output is correct
23 Correct 41 ms 1500 KB Output is correct
24 Correct 49 ms 1500 KB Output is correct
25 Correct 50 ms 1496 KB Output is correct
26 Correct 43 ms 1500 KB Output is correct
27 Correct 43 ms 1500 KB Output is correct
28 Correct 43 ms 1500 KB Output is correct
29 Correct 41 ms 1500 KB Output is correct
30 Correct 43 ms 1500 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Integer 6 violates the range [1, 5]
2 Halted 0 ms 0 KB -