Submission #1086985

#	Time	Username	Problem	Language	Result	Execution time	Memory
1086985		RiverFlow	Sorting (IOI15_sorting)	C++14	36 / 100	1 ms	516 KiB

sorting

//#include "sorting.h"
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
    p[0] = q[0] = 0;
	bool sub1 = 1, sub2 = 1;
    FOR(i, 0, m - 1) {
        sub1 &= max(x[i], y[i]) == 0;
        sub2 &= (x[i] == 0 and y[i] == 1);
    }
    int ans = 0;
    if (sub1) {
        FOD(i, n - 1, 0) if (s[i] != i) {
            FOD(j, i - 1, 0) if (s[j] == i) {
                p[ans] = i, q[ans] = j;
                ++ans;
                swap(s[i], s[j]);
                break ;
            }
        }
        return ans;
    }
    if (sub2) {
        if (is_sorted(s, s + n)) {
            return 0;
        }
        while (true) {
            if (is_sorted(s, s + n))
                return ans;
            // new turn
            swap(s[0], s[1]);
            bool fx=0;
            FOD(i, n - 1, 0) if (s[i] != i) {
                fx=1;
                FOD(j, i - 1, 0) if (s[j] == i) {
                    p[ans] = i,
                    q[ans] = j;
                    ++ans;
                    swap(s[i],s[j]);
                    break ;
                }
                break;
            }
            if (!fx) {
                p[ans]=q[ans]=0;
                ++ans;
            }
        }
        return ans;
    }

    return 1;
}

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26