# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
932702 | nguyentunglam | Permutation (APIO22_perm) | C++17 | 6 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.
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const long long inf = 2e18;
long long calc (vector<int> a) {
vector<long long> f(a.size());
long long ret = 1;
for(int i = 0; i < a.size(); i++) {
f[i] = 1;
for(int j = 0; j < i; j++) if (a[j] < a[i]) f[i] = min(inf, f[i] + f[j]);
ret += f[i];
}
return ret;
}
vector<int> get (vector<int> p) {
vector<int> rrh = p;
sort(rrh.begin(), rrh.end());
rrh.resize(unique(rrh.begin(), rrh.end()) - rrh.begin());
auto get = [&] (int x) {
return lower_bound(rrh.begin(), rrh.end(), x) - rrh.begin();
};
for(auto &j : p) j = get(j);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |