Submission #602243

#	Time	Username	Problem	Language	Result	Execution time	Memory
602243		gagik_2007	Group Photo (JOI21_ho_t3)	C++17	5 / 100	3 ms	212 KiB

Main

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef ll itn;

#define ff first
#define ss second

string findSum(string str1, string str2)
{
    if (str1.length() > str2.length())
        swap(str1, str2);
    string str = "";
    ll n1 = str1.length(), n2 = str2.length();
    reverse(str1.begin(), str1.end());
    reverse(str2.begin(), str2.end());
    ll carry = 0;
    for (ll i = 0; i < n1; i++)
    {
        ll sum = ((str1[i] - '0') + (str2[i] - '0') + carry);
        str.push_back(sum % 10 + '0');
        carry = sum / 10;
    }
    for (ll i = n1; i < n2; i++)
    {
        ll sum = ((str2[i] - '0') + carry);
        str.push_back(sum % 10 + '0');
        carry = sum / 10;
    }
    if (carry)
        str.push_back(carry + '0');
    reverse(str.begin(), str.end());
    return str;
}
bool isSmaller(string str1, string str2)
{
    ll n1 = str1.length(), n2 = str2.length();
    if (n1 < n2)
        return true;
    if (n2 < n1)
        return false;
    for (ll i = 0; i < n1; i++)
        if (str1[i] < str2[i])
            return true;
        else if (str1[i] > str2[i])
            return false;
    return false;
}
string findDiff(string str1, string str2)
{
    if (isSmaller(str1, str2))
        swap(str1, str2);
    string str = "";
    ll n1 = str1.length(), n2 = str2.length();
    reverse(str1.begin(), str1.end());
    reverse(str2.begin(), str2.end());
    ll carry = 0;
    for (ll i = 0; i < n2; i++) {
        ll sub
            = ((str1[i] - '0') - (str2[i] - '0') - carry);
        if (sub < 0) {
            sub = sub + 10;
            carry = 1;
        }
        else
            carry = 0;
        str.push_back(sub + '0');
    }
    for (ll i = n2; i < n1; i++) {
        ll sub = ((str1[i] - '0') - carry);
        if (sub < 0) {
            sub = sub + 10;
            carry = 1;
        }
        else
            carry = 0;
        str.push_back(sub + '0');
    }
    reverse(str.begin(), str.end());
    return str;
}

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 32768;
const ll N = 100007;
ll n, m, k;
ll a[1000007];

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    if (n <= 9) {
        vector<int>p;
        for (int i = 0; i < n; i++) {
            p.push_back(i);
        }
        ll ans = INF;
        do {
            bool ok = true;
            for (int i = 0; i < n - 1; i++) {
                if (a[p[i]] >= a[p[i + 1]] + 2) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                ll res = 0;
                vector<int>c(n);
                vector<int>pp = p;
                for (int i = 0; i < n; i++) {
                    c[pp[i]] = i;
                }
                for (int i = 0; i < n; i++) {
                    res += abs(i - c[i]);
                    for (int j = c[i] - 1; j >= i; j--) {
                        swap(pp[j], pp[j + 1]);
                    }
                    for (int i = 0; i < n; i++) {
                        c[pp[i]] = i;
                    }
                    //cout << res << " " << i << " " << c[i] << "   ";
                    c[i] = i;
                }
                //cout << "   ";
                ans = min(ans, res);
                //for (int i = 0; i < n; i++)cout << p[i] << " ";
                //cout << res << endl;
            }
        } while (next_permutation(p.begin(), p.end()));
        cout << ans << endl;
    }
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 32
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36