제출 #237509

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237509		kartel	Karte (COCI18_karte)	C++14	12 / 120	1094 ms	9208 KiB

karte

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +500500
#define MaxS N * N
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
//#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int a[N], b[N], nm[N], i, n, kl, k;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> kl;
    for (i = 1; i <= n; i++) cin >> a[i], nm[i] = i;

    for (int p = 1; p <= 500; p++)
    {
        random_shuffle(nm + 1, nm + 1 + n);
        for (i = 1; i <= n; i++) b[i] = a[nm[i]];

        k = 0;
        for (i = n; i >= 1; i--)
        {
            if (a[i] > k) k++;
        }

        if (k == kl)
        {
            for (i = 1; i <= n; i++) cout << b[i] << " ";
            return 0;
        }
    }
    cout << "-1";

}

//  x ^ 2 + y ^ 2 = 1
//  x * a_i + y * b_i
//  a_i = -b_i * tan(alpha)
//  a_i / -b_i = tan(alpha)
//  alpha = atan(a_i / (-b_i))

• Subtask 1: 12 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12