# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
329819 | JiratQ | Cryptography (NOI20_crypto) | C++14 | 229 ms | 33876 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 int long long
using namespace std;
int dp[300010];
int fw[300010];
int fac(int n){
if(dp[n]!=0) return dp[n];
if(n==0) return 1;
return dp[n]=(fac(n-1)%1000000007*n);
}
void update(int node,int val){
while(node<300010){
fw[node] += val;
node += (node&-node);
}
}
int qs(int node){
int sum=0;
while(node>0){
sum += fw[node];
node -= (node&-node);
}
return sum;
}
main(){
int n;
cin >> n;
vector<int> vec;
for(int i=0;i<n;i++){
int k;
scanf("%lld",&k);
vec.emplace_back(k);
}
vector<int> v=vec;
sort(v.begin(),v.end());
unordered_map<int,int> mapp;
int cnt=1;
for(int i=0;i<n;i++){
mapp[v[i]]=cnt;
cnt++;
}
for(int i=0;i<n;i++){
vec[i]=mapp[vec[i]];
}
int ans=1;
for(int i=0;i<n;i++){
int c=qs(vec[i]);
update(vec[i],1);
ans += ((vec[i]-1-c) * fac(n-1-i));
ans %= 1000000007;
}
cout << ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |