oj.uz

답안 #990302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990302 2024-05-30T07:09:30 Z vahagng Xor Sort (eJOI20_xorsort) C++17
25 / 100
 78 ms 18804 KB 
//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// Defines

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pii pair<int, int>
#define ppb pop_back
#define pb push_back
#define mii map<int, int>
#define mll map<long long, long long>
#define no_ans cout << -1 << '\n';
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define ok cout << "OK\n";

// Constants 

const int N = 4e5+10, M = 105;
const ll inf = 1e18, mod = 1e9+7;

// Functions

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    } else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}
 
void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

ll add(ll a, ll b)
{
    return (a + b)%mod;
}

ll mult(ll a, ll b)
{
    return (a%mod * b%mod)%mod;
}

ll sub(ll a, ll b)
{
    return (a - b + 2*mod)%mod;
}

long long binpower(long long a, long long n) {
	if(n == 0) {
		return 1;
	}
 
	if(n == 1) {
		return a;
	}
 
	if(n % 2 == 1) {
		long long curr = binpower(a, n / 2);
		curr = mult(curr, curr);
		curr = mult(a, curr);
		return curr;
	} else {
		long long curr = binpower(a, n / 2);
		return mult(curr, curr);
	}
}

ll power(int a, int b)
{
    ll res = 1;
    while(b--)
    {
        res*=a;
    }
    return res;
}

// const int N = 2e5 + 10;
// int n;
// pair<int,int>max_dist;
// vector<int>adj[N];
// int dists[N];

// void dfs(int node, int parent, int dist) 
// {
//     dists[node] = max(dists[node], dist);
// 	if(dist > max_dist.first) 
//     {
// 		max_dist = {dist, node};
// 	}
 
// 	for(auto i: adj[node]) 
//     {
// 		if(i == parent) continue;
// 		dfs(i, node, dist + 1);
// 	}
// }
 
// pair<int, int> get_farthest_distance(int node) 
// {
// 	max_dist = {-1, -1};
// 	dfs(node, -1, 0);
// 	return max_dist;
// }

void precision(int x)
{
	cout.setf(ios::fixed | ios::showpoint);
	cout.precision(x);
	return;
}

ll countSubstring(const string str, const string sub)
{
	if (sub.length() == 0) return 0;
	ll count = 0;
	for(int i = 0; i < str.size() - sub.size() + 1; i++) 
    {
        int okk = 1;
        for(int j = i; j < i + sub.size(); j++) 
        {
            if(str[j] != sub[j - i]) 
            {
                okk = 0;
                break;
            }
        }
        count += okk;
    }
    return count;
}

ll ceil_division(ll a, ll b)
{
    return (a + b - 1) / b;
}

ll max_subarray_sum(vector<ll>& v, int n)
{
    ll a = INT64_MIN, b = 0;
    for(int i = 0; i < n; i++)
    {
        b += v[i];
        if(b > a)
        {
            a = b;
        }
        if(b<0)
        {
            b = a;
        }
    }
    return a;
}

// Solution

/*
5
2 1 1 2 5
6
INFLATION 1
SET 3 2
SET 5 2
INFLATION 4
SET 6 1
SET 10 1

*/


void solve()
{
    int n, s;
    cin >> n >> s;
    s = (s-1)^1;
    vector<pair<ll,ll>>ans;
    vector<ll>v(n);
    for(auto& i : v) cin >> i;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n - i - 1; j++)
        {
            if(v[j] + s > v[j+1])
            {
                ans.push_back({j+1, j+2});
                ans.push_back({j+2, j+1});
                ans.push_back({j+1, j+2});
                swap(v[j], v[j+1]);
            }
        }
    }
    cout << ans.size() << '\n';
    for(auto i : ans)
    {
        cout << i.first << ' ' << i.second << '\n';
    }
}

void precalc()
{

}

int main()
{
    // SetIO("mootube");
    FastIO();
    precalc();
    int test_case = 1;
    // cin >> test_case;
    while (test_case--) 
    {
        solve();
    }
    return 0;
}

Compilation message

xorsort.cpp: In function 'long long int countSubstring(std::string, std::string)':
xorsort.cpp:132:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |  for(int i = 0; i < str.size() - sub.size() + 1; i++)
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xorsort.cpp:135:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |         for(int j = i; j < i + sub.size(); j++)
      |                        ~~^~~~~~~~~~~~~~~~
xorsort.cpp: In function 'void SetIO(std::string)':
xorsort.cpp:34:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xorsort.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xorsort.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
xorsort.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 736 KB Output is correct
5 Correct 2 ms 992 KB Output is correct
6 Correct 2 ms 992 KB Output is correct
7 Correct 2 ms 992 KB Output is correct
8 Correct 2 ms 1248 KB Output is correct
9 Correct 2 ms 992 KB Output is correct
10 Correct 2 ms 992 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1500 KB Output is correct
13 Correct 4 ms 1496 KB Output is correct
14 Correct 4 ms 1500 KB Output is correct
15 Correct 4 ms 1496 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 736 KB Output is correct
5 Correct 2 ms 992 KB Output is correct
6 Correct 2 ms 992 KB Output is correct
7 Correct 2 ms 992 KB Output is correct
8 Correct 2 ms 1248 KB Output is correct
9 Correct 2 ms 992 KB Output is correct
10 Correct 2 ms 992 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1500 KB Output is correct
13 Correct 4 ms 1496 KB Output is correct
14 Correct 4 ms 1500 KB Output is correct
15 Correct 4 ms 1496 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 992 KB Output is correct
18 Correct 3 ms 1244 KB Output is correct
19 Correct 4 ms 1244 KB Output is correct
20 Correct 3 ms 1156 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Correct 4 ms 1244 KB Output is correct
23 Correct 4 ms 1244 KB Output is correct
24 Correct 3 ms 1240 KB Output is correct
25 Correct 3 ms 1244 KB Output is correct
26 Incorrect 7 ms 1752 KB Integer 59568 violates the range [0, 40000]
27 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 408 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Incorrect 78 ms 18804 KB Integer 764742 violates the range [0, 40000]
6 Halted 0 ms 0 KB -