# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092736 | I_am_Polish_Girl | Group Photo (JOI21_ho_t3) | C++14 | 1 ms | 460 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")
#pragma GCC optimize("O3")
#pragma GCC optimization ("unroll-loops")
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <bitset>
#define int long long
using namespace std;
int log_ = 3;
int inf = 2000000000000000000;
int mod = 5;
int p = 505;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector <int> pos(n + 1);
for (int i = 0; i < n; i++)
pos[a[i]] = i;
vector <int> dp(n + 1 , inf);
dp[n] = 0;
for (int i = n; i >= 1; i--)
{
for (int s = 1; s <= n; s++)
{
if (i - s < 0)
break;
int c = 0;
int x = i;
for (int j = i - s; j < i; j++)
{
c += abs(pos[x] - j);
x--;
}
dp[i - s] = min(dp[i - s], dp[i] + c);
}
}
cout << dp[0]/2;
}
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... |