oj.uz

Submission #739898

# Submission time Handle Problem Language Result Execution time Memory
739898 2023-05-11T14:26:35 Z MODDI Cryptography (NOI20_crypto) C++14
14 / 100
 434 ms 39660 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n;
vi arr, p;
const int mod = 1e9 + 7;
int power[300100];
int main(){
	cin>>n;
	arr.resize(n);
	for(int i = 0; i < n; i++){
		cin>>arr[i];
		p.pb(arr[i]);
	}
	memset(power, 0, sizeof power);
	power[1] = 1;
	for(int i =2; i < n; i++){
		power[i] = i * power[i-1];
		power[i] %= mod;
	}
	cout<<endl;
	sort(p.begin(), p.end());
	map<ll, ll> lower;
	for(int i = 0; i < n; i++)
		lower[p[i]] = i;
		
	int ele = n - 1;
	ll ans = 0;
	ordered_set o_set;
	for(int i = 0; i < n; i++){
		ll here = lower[arr[i]] - o_set.order_of_key(arr[i]);
//		cout<<here<<" "; 
//		cout<<here<<" "<<power[ele]<<" "<<ele<<endl;
		ans += (here * power[ele]) % mod;
		ans %= mod;
		ele--;
		o_set.insert(arr[i]);
	}
//	cout<<endl;
	cout<<(ans+1)%mod<<endl;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1460 KB Output is correct
4 Correct 1 ms 1456 KB Output is correct
5 Correct 1 ms 1456 KB Output is correct
6 Correct 1 ms 1460 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 1 ms 1440 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1364 KB Output is correct
19 Correct 1 ms 1460 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1456 KB Output is correct
24 Correct 1 ms 1364 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Incorrect 434 ms 39660 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Incorrect 402 ms 38568 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Incorrect 3 ms 1748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1460 KB Output is correct
4 Correct 1 ms 1456 KB Output is correct
5 Correct 1 ms 1456 KB Output is correct
6 Correct 1 ms 1460 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 1 ms 1440 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1364 KB Output is correct
19 Correct 1 ms 1460 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1456 KB Output is correct
24 Correct 1 ms 1364 KB Output is correct
25 Correct 1 ms 1364 KB Output is correct
26 Incorrect 3 ms 1748 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Incorrect 402 ms 38568 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1460 KB Output is correct
4 Correct 1 ms 1456 KB Output is correct
5 Correct 1 ms 1456 KB Output is correct
6 Correct 1 ms 1460 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 1 ms 1440 KB Output is correct
15 Correct 1 ms 1364 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1364 KB Output is correct
19 Correct 1 ms 1460 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1364 KB Output is correct
23 Correct 1 ms 1456 KB Output is correct
24 Correct 1 ms 1364 KB Output is correct
25 Correct 1 ms 1364 KB Output is correct
26 Incorrect 434 ms 39660 KB Output isn't correct
27 Halted 0 ms 0 KB -