oj.uz

Submission #557910

# Submission time Handle Problem Language Result Execution time Memory
557910 2022-05-06T09:53:16 Z FatihSolak W (RMI18_w) C++17
20 / 100
 600 ms 32556 KB 
#include <bits/stdc++.h>
#define N 300005
using namespace std;
const int mod = 1e9 + 7;
long long fact[N];
long long ifact[N];
long long binpow(long long a,long long b){
	long long ret = 1;
	while(b){
		if(b & 1)
			ret = ret*a%mod;
		a = a*a%mod;
		b >>= 1;
	}
	return ret;
}
long long C(int n,int r){
	return fact[n] * ifact[r]%mod*ifact[n-r]%mod;
}
long long val[N][5];
void solve(){
	int n;
	cin >> n;
	map<int,int> cnt;
	for(int i = 1;i<=n;i++){
		int x;
		cin >> x;
		cnt[x]++;
	}
	vector<int> v;
	for(auto u:cnt)
		v.push_back(u.second);
	if(cnt.size() == 2){
		if(v[0] < 2 || v[1] < 3){
			cout << 0;
			return;
		}
		cout << C(v[0]-2+1,1) *C(v[1]-3+2,2) %mod;
		return;
	}
	for(int i = 2;i<=n;i++){
		val[i][1] = 1;
	}
	for(int i = 3;i<=n;i++){
		val[i][2] = (binpow(2,i-1) - 2 + mod)%mod;
	}
	for(int i = 4;i<=n;i++){
		//val[n][3] = (3^n - 2^(n+2) - 2n + 11)/4
		val[i][3] = (binpow(3,i) - binpow(2,i+2) - 2*i + 11 + 2*mod)%mod*binpow(4,mod-2)%mod;
		//cout << i << " " << val[i][3] << endl;
	}
	for(int i = 5;i<=n;i++){
		for(int j = 2;j<=i-3;j++){
			val[i][4] = (val[i][4] + C(i-1,j-1) * 
			(   (binpow(3,i-j) - binpow(2,i-j+1) - 2 * (i-j) + 3 + 2*mod  )* binpow(4,mod-2)%mod        )%mod);
		}
		val[i][4] = val[i][4] *2 %mod;
		cout << i << " " << val[i][4] << endl;
	}
	cout << val[n][4] << endl;

}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	#ifdef Local
		freopen("in.txt","r",stdin);
		freopen("out.txt","w",stdout);
	#endif
	fact[0] = ifact[0]= 1;
	for(int i = 1;i<N;i++){
		fact[i] = fact[i-1] * i %mod;
		ifact[i] = binpow(fact[i],mod-2);
	}
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
	#ifdef Local
		cout << endl << fixed << setprecision(2) << 1000.0*clock()/CLOCKS_PER_SEC << " milliseconds.";
	#endif
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 4896 KB Output is correct
2 Correct 46 ms 4964 KB Output is correct
3 Correct 49 ms 5232 KB Output is correct
4 Correct 59 ms 5176 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 4948 KB Output isn't correct
2 Incorrect 159 ms 5112 KB Output isn't correct
3 Execution timed out 1070 ms 8092 KB Time limit exceeded
4 Execution timed out 1073 ms 14436 KB Time limit exceeded
5 Execution timed out 1058 ms 23564 KB Time limit exceeded
6 Execution timed out 1086 ms 32556 KB Time limit exceeded

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 4940 KB Output isn't correct
2 Incorrect 48 ms 4892 KB Output isn't correct
3 Incorrect 48 ms 4996 KB Output isn't correct
4 Incorrect 74 ms 4992 KB Output isn't correct
5 Incorrect 496 ms 5120 KB Output isn't correct
6 Execution timed out 1093 ms 5564 KB Time limit exceeded
7 Execution timed out 1093 ms 5804 KB Time limit exceeded
8 Execution timed out 1085 ms 9344 KB Time limit exceeded
9 Execution timed out 1077 ms 13248 KB Time limit exceeded
10 Execution timed out 1057 ms 31996 KB Time limit exceeded