oj.uz

답안 #466458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466458 2021-08-19T10:23:54 Z myvaluska Xor Sort (eJOI20_xorsort) C++14
0 / 100
 1 ms 204 KB 
// palindromefree.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
//long long int cifra[20]; 

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    int s;
    cin >> n;
    cin >> s;
    vector<int>v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }
    vector<pair<int, int>>vys;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n-1; j++)
        {
            if (v[j] < v[j + 1])
            {
                vys.push_back({ j,j + 1 });
                vys.push_back({ j + 1,j });
                swap(v[j], v[j + 1]);
            }
        }
    }
    cout << vys.size() << endl;
    for (int i = 0; i < vys.size(); i++)
    {
        cout << vys[i].first + 1 << ' ';
        cout << vys[i].second + 1 << endl;
    }
    return 0;
    //std::cout << "Hello World!\n";
}

Compilation message

xorsort.cpp: In function 'int main()':
xorsort.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for (int i = 0; i < vys.size(); i++)
      |                     ~~^~~~~~~~~~~~

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Not sorted
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Not sorted
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Not sorted
2 Halted 0 ms 0 KB -