# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114896 | ortsac | Dancing Elephants (IOI11_elephants) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define fr first
#define se second
int32_t main() {
int n, s;
cin >> n >> s;
vector<pii> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].fr;
v[i].fr++;
v[i].fr %= s;
v[i].se = (i + 1);
}
sort(v.begin(), v.end());
vector<pii> ord;
int mi = 1e9;
do {
int qtd = 0;
int pf = 0;
for (int i = 0; i < (n - 1); i++) {
pf = ((pf + v[i].fr) % s);
if (pf == (s - 1)) {
qtd++;
pf = 0;
}
}
if (qtd < mi) {
mi = qtd;
ord = v;
}
} while (next_permutation(v.begin(), v.end()));
cout << mi << "\n";
for (auto u : ord) cout << u.se << " ";
cout << "\n";
}