# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867745 | goodspeed0208 | Group Photo (JOI21_ho_t3) | C++14 | 1866 ms | 123556 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.
#include<iostream>
#include<vector>
#include<algorithm>
#define INF 1000000000
using namespace std;
int main() {
int n;
cin >> n;
vector<int>v(n);
for (auto &i : v) cin >> i;
vector<vector<int> >dp((1 << n), vector<int>(n, INF));
vector<int>back(n, 0);
for (int i = n-2 ; i >= 0 ; i--) {
back[i] = back[i+1] | (1 << (i+1));
//cout << back[i] << " ";
}
//cout << "\n";
int cost = 1;
for (int i = 0 ; i < n ; i++) dp[1 << i][i] = i;
for (int i = 1 ; i < (1 << n) ; i++) {
int t = __builtin_popcount(i);
for (int j = 0 ; j < n ; j++) {
for (int k = 0 ; k < n ; k++) {
if ( ((i >> k) & 1)==0 && (v[j] < v[k] + 2) ) {
int cost = k - t + __builtin_popcount(i & back[k]);
//cout << k << " " << t << " " << __builtin_popcount(i & back[k]) << "\n";
dp[i | (1 << k) ][k] = min(dp[i | (1 << k)][k], dp[i][j] + cost);
}
}
}
}
/*for (int j = 0 ; j < n ; j++) {
for (int i = 0 ; i < n ; i++) {
cout << dp[(1 << n) - 1][i] << endl;
}
}*/
cout << *min_element(dp[(1 << n) - 1].begin(), dp[(1 << n) - 1].end()) << "\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |