이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
vector<ll> fact(n);
fact[0] = 1;
for(int i = 1; i < n; ++i)
fact[i] = i*fact[i-1];
vector<ll> p(n);
for(auto& x : p)
cin >> x;
ll lex = 0;
vector<ll> srt(p.begin(), p.end());
sort(srt.begin(), srt.end());
int i = 0;
while(!srt.empty())
{
auto it = lower_bound(srt.begin(), srt.end(), p[i]);
int pos = it - srt.begin();
lex = (lex + pos*fact[n-i-1]) % MOD;
srt.erase(it);
++i;
}
++lex;
cout << lex << '\n';
return 0;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |