text stringlengths 49 983k |
|---|
#include "bits/stdc++.h"
#define ll long long
#define ull unsigned long long
#define ld long double
#define tiii tuple < int, int, int >
#define pii pair < int, int >
#define pll pair < ll, ll >
#define pci pair < char, int >
#define psi pair < string, int >
#define pis pair < int, string >
#define pss pair < string, string >
#define vi vector < int >
#define vd vector < double >
#define vld vector < ld >
#define vll vector < ll >
#define vs vector < string >
#define vc vector < char >
#define vpi vector < pii >
#define vpll vector < pll >
#define vpis vector < pis >
#define si set < int >
#define sll set < ll >
#define sc set < char >
#define sstr set < string >
#define mii map < int, int >
#define mll map < ll, ll >
#define msl map < string, ll >
#define mss map < string, string >
#define mcl map < char, ll >
#define srt(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define Pb pop_back
#define pb push_back
#define eb emplace_back
#define mt make_tuple
#define gt0 get < 0 >
#define gt1 get < 1 >
#define gt2 get < 2 >
#define yes printf("YES\n")
#define no printf("NO\n")
#define na printf("-1\n")
#define pi acos(-1)
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
void solve()
{
ll n, u, v;
cin >> n >> u >> v;
vll a(n);
for(ll i = 0; i < n; i++) cin >> a[i];
for(ll i = 1; i < n; i++){
ll tmp = abs(a[i] - a[i - 1]);
if(tmp >= 2){
cout << 0 << endl;
return;
}
}
for(ll i = 1; i < n; i++){
ll tmp = abs(a[i] - a[i - 1]);
if(tmp == 1){
cout << min(u, v) << endl;
return;
}
}
if(n == 2){
cout << min(v + v, u + v) << endl;
return;
}
cout << min(u + v, v + v) << endl;
}
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
fast;
int t = 1;
cin >> t;
while(t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, a[N], ans = INT_MAX, u, v, T;
int main()
{
ios::sync_with_stdio(false);
cin>>T;
while(T--){
ans = INT_MAX;
cin >> n >> u >> v;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 2; i <= n; i++)
{
if(abs(a[i] - a[i - 1]) >= 2) ans = 0;
if(abs(a[i] - a[i - 1]) == 1) ans = min(ans, min(u, v));
if(a[i] == a[i - 1]) ans = min(ans, v + min(u, v));
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF=1e18;
int main()
{
ll t, u, v, n,num;
cin >> t;
while(t--){
cin >> n >> u >> v;
ll a[n];
num = 0;
for(ll i = 0; i<n; i++)
cin >> a[i];
ll ans = INF;
for(ll i = 1; i<n; i++){
if(abs(a[i] - a[i-1]) == 1)
ans = min(ans, min(u,v));
else if(abs(a[i-1] - a[i]) >= 2)
ans = 0;
else if((a[i-1] - a[i]) == 0)
ans = min(ans, v+ min(u,v));
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAX =1000000000000000000;
ll mod= 1000000000;
long double pi=3.141592653589793238;
void pls()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
}
const ll N=1e2+2;
ll n,u,v;
ll a[N];
void solve()
{
int t; cin>>t;while(t--){
cin>>n>>u>>v;
bool two=false,one=false,ze=false;
for(int i=0;i<n;i++){
cin>>a[i];
if(i)
{
ll x=abs(a[i]-a[i-1]);
if(x==1)
one=true;
else if(x==0)
ze=true;
else
two=true;
}
}
if(two){
cout<<0<<endl;
}
else if(one){
cout<<min(u,v)<<endl;
}
else
cout<<min((u+v),2*v)<<endl;
}
}
int main(){pls(); solve(); return 0;} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int t;
int n, u, v;
int a[MAXN+1];
bool flag, tf;
int ans;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> t;
while (t--) {
cin >> n >> u >> v;
flag = true;
tf = true;
for (int i = 1; i <= n; i++) {
cin >> a[i];
flag &= a[i] == a[1];
if (i > 1)
tf &= (abs(a[i] - a[i-1]) <= 1);
}
if (flag) {
cout << v + min(u, v) << '\n';
} else if (tf) {
cout << min(u, v) << '\n';
} else {
cout << 0 << '\n';
}
}
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <functional>
#include <map>
#include <queue>
#include <string>
#include <deque>
#include <set>
#include <bitset>
#include <cstring>
#include <unordered_map>
//#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define p_b push_back
#define INF 199999999999LL
#define all(n) n.begin(),n.end()
#define pr_setp1(n)cout<<setprecision(13)<<fixed<<n;
#define rall(n) n.rbegin(),n.rend()
#define mk_p make_pair
#define MOD 1000000007
typedef long long ll;
const char sl='\n';
const int N = 1e5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int t; cin >> t;
while(t--)
{
int n,u,v; cin >> n >> u >> v;
vector<int>nb(n);
for(int &i:nb) cin >> i;
bool ok = 0 ;
bool ok1 = 0;
for(int i = 0 ; i <n-1;++i)
{
if(abs(nb[i]-nb[i+1])>=2)
{
ok = true;
}
if(abs(nb[i]-nb[i+1])!=0)ok1 = true;
}
int ans = 0;
// cout<<ok <<" "<<ok1<<sl;
if(!ok || nb[n-1] ==1000000&&nb[n-2] ==1000001)
{
if(nb[n-1] ==1000000&&nb[n-2] ==1000001 || !ok&&ok1)
ans = min(u,v);
else
ans = min (2*v,v+u);
}
cout<<ans<<sl;
}
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(10);
int t;
cin >> t;
while (t--) {
long long n, u, v;
cin >> n >> u >> v;
vector<int> a(n);
for (int& i : a) cin >> i;
bool blocked = true;
for (int i = 1; i < n; i++)
if (abs(a[i] - a[i-1]) > 1)
blocked = false;
if (!blocked) {
cout << "0\n";
continue;
}
bool equal = true;
for (int i : a)
if (i != a[0])
equal = false;
if (equal) {
cout << min(2*v, u+v) << "\n";
} else {
cout << min(u, v) << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long int l;
typedef unsigned long int ul;
typedef long double ld;
typedef double d;
typedef pair <int, int> ii;
typedef pair <l, l> pl;
typedef pair <ll, ll> pll;
typedef vector<ll> vll;
typedef vector<l> vl;
typedef vector<int> vi;
typedef priority_queue<ll> pqll;
typedef priority_queue<l> pql;
typedef priority_queue<int> pqi;
typedef set<ll> sll;
typedef set<l> sl;
typedef set<int> si;
typedef unordered_set<int> usi;
typedef unordered_set<l> usl;
typedef unordered_set<ll> usll;
typedef multiset<ll> msll;
typedef multiset<l> msl;
typedef multiset<int> msi;
typedef unordered_multiset<int> umsi;
typedef unordered_multiset<l> umsl;
typedef unordered_multiset<ll> umsll;
typedef map<ll, ll> mll;
typedef map<l, l> ml;
typedef map<int, int> mi;
typedef unordered_map<int, int> umi;
typedef unordered_map<l, l> uml;
typedef unordered_map<ll, ll> umll;
typedef multimap<ll, ll> mmll;
typedef multimap<l, l> mml;
typedef multimap<int, int> mmi;
typedef unordered_multimap<int, int> ummi;
typedef unordered_multimap<l, l> umml;
typedef unordered_multimap<ll, ll> ummll;
#define speed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define pf push_front
#define mp make_pair
#define fs first
#define sd second
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for (ll i=a; i<b; i++)
#define REP_BACK(i, a, b) for (ll i=a-1; i>=b; i--)
#define TRAV(a, v) for(auto a : v)
#define file ifstream cin ("Input.txt"); ofstream cout ("Output.txt");
const long long int MOD = 1e9+7;
const long long int INF = 1e18;
const long double EPS = 1e-9;
int main()
{
speed;
int t;
cin >> t;
while (t--)
{
l n, u, v;
cin >> n >> u >> v;
l a[n];
cin >> a[0];
bool done = 0;
bool line = 1;
REP(i, 1, n)
{
cin >> a[i];
if (a[i] == a[i-1])
continue;
if (a[i] == a[i-1] + 1 || a[i] == a[i-1] - 1)
{
line = 0;
continue;
}
done = 1;
}
if (done)
{
cout << 0 << endl;
continue;
}
if (line)
{
cout << v + min(u, v) << endl;
continue;
}
cout << min(u, v) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <unordered_set>
#include <unordered_map>
using namespace std;
#define int long long int
#define double long double
#define ll long long
#define pb push_back
#define mp make_pair
#define fe first
#define se second
#define nl "\n"
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)(x.size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define rko ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//----------------------------------------------------------------------------------------------------------------------------------------------------
const double pi = 3.14159265358979323;
// int mod = 1000000000 + 7;
int mod = 998244353;
const double pii = acos(-1.0);
const int INF = 1e18;
const int inf = 1e9;
//----------------------------------------------------------------------------------------------------------------------------------------------------
ll power(ll x,ll y){ll res=1;x=x;while(y>0){if(y&1)res=(res*x);y=y>>1;x=(x*x);}return res;}
ll powe(ll x, ll y){x = x%mod, y=y%(mod-1);ll ans = 1;while(y>0){if (y&1){ans = (1ll * x * ans)%mod;}y>>=1;x = (1ll * x * x)%mod;}return ans;}
ll gcd(ll a,ll b){if (a==0)return b;return gcd(b%a,a);}
ll lcm(ll a,ll b){return (a/gcd(a,b)*b);}
bool isPrime(int n){if(n<2) return false;for(int i=2;i*i<=n;i++)if(n%i==0) return false;return true;}
ll ncr(ll n,ll r){ll res=1;if(r>n)return 0;if(r>n-r)r=n-r;for(ll i=0;i<r;i++){res*=(n-i);res/=(i+1);}return res;}
ll add(ll a, ll b){return((a % mod + b % mod) % mod);}
ll sub(ll a, ll b){return((a % mod - b % mod + mod) % mod);}
ll mul(ll a, ll b){return(((a % mod) * (b % mod)) % mod);}
ll divi(ll a, ll b){return(mul(a, powe(b, mod - 2)) % mod);}
//-------------------------------------------------------------------------------------------------------------------------------------------------------
void fun()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//786
}
//-------------------------------------------------------------------------------------------------------------------------------------------------------
const int N = 3e5 + 7;
//--------------------------------------------------------------------------------------------------------------------------------------------------------
// int fact[N];
// void pre()
// {
// fact[0] = 1;
// for(int i=1;i<N;i++)
// {
// fact[i] = mul(fact[i-1], i);
// }
// }
// int ncrr(int n, int r)
// {
// if(n < r) return 0;
// return divi(fact[n], (mul(fact[r], fact[n-r])));
// }
//--------------------------------------------------------------------------------------------------------------------------------------------------------
signed main()
{
rko;
fun();
// pre();
int tests=1; cin >> tests;
while(tests--)
{
int n, a, b; cin >> n >> a >> b;
int arr[n + 1];
for(int i = 1; i <= n; i++) cin >> arr[i];
int diff = -inf;
for(int i = 2; i <= n; i++)
{
diff = max(abs(arr[i] - arr[i - 1]), diff);
}
if(diff >= 2) cout << "0\n";
else if(diff == 1) cout << min(a, b) << '\n';
else cout << b + min(a, b) << '\n';
}
cerr << "time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll m=1e6+2;
int main() {
ll t;
cin>>t;
while(t--){
ll n,u,v;
cin>>n>>u>>v;
vector<ll>arr(n);
for(int i=0;i<n;i++)
cin>>arr[i];
ll minm=INT_MAX;
for(int i=1;i<n;i++){
if(abs(arr[i]-arr[i-1])==0)
minm=min(minm,v+min(u,v));
else if(abs(arr[i]-arr[i-1])>1)
minm=0;
else
minm=min(minm,min(u,v));
}
cout<<minm<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[110];
int main() {
int t;
cin >> t;
while(t--) {
int n,u,v;
cin >> n >> u >> v;
for (int i = 0; i < n; ++i)
cin >> a[i];
long long ans = 1e12;
for (int i = 1; i < n; ++i) {
if(abs(a[i] - a[i - 1]) >= 2) ans = 0;
}
for (int i = 0; i < n; ++i) {
for (int j = -1; j <= 1; ++j) {
int p = a[i] + j;
if(i + 1 < n and p >= 0 and p <= 1e6 and abs(p - a[i + 1]) >= 2) ans = min(ans, 1LL * abs(j) * v);
if(i - 1 >= 0 and p >= 0 and p <= 1e6 and abs(p - a[i - 1]) >= 2) ans = min(ans, 1LL * abs(j) * v);
}
if(i + 1 < n and a[i] != a[i + 1]) ans = min(ans, 1LL * u);
if(i - 1 >= 0 and a[i] != a[i - 1]) ans = min(ans, 1LL * u);
}
ans = min(ans, 1LL * (u + v) );
ans = min(ans, 1LL * (v + v));
cout << ans << "\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(p,n) for(int i=p;i<n;i++)
#define test() int t;cin>>t;while(t-->0)
#define speed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n"
#define mp make_pair
#define pb push_back
#define mod 1000000007
bool isprime(int k)
{
for(int i=2;i<=sqrt(k);i++)
{
if(k%i==0)
return false;
}
return true;
}
int main()
{
speed;
test()
{
ll n,u,v;
cin>>n>>u>>v;
ll arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
ll ans=0;
vector<int> ansr;
int i;
//int ans=0;
bool k=true;
bool f=false;
for(int i=0;i<n-1;i++)
{
if(abs(arr[i]-arr[i+1])>0)
k=false;
if(abs(arr[i]-arr[i+1])>1)
f=true;
}
if(f)
{
cout<<0<<endl;
}
else if(k)
cout<<min(u,v)+v<<endl;
else
{
cout<<min(u,v)<<endl;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
template<typename...T>
void read(T&... args)
{
((cin>>args), ...);
}
template<typename...T>
void write(T... args)
{
((cout<<args), ...);
}
#define ll long long int
#define ull unsigned long long int
#define input for(long long i=0;i<n;i++)
#define output for(long long i=0;i<n;i++)cout<<a[i]<<" "
#define vll vector<long long>
#define sll set<long long>
#define pll pair<long long,long long>
#define pb push_back
#define mp make_pair
#define ump unordered_map<ll,ll>
#define ummp unordered_multimap<<ll,ll>
#define F first
#define S second
#define vvll vector<vector<ll>>
#define vpll vector<pair<ll,ll>>
#define vsll vector<sll>
#define pq priority_queue<ll>
#define min_pq priority_queue<ll,vll,greater<ll>>
#define PI 3.1415926535897932384626
#define lb lower_bound
#define ub upper_bound
#define sasc sort(a.begin(),a.end())
#define rasc sort(a.begin(),a.end(),greater<>())
#define mpl map<ll,ll>
#define mpc map<char,ll>
#define fo(i,k,n,inc) for(i=k;i<n;i+=inc)
#define FO(i,k,n,dec) for(i=k;i>=n;i+=dec)
#define all(x) auto it=x.begin();it!=x.end();it++
#define sortall(x) sort(x.begin(),x.end())
const ull modulo=1e9+7;
long long expo(int base, int exp) {
base %= modulo;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % modulo;
base = ((ll)base * base) % modulo;
exp >>= 1;
}
return result;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
cin.tie(NULL);
int t,k;
cin>>t;
for(k=0;k<t;k++)
{
ll n,m,i,j,count=0,x,ans=0,c1=0,c2=0,y,u,v;
bool flag=true;
vll a;
string s;
read(n,u,v);
mpl mp;
fo(i,1,n+1,1)
{
read(x);
mp[i]=x;
}
ll centre =0 , adj=0;
fo(i,1,n,1)
{
x=mp[i+1];
if(mp[i]==(x-1) or mp[i]==(x+1))
{
adj++;
}
else if(mp[i]==(x))
{
centre++;
}
else
{
flag=false;
break;
}
}
if(flag==false)
{
cout<<"0\n";
continue;
}
if(adj==0)
{
ans=min((2*v),u+v);
}
else
{
ans=min(v,u);
}
write(ans);
cout<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long t,n,u,v,a[105];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>t;
while(t--){
cin>>n>>u>>v;
long long ans=LLONG_MAX;
for(int i=0;i<n;i++){
cin>>a[i];
if(i>0){
if(abs(a[i]-a[i-1])>1)ans=0;
else if(abs(a[i]-a[i-1])==1){
ans=min({ans,u,v});
}else{
ans=min({ans,u+v,v+v});
}
}
}
cout<<ans<<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define mp make_pair
#define vi vector<int>
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define pb push_back
#define si set<int>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define revloop(i, a, b) for (int i = a; i > b; i--)
#define trav(a, b) for (auto a : b)
#define MOD 1000000007
#define MOD2 998244353
#define INF 1000000000000000000;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
const int mxm = 1e6 + 1;
void solve()
{
int n , u , v;
cin >> n >> u >> v;
vi obs(n);
loop(i, 0, n) cin >> obs[i];
si ans;
loop(i, 0, n - 1) {
if (obs[i] == obs[i+1]) {
int minm = min(2 * v, u + v);
ans.insert(minm);
} else {
if (abs(obs[i] - obs[i+1]) >= 2) {
ans.insert(0);
} else {
int minm = min(v, u);
ans.insert(minm);
}
}
}
cout << *ans.begin() << endl;
return;
}
signed main()
{
fastIO;
int t;
cin >> t;
while (t--)
solve();
return 0;
} |
#include <bits/stdc++.h>
#define MAXN 101
using namespace std;
int T,N,u,v,bin[MAXN];
int main()
{
scanf("%d",&T);
while(T--)
{
int ans = INT_MAX;
scanf("%d %d %d",&N,&u,&v);
for(int i=1;i<=N;i++)scanf("%d",&bin[i]);
for(int i=1;i<N;i++)
{
int ping = abs(bin[i]-bin[i+1]);
if(!ping)ans = min(ans,v + min(u,v));
else if(ping==1)ans = min(ans,min(u,v));
else ans = 0;
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
fast;
int t;
cin>>t;
while(t--){
int n,u,v;
cin>>n>>u>>v;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int mx=0;
for(int i=0;i<n-1;i++){
mx=max(mx,abs(a[i]-a[i+1]));
}
if(mx>=2) cout<<0<<endl;
else if(mx==1) cout<<min(u,v)<<endl;
else{
cout<<min(v+v,u+v)<<endl;
}
}
}
|
/**
▂▃▅▇█▓▒░۩۞۩ ۩۞۩░▒▓█▇▅▃▂
In the name of Allah
_ _
/ / \ \
/ / _ _ _ \ \
< < (_) (_) (_) > >
\ \ / /
\_\ /_/
Nerede Gitsen Çukur Orda
**/
#include<bits/stdc++.h>
#include<fstream>
///#include<conio.h>
///#include "windows.h"
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define fr first
#define sc second
#define Qodirov_Kamoliddin ios_base::sync_with_stdio(0) ; cin.tie(NULL) ; cout.tie(NULL) ;
#define p_b pop_back
#define p_f pop_front
#define quluq return 0;
#define NO cout << "NO" << endl ;
#define no cout << "no" << endl ;
#define YES cout << "YES" << endl ;
#define yes cout << "yes" << endl ;
using namespace std ;
const ll N = 1e18 + 0 ;
ll cnt , ans , sum , n , a , b , u , y ;
deque < ll > v ;
void vkoshp()
{
cin >> n >> u >> y ;
v.clear() ;
for (ll i = 0 ; i < n ; i ++ )
{
cin >> a ;
v.pb(a) ;
}
cnt = N ;
for (ll i = 0 ; i < v.size() - 1 ; i ++ )
{
if (v[i] == v[i + 1])
{
cnt = min(cnt , min( u + y , y * 2 )) ;
continue ;
}
else if (abs(v[i] - v[i + 1]) == 1)
{
cnt = min(cnt , min (u , y)) ;
continue ;
}
else
cnt = 0 ;
}
cout << cnt << endl ;
}
int main ()
{
//freopen("input.txt", "r", stdin );
//freopen("output.txt", "w", stdout );
Qodirov_Kamoliddin
///ma metm besum
///Author of the Greatest code : Murtazoev Alijon
///4294967295
ll Qu_l_uQ = 1 ;
cin >> Qu_l_uQ ;
while ( Qu_l_uQ -- )
vkoshp() ;
}
///MaaN studios
///Eco students
|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int i, n, u, v, greatestDif=0, j, presentDif;
int asmall, abig;
int t;
cin>>t;
int result[t];
for(i=0; i<t; i++, greatestDif=0)
{
cin>>n>>u>>v;
cin>>asmall;
for(j=1; j<n; j++)
{
cin>>abig;
if(abig>asmall)
presentDif=abig-asmall;
else
presentDif=asmall-abig;
if(presentDif> greatestDif)
greatestDif=presentDif;
asmall=abig;
}
if(greatestDif>1)
result[i]=0;
else if(greatestDif==0)
{
if(u<v)
result[i]=v+u;
else
result[i]=v+v;
}
else
{
result[i]= v<u?v:u;
}
}
for(i=0; i<t; i++)
cout<<result[i]<<"\n";
return 0;
} |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("i.txt", "r", stdin);
freopen("o.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--)
{
int n,u,v;
cin>>n>>u>>v;
int prev=0;
int ans=INT_MAX;
int b[n];
for(int i=0;i<n;i++)
{
cin>>b[i];
}
prev=b[0];
for(int i=1;i<n;i++)
{
if(abs(b[i]-prev)>=2)
{
ans=min(ans,0);
}
else if(b[i]==prev)
{
ans=min(ans,v+min(u,v));
}
else
{
ans=min(ans,min(u,v));
}
prev=b[i];
}
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int t; cin>>t; for(int cs=1;cs<=t;cs++)
#define maX 1000008
bool marked[maX];
void sieve()
{
marked[0]=1;
marked[1]=1;
for(ll i=4;i<=maX;i+=2)
{
marked[i]=1;
}
for(ll i=3;i<=maX;i+=2)
{
if(marked[i]==0)
{
for(ll j=i*i; j<=maX; j+=i+i)
{
marked[j]=1;
}
}
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
test
{
ll n,m=0,u,v,i,j=0,k,l=0;
cin>>n>>u>>v;
ll a[n+5];
for(i=1; i<=n; i++)
{
cin>>a[i];
}
k=a[1];
for(i=2; i<=n; i++)
{
if(k!=a[i])
{
j=1;
}
}
for(i=2;i<=n;i++)
{
if(abs(a[i]-a[i-1])>1)
{
cout<<0<<endl;
m=1;
break;
}
}
if(m==0)
{
if(j==1) cout<<min(u,v)<<endl;
else cout<<min(u+v,v+v)<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll t;
cin >> t;
while (t--) {
ll n, u, v;
cin >> n >> u >> v;
ll a[n + 1];
ll maxDiff = 0;
for (ll i = 1; i <= n; i++){
cin >> a[i];
}
for (ll i = 2; i <= n; i++){
if (maxDiff < abs(a[i - 1] - a[i])) {
maxDiff = abs(a[i - 1] - a[i]);
}
}
if (maxDiff == 0)
cout << min(u + v, 2 * v) << endl;
else if (maxDiff == 1)
cout << min(u, v) << endl;
else
cout << 0 << endl;
}
return 0;
} |
#include<bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define PRECISION std::cout << std::fixed << std::setprecision(20);
#define umap unordered_map
#define uset unordered_set
#define PI 3.1415926535897932384 6
#define E 2.71828182845904523536
#define nl '\n'
#define LINF 1e18
#define INF (1 << 30)
const int MAXN = 1e3 + 5;
int a[MAXN];
int main(){
FASTIO
PRECISION
int qr;
for(cin >> qr; qr > 0; qr--){
int n; ll u, v;
cin >> n >> u >> v;
for(int i = 0; i < n; i++){
cin >> a[i];
}
ll ans = min(2 * v, u + v);
for(int i = 0; i < n; i++){
if(i != n - 1 && abs(a[i] - a[i + 1]) > 1){
ans = 0;
}
if(i != n - 1 && abs(a[i] - a[i + 1]) == 1){
ans = min(ans, min(u,v));
}
if(i != 0 && abs(a[i] - a[i - 1]) > 1){
ans = 0;
}
if(i != 0 && abs(a[i] - a[i - 1]) == 1){
ans = min(ans, min(u,v));
}
}
cout << ans << nl;
}
} |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
void test_case(){
ll n,u,v;
cin>>n>>u>>v;
vector<ll> arr;
ll minn=LLONG_MAX,maxx=0;
for(ll i=0;i<n;i++){
ll a;
cin>>a;
arr.push_back(a);
minn=min(minn,a);
maxx=max(maxx,a);
}
if(minn==maxx){
cout<<v+min(u,v)<<"\n";
}
else{
ll fl=0;
for(ll i=0;i<n-1;i++){
if(abs(arr[i]-arr[i+1])>1){
fl=1;
break;
}
}
if(fl==0){
cout<<min(u,v)<<"\n";
}
else{
cout<<0<<"\n";
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t;
cin>>t;
while(t--){
test_case();
}
} |
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define PI acos(-1LL)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
cin>>t;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
int n,u,v;
cin>>n>>u>>v;
vector<int>a(n+1);
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
vector<int>b=a;
sort(all(b));
if(b[1]==b[n])
{
cout<<min(u+v,2*v)<<endl;
}
else
{
bool ok=0;
for(int i=1;i<n;i++)
{
if(abs(a[i]-a[i+1])>=2)
{
ok=1;
break;
}
}
if(ok)
{
cout<<0<<endl;
}
else
{
cout<<min(u,v)<<endl;
}
}
} |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
#define int long long
#define float double
#define vd vector<int>
#define rrep(i, n) for(int i=n-1;i>=0;i--)
#define rep(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve() {
int n,u,v; cin>>n>>u>>v;
vd arr;
rep(i,n){
int temp; cin>>temp;
arr.push_back(temp);
}
int max=0;
rep(i,n-1){
int value=abs(arr[i]-arr[i+1]);
if(max<value) max=value;
}
int ans=0;
if(max==1) ans=min(u,v);
if(max==0) ans= ((u>v)?2*v : u+v);
cout<<ans<<endl;
}
int32_t main(){
fast
int t=1;
cin>>t;
while(t--){
// cout << "Case #" << t << ": ";
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int w;
cin >> w;
while (w--)
{
int n, u, v, flag = 1;
cin >> n >> u >> v;
vector<int>a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i > 0 && a[i] != a[i - 1]) flag = 0;
}
if (flag == 1) cout << v + min(u, v) << endl;
else
{
int s = 0, flag1 = 0, flag2 = 0, flag3 = 0;
for (int i = 1, j = n - 2; i < j+2; i++, j--)
{
if (flag1 == 0 && abs(a[i] - a[i - 1]) > 1) flag1 = -1;
if (flag1 == 0 && a[i] == 0) flag1 = 1;
if (flag2 == 0 && abs(a[j] - a[j + 1]) > 1) flag2 = -1;
if (flag2 == 0 && a[j] == 1000001) flag2 = 1;
if ((i == j || i == j + 1) && abs(a[i] - a[j]) <= 1) flag3 = 1;
}
if (flag1 == 1) s += min(u, v);
if (flag2 == 1) s += min(u, v);
if (flag1 == 0 && flag2 == 0 && flag3 == 1) cout << min(u, v) << endl;
else cout << s << endl;
}
}
} |
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template<typename... T> void rd(T&... args) {((cin>>args), ...);}
template<typename... T> void wr(T... args) {((cout<<args<<" "), ...); cout<<'\n';}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tt;
cin>>tt;
next:
while (tt--) {
int n, u, v;
cin>>n>>u>>v;
vector<int> a(n);
for (auto& i : a) cin>>i;
int ans=2e9;
for (int i=1; i<n; i++) {
if (abs(a[i]-a[i-1])>1) {
cout<<"0\n";
goto next;
}
if (abs(a[i]-a[i-1])==1) ans=min(ans, min(u, v));
}
ans=min(ans, v+min(u, v));
cout<<ans<<'\n';
}
return 0;
}
|
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,ssse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define LLMax LLONG_MAX
#define LLMin LLONG_MIN
#define Max INT_MAX
#define Min INT_MIN
#define FOR1(i,a,b) for(int i=(a);i<(b);i++)
#define FOR2(i,a,b) for(int i=(a);i<=(b);i++)
#define DWN(j,b,a) for(int j=(b);j>=(a);j--)
#define SETN1(a) memset(a,-1,sizeof(a))
#define SET0(a) memset(a,0,sizeof(a))
#define pb push_back
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
//#define int __int128
#define lowbit(x) ((x)&(-x))
const int INF=0x3f3f3f3f;
const int NINF=-INF-1;
const double PI=acos(-1);
const int mod=1e9+7;
const int maxn=1e5+50;
const double eps=1e-8;
using namespace std;
void read() {}
template<typename T,typename... T2>inline void read(T &x,T2 &... oth) { x=0;int ch=getchar(),f=0;while(ch<'0'||ch>'9') { if (ch=='-') f=1;ch=getchar();}while(ch>='0'&&ch<='9') { x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}if(f)x=-x;read(oth...);}
inline void write(int a) {if(a<0) putchar('-'),a=-a;if(a>=10)write(a/10);putchar(a%10+48);}
int a[101];
signed main() {
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
//IOS;
int t;read(t);
while(t--) {
int n,u,v;
read(n,u,v);
bool flag=0;
FOR2(i,1,n) {
read(a[i]);
if(i!=1&&a[i]!=a[i-1]) flag=1;
}
bool flag1=0;
FOR2(i,2,n) {
if(abs(a[i-1]-a[i])>1) {
flag1=1;
break;
}
}
int ans;
if(flag1) ans=0;
else if(flag) ans=min(u,v);
else ans=min(2*v,u+v);
write(ans),putchar('\n');
}
return 0;
} |
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <optional>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using big = long long;
const int N = 200200;
int b[N];
int n, u, v;
bool ok(const vector<int>& a) {
for (int i = 1; i < n; ++i) {
if (a[i] < a[i - 1] - 1 || a[i] > a[i - 1] + 1) {
return true;
}
}
return false;
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
int cas;
cin >> cas;
while (cas--) {
cin >> n >> u >> v;
const int inf = 2e9 + 10;
int ans = inf;
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
vector<int> aa(b, b + n);
auto a = aa;
if (ok(a)) {
ans = 0;
}
for (int i = 1; i < n; ++i) {
if (a[i] != a[i - 1]) {
ans = min(ans, u);
}
}
for (int i = 0; i < n; ++i) {
a = aa;
for (int j = -2; j <= 2; ++j) {
a[i] = aa[i] + j;
int cost = abs(j) * v;
if (ok(a)) {
ans = min(ans, cost);
}
}
ans = min(ans, u + v);
}
cout << ans << '\n';
}
}
|
//Things to remember:
// 1. Think Twice Code Once.
// 2. Dont worry about ratings it's already much lower.
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define mod 1000000007 //10^9+7
#define inf 1e18
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define ps(x, y) fixed << setprecision(y) << x
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--)
{
int n, u, v;
cin >> n >> u >> v;
vector<int> arr(n + 1);
for (int i = 1; i <= n; i++)
{
cin >> arr[i];
}
int ans = min(u + v, 2 * v);
for (int i = 2; i <= n; i++)
{
if ((arr[i] != arr[i - 1] + 1) && (arr[i] != arr[i - 1] - 1) && (arr[i] != arr[i - 1]))
{
ans = 0;
break;
}
else if ((arr[i] == arr[i - 1] + 1) || (arr[i] == arr[i - 1] - 1))
{
ans = min(u, v);
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a) for(int i = 0; i < (int) a; i++)
#define PB push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
void solve(){
ll n, u, v; cin >> n >> u >> v;
vi V(n); FOR(i, n) cin >> V[i];
ll ans = 2e9+7;
for(int i = 0; i < n-1; i++){
if(V[i] == V[i+1]){
ans = min({ans, 2*v, u+v});
}else if(abs(V[i]-V[i+1]) == 1){
ans = min({ans, u, v});
}else{
ans = 0;
}
}
cout << ans << '\n';
}
int main(){
ios::sync_with_stdio(false); cin.tie(0);
int t=1; cin >> t;
while(t--){
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int inf = 1e9;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int t;
cin >> t;
while (t--){
int n, u, v;
cin >> n >> u >> v;
int x[n];
bool yes = 0, can = 0;
for (int i = 0; i < n; i++){
cin >> x[i];
yes |= (i and x[i] != x[i - 1]);
can |= (i and abs(x[i]- x[i - 1]) > 1);
}
if (can) cout << 0 << '\n';
else if (yes) cout << min(u, v) << '\n';
else cout << min(u + v, 2 * v) << '\n';
}
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define ft first
#define sc second
#define mod 1000000007ll
#define all(c) c.begin(), c.end()
#define fast_io ios_base::sync_with_stdio(0), cin.tie(0)
int32_t main()
{
fast_io;
int tc = 1;
cin >> tc;
while (tc--)
{
int n, u, v;
cin >> n >> u >> v;
vi a(n);
for (auto &x : a)
cin >> x;
int min_cost = 4e9;
for (int i = 1; i < n; i++)
{
if (abs(a[i] - a[i - 1]) >= 2)
min_cost = 0;
else if (abs(a[i] - a[i - 1]) == 0)
min_cost = min({min_cost, v + min(u, v)});
else
min_cost = min({min_cost, min(u, v)});
}
cout << min_cost << '\n';
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int arr[110];
int main(){
int T; scanf("%d", &T);
while (T--){
int N, U, V; scanf("%d%d%d", &N, &U, &V);
for (int i = 1; i <= N; i++){
scanf("%d", &arr[i]);
}
bool zero = false;
bool col = true;
for (int i = 2; i <= N; i++){
if (abs(arr[i-1]-arr[i]) >= 2){
zero = true;
break;
}
if (abs(arr[i-1]-arr[i]) >= 1) col = false;
}
if (zero){
printf("0\n");
continue;
}
if (col) printf("%d\n", min(U, V)+V);
else printf("%d\n", min(U, V));
}
} |
#include<bits/stdc++.h>
using namespace std;
int tab[1000005];
void solve()
{
int a,b,c;
cin>>a>>b>>c;
int maks = 0;
for(int x=1;x<=a;x++)
cin>>tab[x];
for(int x=1;x<a;x++)
maks = max(maks, abs(tab[x+1] - tab[x]));
if(maks == 0)
{
cout<<c + min(c,b)<<'\n';
}
else if(maks == 1)
{
cout<<min(b,c)<<'\n';
}
else
cout<<0<<'\n';
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--)
solve();
return 0;
}
|
// minako
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define f first
#define s second
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define pll pair <ll,ll>
#define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll M = 1e9 + 7;
const int N = 2e5 + 5;
const ll INF = 1e9;
const ll INF2 = 1e18;
const int K = 750;
ll n,u,v,a[N],q;
int main() {
faster
cin >> q;
while (q--) {
cin >> n >> u >> v;
bool eq = 1,can = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != a[i - 1] && i > 1) eq = 0;
if (abs(a[i] - a[i - 1]) > 1 && i > 1) can = 1;
}
if (can) cout << 0 << endl;
else if (eq) cout << v + min(u,v) << endl;
else cout << min(u,v) << endl;;
}
return 0;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define ii pair<int, int>
#define vii vector<ii>
#define vvii vector<vii>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end())
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (ll) a / __gcd(a, b) * b
#define prt(v) \
for (auto &i : v) cout << i << " \n"[&i == &v.back()]
#define gmax(a, b) \
if (b > a) a = b
#define gmin(a, b) \
if (b < a) a = b
using namespace std;
void print();
template <typename T, typename... Args>
void print(T x, Args... args);
void solve() {
int n, u, v;
cin >> n >> u >> v;
int same = 1, can = 0;
for (int p = -1, x; n--;) {
cin >> x;
if (x != p && p != -1) same = 0;
if (abs(x - p) > 1 && p != -1) can = 1;
p = x;
}
if (can)
print(0);
else
print(same * v + min(u, v));
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int t = 1;
cin >> t;
for (int i = 0; i++ < t;) solve();
return 0;
}
void print() { cout << "\n"; }
template <typename T, typename... Args>
void print(T x, Args... args) {
if (sizeof...(args)) {
cout << x << ' ';
print(args...);
} else {
cout << x << '\n';
}
} |
#include <bits/stdc++.h>
using namespace std;
#define For(i,n) for(ll i = 0; i < n; i++)
#define For1(i,n) for(ll i = 1; i < n; i++)
#define Forn(i,n) for(ll i = n-1; i >=0 ; i--)
#define Forit(it,v) for(auto it = v.begin(); it != v.end(); it++)
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define sz size()
#define dbg(a) For(i,a.sz){cout<<a[i]<<' ';}cout<<'\n';
#define Sort(a) sort(a.rbegin(), a.rend());
#define Rev(a) reverse(a.begin(), a.end());
typedef long long int ll;
typedef pair<ll, ll> pl;
typedef pair<int,int> pi;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<pl> vpl;
typedef vector<vll> vvll;
ll t,n,m,p,k,X,s,u,v,idx,ct1,ct0;
//const ll N = 1e12;
void solve() {
cin>>n>>u>>v;
vi a(n,0);
bool case1 = false, case2 = false;
For(i,n){
cin>>a[i];
}
For(i,n){
if(i+1<n && abs(a[i+1]-a[i])>0){case1 = true;}
if(i-1>=0 && abs(a[i-1]-a[i])>0){case1 = true;}
if(i-1>=0 && abs(a[i-1]-a[i])>1){case2 = true;}
if(i+1<n && abs(a[i+1]-a[i])>1){case2 = true;}
}
if(case2){cout<<0<<'\n';}
else if(case1){
if(u>=v){cout<<v<<'\n';}
else{cout<<u<<'\n';}
}
else{cout<<min(u+v, 2*v)<<'\n';}
}
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
cin >> t;
while (t--) {
solve();
}
}
|
#include<cstdio>
#include<cstring>
#include<vector>
typedef long long ll;
int main()
{
int t,a[120];
scanf("%d",&t);
while(t--)
{
int n,u,v;
scanf("%d%d%d",&n,&u,&v);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
int j,b=0;
for(j=2;j<=n;j++)
{
if(a[j]==a[j-1]+1||a[j]==a[j-1]-1)
{b=1;}
if(a[j]>a[j-1]+1||a[j]<a[j-1]-1)
{
b=2;break;
}
}
if(b==0)
{
if(u<v)
printf("%d\n",u+v);
else
printf("%d\n",2*v);
}
else if(b==2)
{
printf("0\n");
}
else
{
if(u>v)printf("%d\n",v);
else printf("%d\n",u);
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define m 1000000007
ll int power(ll int x, ll int y, ll int p)
{
ll int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
res = (res*x) % p;
// y must be even now
y = y>>1; // y = y/2
x = (x*x) % p;
}
return res;
}
// Returns n^(-1) mod p
ll int modInverse(ll int n, ll int p)
{
return power(n, p-2, p);
}
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll t;
cin>>t;
while(t--)
{
ll n,u,v;
cin>>n>>u>>v;
ll i;
ll a[n];
for(i=0;i<n;i++)
cin>>a[i];
ll x,y,z;
x=0;y=0;z=0;
ll flag=1;
for(i=1;i<n;i++)
{
if(a[i]==a[i-1])
x=1;
else if(a[i]-a[i-1]==1)
y=1;
else if(a[i-1]-a[i]==1)
z=1;
else
break;
}
if(i==n)
{
if(x==1&&y==0&&z==0)
cout<<min(2*v,u+v)<<endl;
else if(y==1&&z==1&&x==0)
cout<<min(u,v)<<endl;
else if((u==1&&x==0)||(v==1&&x==0))
cout<<min(u,v)<<endl;
else
cout<<min(u,v)<<endl;
}
else
cout<<0<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin>>t;
while(t--)
{
ll n,u,v,i;
cin>>n>>u>>v;
ll arr[n],diff[n-1];
for(i=0;i<n;i++)
{cin>>arr[i];
}
for(i=0;i<n-1;i++)
{
diff[i]=(arr[i]-arr[i+1]);
}
bool flag=false,one=false,mone=false;
for(i=0;i<n-1;i++)
{
if(diff[i]<-1||diff[i]>1)
flag=true;
if(diff[i]==-1)
mone=true;
if(diff[i]==1)
one=true;
}
if(flag)
{
cout<<0<<endl;
continue;
}
ll ans=0;
if(mone==true||one==true)
{
ans+=min(u,v);
}
else {
ans+=v;
ans+=min(u,v);
}
cout<<ans<<endl;
}
}
|
/*NEVER GIVE UP*/
/*First try brute force and check if it is in the range of time complexity*/
/*Then try to solve the problem in mathematical form*/
/*Then try to imagine how the final ans will look like*/
/*Write on paper if still not able to get*/
/*Try to think diff. algorithms and data structures that could solve the problem*/
#include <bits/stdc++.h>
using namespace std;
int main()
{long long t=0,n=0,d=0,f=0,f1=0,v=0,h=0;
cin>>t;
for(long long i=0;i<t;i++)
{
cin>>n>>v>>h;
long long a[n];
for(long long j=0;j<n;j++)
cin>>a[j];
for(long long j=1;j<n;j++)
{
d=a[j]-a[j-1];
if(d<0)
d=-(d);
if(d>=2)
{
f=1;
break;
}
else if(d==1)
f1=1;
}
if(f==1)
cout<<0<<endl;
else
{
if(f1==1)
{
if(v<=h)
cout<<v<<endl;
else
cout<<h<<endl;
}
else
{
if((2*h)<=(v+h))
cout<<(2*h)<<endl;
else
cout<<v+h<<endl;
}
}
f=0;f1=0;d=0;
}
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, a[N], ans = INT_MAX, u, v, T;
int main()
{
ios::sync_with_stdio(false);
cin>>T;
while(T--){
ans = INT_MAX;
cin >> n >> u >> v;
cin>>a[0];
for(int i = 1; i < n; i++)
{
cin>>a[i];
if(abs(a[i] - a[i - 1]) >= 2) ans = 0;
if(abs(a[i] - a[i - 1]) == 1) ans = min(ans, min(u, v));
if(a[i] == a[i - 1]) ans = min(ans, v + min(u, v));
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
using namespace std;
const ll mod = 1000000007;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt" , "r" , stdin);
freopen("output.txt" , "w" , stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll tt;
cin >> tt;
while (tt--)
{
ll n, u, v, i, f = 0, g = 0;
cin >> n >> u >> v;
ll a[n];
for (i = 0; i < n; i++)cin >> a[i];
for (i = 1; i < n; i++) {
if (abs(a[i] - a[i - 1]) > 1) {g = 1; break;}
}
if (g) {
cout << 0 << endl; continue;
}
if (n > 2) {
for (i = 1; i < n - 1; i++) {
//cout << a[i] << endl;
if (a[i] != a[i - 1] || a[i] != a[i + 1]) {f = 1; break;}
}
}
else {
if (a[0] != a[1])f = 1;
}
if (f)cout << min(u, v) << endl;
else cout << v + min(u, v) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define ull unsigned long long
#define rep(i,a,n) for (long long i=a;i<=n;i++)
#define per(i,a,n) for (long long i=n;i>=a;i--)
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<ll,ll> PI;
const int mod=1e9+7;
const int MAXN=2e5+5;
typedef double db;
template <typename T> void chkmax(T &x,T y){x<y?x=y:T();}
template <typename T> void chkmin(T &x,T y){x>y?x=y:T();}
template <typename T> void read(T &x)
{
x=0;ll f=1;char c;
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-1;
for(;isdigit(c);c=getchar())x=x*10+c-'0';
x*=f;
}
map<ll,ll>mp1,mp2;
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
ll i,j,k,u,n,m,t,len,x1,x2,y,k1,z,v,a[MAXN],b[MAXN],tot=0,x,k2,minn,ans,flag,maxx,dp[MAXN];
vector<ll> G1,G2;
char s1[MAXN];
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);cout.tie(0);
read(t);
while (t--)
{
read(n);read(u);read(v);ans=1e18;
for (i=1;i<=n;i++) read(a[i]);
for (i=1;i<=n-1;i++)
{
if (a[i]==a[i+1]) ans=min(ans,min(2*v,u+v));
else if (abs(a[i]-a[i+1])==1) ans=min(ans,min(u,v));
else ans=0;
}
cout<<ans<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
const int maxn = 200;
const int maxn2 = 1e6 + 100;
int a[maxn];
int cnt[maxn2];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--){
int n,u,v;
cin >> n >> u >> v;
for (int i = 0; i < n; i++){
cin >> a[i];
}
int minANS = 8e9;
for (int i = 0 ; i < n; i++){
if (i == 0){
if (abs(a[1] - a[0]) == 0){
minANS = min(minANS,min(u + v, v + v));
}
else if (abs(a[1] - a[0]) == 1){
minANS = min(minANS,min(u,v));
}
else{
minANS = 0;
}
}
else if (i == n - 1){
if (abs(a[n - 1] - a[n - 2]) == 0){
minANS = min(minANS,min(u + v, v + v));
}
else if (abs(a[n - 1] - a[n - 2]) == 1){
minANS = min(minANS,min(u,v));
}
else{
minANS = 0;
}
}
else{
int x = abs(a[i] - a[i - 1]);
int y = abs(a[i] - a[i + 1]);
if (x == 0 && y == 0){
minANS = min(minANS,min(u + v, v + v));
}
else if (x > 1 || y > 1){
minANS = 0;
}
else{
minANS = min(minANS,min(u,v));
}
}
}
cout << minANS << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int T; cin >> T;
while(T--) {
int n, u, v; cin >> n >> u >> v;
vector<int> A(n + 1); for(int i = 1; i <= n; ++i) cin >> A[i];
int ans = -1;
for(int i = 1; i < n; ++i) {
if(abs(A[i] - A[i + 1]) > 1) {
ans = 0;
break;
}
}
if(ans == -1) {
bool straight = true;
for(int i = 1; i < n; ++i) {
if(A[i] != A[i + 1]) {
straight = false;
break;
}
}
if(straight) ans = min(2*v, u + v);
else ans = min(u, v);
}
cout << ans << '\n';
}
return 0;
}
|
#include<bits/stdc++.h>
#define int long long int
using namespace std;
const int M = 998244353;
const int mod = 1e9+7;
const int inf = 1e18;
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
int power(int x,int y,int p){
int res = 1;
x = x % p;
if(x == 0) return 0;
while (y > 0){
if (y & 1) res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
// Returns LCM of array elements
int flcm(int arr[], int n)
{
// Initialize result
int ans = arr[0];
// ans contains LCM of arr[0], ..arr[i]
// after i'th iteration,
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) /
(gcd(arr[i], ans)));
return ans;
}
void solve(){
int n, u, v;
cin>>n>>u>>v;
set<int>s;
int a[n], max1=0;
for(int i=0;i<n;i++){
cin>>a[i];
s.insert(a[i]);
}
for(int i=0;i<n-1;i++)
max1=max(max1, abs(a[i]-a[i+1]));
if(!max1) cout<<min(u+v, 2*v)<<"\n";
else if(max1==1) cout<<min(u,v)<<"\n";
else cout<<"0\n";
}
signed main(){
fast;
int t=1;
cin>>t;
while(t--) solve();
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <bitset>
using namespace std;
#define lowbit(x) x&-x
#define ll long long
#define dob double
#define For(i,s,n) for(ll i = s;i <= n;i++)
#define mem0(a) memset(a,0,sizeof a)
#define gcd(a,b) __gcd(a,b)
const int N = 1e5+50;
const double eps = 1e-6;
const ll mod = 2333;
const ll inf = 2e9+50;
void read(int &res){
char c;bool flag = true;
while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}
int a[N];
int main(){
ios::sync_with_stdio(false);
cout.tie(NULL);
int t;
cin>>t;
while(t--){
ll n,u,v;
cin>>n>>u>>v;
ll ans = inf;
memset(a,0,sizeof(a));
For(i,1,n) cin>>a[i];
For(i,2,n){
//cout<<a[i]<<' '<<a[i-1]<<endl;
if(a[i] == a[i-1]) ans = min(ans,v+min(u,v));
else if(a[i] == a[i-1]+1 || a[i] == a[i-1]-1) ans = min(ans,min(u,v));
else ans = 0;
}
cout<<ans<<endl;
}
return 0;
} |
//Codeforces Global Round 13 B
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int t; cin >> t;
while(t--) {
int n, u, v;
bool diff_two = false, diff_one = false;
cin >> n >> u >> v;
int arr[n];
cin >> arr[0];
for(int i=1; i<n; i++) {
cin >> arr[i];
if(abs(arr[i]-arr[i-1])>=2) diff_two = true;
else if(abs(arr[i]-arr[i-1]) == 1) diff_one = true;
}
if(diff_two) cout << 0 << endl;
else if(diff_one) cout << min(u, v) << endl;
else cout << min(u+v, v+v) << endl;
}
} |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <vector>
#define ls (node << 1)
#define rs ((node << 1) | 1)
typedef long long ll;
using namespace std;
int read()
{
int x=0,flag=1; char c=getchar();
while((c>'9' || c<'0') && c!='-') c=getchar();
if(c=='-') flag=0,c=getchar();
while(c<='9' && c>='0') {x=(x<<3)+(x<<1)+c-'0';c=getchar();}
return flag?x:-x;
}
const int MAX = 102;
int pic[MAX];
int main() {
int t = read();
while (t--) {
int n = read(), u = read(), v = read();
int flag = 1;
for (int i = 1; i <= n; i++) {
pic[i] = read();
if (i != 1) {
if (pic[i] != pic[i - 1] and flag == 1)
flag = 0;
if (abs(pic[i] - pic[i - 1]) > 1)
flag = -1;
}
}
if (flag == -1)
printf("0\n");
else if (flag == 0)
printf("%d\n", min(u, v));
else
printf("%d\n",min(v+v,v+u));
}
return 0;
} |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
cin>>t;
while(t--)
{
ll n,u,v,i,j,k=0;
cin>>n>>u>>v;
ll a[n];
cin>>a[0];
ll max=a[0],mi=a[0];
for(i=1;i<n;i++)
{
cin>>a[i];
if(a[i]<mi)
mi=a[i];
if(a[i]>max)
max=a[i];
}
for(i=1;i<n;i++)
{
if(abs(a[i]-a[i-1])>1)
{
cout<<0<<endl;
k=1;
break;
}
}
if(mi==max && k==0)
{
// cout<<u+v<<endl;
ll d=2*v;
ll e=2*u;
ll f=u+v;
cout<<min(d,f)<<endl;
}
else
{
if(k==0)
cout<<min(u,v)<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ll long long int
#define ull unsigned long long int
#define loop(i,a,b) for(ll i=(ll)a;i<=(ll)b;i++)
#define count_1(n) __builtin_popcountll(n)
#define pb push_back
#define eb emplace_back
#define ab(a) (a<0)?(-1*a):a
#define pc putchar
#define gc getchar
#define mset(a,b,c) loop(i,0,b) a[i]=c
#define F first
#define S second
#define mp make_pair
#define clr(x) x.clear()
#define MAX 1e9
#define MIN -1e9
#define itoc(c) ((char)(((int)'0')+c))
#define vi vector<int>
#define vvi vector<vi>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define all(p) p.begin(),p.end()
#define max(x,y) ((x>y)?x:y)
#define min(x,y) ((x<y)?x:y)
#define mid(s,e) (s+(e-s)/2)
const int MX = 10010896;
const int lmt = 3164;
const int N = 10000001;
const int MOD = 1000000007;
#define sv() long long int t; cin>>t; while(t--)
const int req=200000;
ll A[req+5],tree[4*req+5];
void build(ll node, ll start, ll end)
{
if(start == end)
{
tree[node] = A[start];
}
else
{
int mid = (start + end) / 2;
build(2*node, start, mid);
build(2*node+1, mid+1, end);
tree[node] = tree[2*node] + tree[2*node+1];
}
}
void update(ll node, ll start, ll end, ll idx, ll val)
{
if(start == end)
{
A[idx] += val;
tree[node] += val;
}
else
{
ll mid = (start + end) / 2;
if(start <= idx and idx <= mid)
{
update(2*node, start, mid, idx, val);
}
else
{
update(2*node+1, mid+1, end, idx, val);
}
tree[node] = tree[2*node] + tree[2*node+1];
}
}
int query(int node, int start, int end, int l, int r)
{
if(r < start or end < l)
{
return 0;
}
if(l <= start and end <= r)
{
return tree[node];
}
int mid = (start + end) / 2;
int p1 = query(2*node, start, mid, l, r);
int p2 = query(2*node+1, mid+1, end, l, r);
return (p1 + p2);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
sv()
{
ll i,j,k,n,u,v;
cin >>n >> u >> v;
ll arr[n+5];
for(i=1;i<=n;i++)
{
cin >> arr[i];
}
ll mini=u+v;
mini=min(mini,2*v);
for(i=2;i<=n;i++)
{
if(arr[i] < arr[i-1]-1)
{
mini=min(0,mini);
}
else if(arr[i]==arr[i-1]-1)
{
mini=min(u,mini);
mini=min(v,mini);
}
else if(arr[i]> arr[i-1]+1)
{
mini=min(0,mini);
}
else if(arr[i]==arr[i-1]+1)
{
mini=min(u,mini);
mini=min(v,mini);
}
}
cout << mini << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define mod 1000000007
#define pii pair<int,int>
#define vi vector<int>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define forn(i,s, e) for (int i = s; i <= e; i++)
#define fornd(i,s, e) for (int i = s ; i >= e; i--)
#define autoit(x,it) for(auto it = x.begin(); it != x.end(); it++)
#define print(x) for(auto el: x) cout<<el<<" ";cout<<"\n"
#define PSET(x,y) fixed<<setprecision(y)<<x
#define bits(x) __builtin_popcount(x)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
void fileio()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << std::endl;
//use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
// priority_queue<pair<int,pii>, vector<pair<int,pii>>, decltype(&compare)> g(compare)
#define N 5005
#define MOD 998244353
#define INF 1e18
void solve(){
int n, u, v;
cin>>n>>u>>v;
int flag = 0, ans = 0;
vector<int> arr(n+1, 0);
set<int> s;
forn(i, 1, n){
cin>>arr[i];
s.insert(arr[i]);
if(i != 1){
if(abs(arr[i]-arr[i-1]) >= 2){
flag = 1;
ans = 0;
}
}
}
if(flag){
cout<<ans<<"\n";
return;
}
if(s.size() == 1){
cout<<min(u+v, 2*v)<<"\n";
}else{
cout<<min(u,v)<<"\n";
}
}
int32_t main()
{
fileio();
fast;
int t = 1;
cin>>t;
for(int yy=1;yy<=t;yy++)
{
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void doCase() {
int n;
long long u, v;
cin >> n >> u >> v;
int last;
cin >> last;
int d = 0;
for (int i=1; i<n; i++) {
int cur;
cin >> cur;
d = max(d, abs(cur-last));
last = cur;
}
if (d == 0) {
cout << v + min(u,v) << endl;
} else if (d == 1) {
cout << min(u,v) << endl;
} else {
cout << 0 << endl;
}
}
int main() {
int t;
cin >> t;
for (int i=0; i<t; i++) doCase();
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <algorithm>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const double pi = acos(-1);
const int maxn = 2e4+10, maxm = 1e6+5, maxc = 26;
const char bs = 'a';
const LL mod = 1e9+7;
inline LL qpow(LL a, LL n, LL MOD) { LL ans = 1; while (n) { if (n & 1) ans = ans*a % MOD; a = a*a % MOD, n >>= 1; } return ans; }
int a[maxn];
int n, u, v;
int check() {
int ans = max(u + v, max(u*2, v*2));
for (int i = 2; i <= n; i++) {
if (a[i] == a[i - 1]) ans = min(ans, min(v*2, u + v));
else if (abs(a[i] - a[i - 1]) == 1) {
ans = min(u, v);
} else return 0;
}
return ans;
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d%d%d", &n, &u, &v);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
printf("%d\n", check());
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int solve()
{
int n,u,v,m=0,y,x;cin>>n>>u>>v>>x;
for(int i=1;i<n;i++){cin>>y;m=max(abs(y-x),m);x=y;}
if(m==0){cout<<min(u+v,2*v)<<"\n";return 0;}
if(m==1){cout<<min(u,v)<<"\n";return 0;}
cout<<"0\n";
return 0;
}
int main()
{
int t;cin>>t;
while(t--)solve();return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e2+10;
int s[N];
int check(int x, int u, int v) {
if(s[x] == s[x-1] && s[x] == s[x+1]) return min(2*v, u+v);
else return min(v, u);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t;
cin >> t;
while(t--) {
int n, u, v, f = 0;
cin >> n >> u >> v;
for(int i=1; i<=n; i++) {
cin >> s[i];
if(i > 1) {
if(s[i-1]!=s[i] && s[i-1]!=s[i]-1 && s[i-1]!=s[i]+1) f = 1;
}
}
if(f) cout << 0 << endl;
else {
int ans;
if(s[1] == s[2]+1) ans = min(u, v);
else if(s[2] == s[1]) ans = min(2*v, u+v);
else if(s[1] == 1 && s[2] == s[1]+1) ans = min(u+v, u);
else ans = min(u, v);
// cout << ans << endl;
for(int i=2; i<n; i++) {
ans = min(check(i, u, v), ans);
}
if(s[n] == s[n-1]) ans = min(ans, min(2*v, u+v));
else if(s[n] == 1000000 && s[n-1]+1 == s[n]) ans = min(ans, min(u+v, u));
else ans = min(ans, min(u, v));
cout << ans << endl;
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<b;i++)
#define frev(i,n,b) for(int i=n-1;i>=b;i--)
#define fi first
#define sec second
#define pb(x) push_back(x);
typedef vector<int> vi;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t; cin>>t;
while(t--){
int n,u,v; cin>>n>>u>>v;
int a[n];
f(i,0,n) cin>>a[i];
int ans(INT_MAX);
f(i,1,n){
if(abs(a[i]-a[i-1])>=2) ans=0;
if(abs(a[i]-a[i-1])==1) ans=min(ans,min(u,v));
if(a[i]==a[i-1]) ans=min(ans,v+min(u,v));
}
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define M 1000000007
#define mod 998244353
#define pll pair<ll, ll>
#define f first
#define se second
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define pb push_back
#define rb pop_back
#define prdb(x) cout << fixed << setprecision(10) << x;
#define speed1 ios_base ::sync_with_stdio(false);
#define speed2 cin.tie(NULL);
#define endl "\n"
/************
* fill the array with desired value
fill(all(vec), 1);
*fills the dsu parent array consecutively starting from desired value
iota(all(parent), 0);
* sort the vector and then make all elements unique
sort(all(vec));
vec.resize(unique(all(vec)) - vec.begin());
************/
int main()
{
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
speed1;
speed2;
ll t = 1;
cin >> t;
while (t--)
{
ll n, x, y;
cin >> n >> x >> y;
ll a[n];
ll i, j, k;
for (i = 0; i < n; i++)
cin >> a[i];
k = a[0];
for (i = 1; i < n; i++)
{
if (k != a[i])
break;
}
if (i == n)
{
cout << min(2 * y, x + y) << endl;
continue;
}
for (i = 1; i < n; i++)
{
if (abs(a[i] - a[i - 1]) > 1)
{
cout << 0 << endl;
break;
}
}
if (i == n)
cout << min(x, y) << endl;
}
} |
#include <iostream>
using namespace std;
#define N 101
int main() {
int t;
cin >> t;
for(int i = 0; i < t; ++i) {
int n;
long long u, v;
cin >> n >> u >> v;
int previous_pos = -1;
int new_pos = -1;
cin >> previous_pos;
int max_gap = 0;
for(int j = 1; j < n; ++j) {
cin >> new_pos;
max_gap = max(abs(new_pos - previous_pos), max_gap);
previous_pos = new_pos;
}
if(max_gap == 0) {
cout << (v + min(u, v)) << endl;
}
else if(max_gap == 1) {
cout << min(u, v) << endl;
}
else {
cout << 0 << endl;
}
}
} |
/**************CREATED BY BP**********/
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define read(x) cin>>int(x)
#define endl "\n"
#define loop(i,n) for(int i=0;i<n;i++)
#define MOD 1e9+7
#define scn(str) scanf("%s",str);
#define ptf(str) printf("%s\n",str);
#define readarr(ar,n) for(int i=0;i<n;i++)cin>>ar[i]
#define all(V) V.begin(),V.end()
#define fix fixed<<setprecision(15)
#define inf INT_MAX
#define fst first
#define snd second
#define PB push_back
#define MP make_pair
#define F(i,a,b) for(int i=a;i<=b;i++)
#define RF(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pi;
/*ITS ONLY COURAGE TO CONTINUE THAT COUNTS*/
/*I'M LOVING IT*/
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;cin>>t;
while(t--)
{
ll n,u,v;
cin>>n>>u>>v;
vl a(n);
readarr(a,n);
ll x = a[0];
int i,j,cnt=0;
vl b(n+1);
for(i=1;i<n;i++)
b[i] = abs(a[i]-a[i-1]);
ll mx = *max_element(all(b));
if(mx == 0)cout<<v+min(v,u);
else if(mx == 1)cout<<min(u,v);
else cout<<0;
cout<<"\n";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define inf 2000000000
#define infLL 2000000000000000000
#define MAX5 100005
#define MAX6 1000006
#define MAX7 10000007
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sfs(a) scanf("%s", a)
#define sline(a) scanf("%[^\n]%*c", a);
#define pf(a) printf("%d\n", a)
#define pfl(a) printf("%lld\n", a)
#define pfs(a) printf("%s\n", a)
#define Case(t) printf("Case %d: ", t)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mod 1000000007
#define Mod 998244353
#define PI acos(-1.0)
#define eps 1e-9
#define mem(a, b) memset(a, b, sizeof(a))
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = MAX5;
int main()
{
//#ifndef ONLINE_JUDGE
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
//#endif
FASTIO;
int T;
cin>>T;
while(T--) {
int n;
ll u, v;
cin>>n>>u>>v;
vector<int>a(n + 1);
for(int i = 1; i <= n; i++) cin>>a[i];
ll ans = infLL;
bool flag = false;
for(int i = 2; i <= n; i++) {
int d = abs(a[i - 1] - a[i]);
if(d >= 2) flag = true;
}
if(flag) ans = 0;
else {
flag = true;
for(int i = 2; i <= n; i++) {
if(a[i-1] != a[i]) flag = false;
}
if(flag) ans = min(v + u, v * 2LL);
else ans = min(u, v);
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll =long long;
void solve()
{
ll n,u,v;
cin>>n>>u>>v;
int arr[n+5];
bool tr=true,fr=true;
for(int i=1;i<=n;i++)
{
cin>>arr[i];
}
for(int i=2;i<=n;i++)
{
if(abs(arr[i]-arr[i-1])>=2)tr=false;
}
if(!tr)
{
cout<<0<<endl;
return ;
}
ll k= min(u+v,v+v);
for(int i=2;i<=n;i++)
{
if(abs(arr[i]-arr[i-1])==1)
{
k=min(u,v);
break;
}
}
cout<<k<<endl;
}
int main()
{
int q;cin>>q;while(q--)solve();
//solve();
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int t;
cin >> t;
while(t--) {
int n, u, v;
cin >> n >> u >> v;
vector<int> a(n);
for(int i = 0; i < n; ++i) cin >> a[i];
int mx = 0;
for(int i = 1; i < n; ++i) mx = max(mx, abs(a[i] - a[i-1]));
if(mx == 0) cout << v + min(u, v) << endl;
else if(mx == 1) cout << min(u, v) << endl;
else cout << 0 << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
int main()
{
ll n,u,v,i;
ll t;
cin>>t;
while(t--)
{
cin>>n>>u>>v;
vector< ll >vec(n);
ll diff=0,oned=0;;
for(i=0;i<n;i++)
{
cin>>vec[i];
}
for(i=1;i<n;i++)
{
if(vec[i]!=vec[i-1])
{
diff++;
}
if(abs(vec[i]-vec[i-1])>1)
{
oned++;
}
}
if(diff==0)
{
cout<<min(u+v,v+v);
}
else
{
if(oned!=0)
{
cout<<0;
}
else
{
cout<<min(u,v);
}
}
cout<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
const int N=120;
int a[N];
int n,u,v;
int solve() {
bool allsame = true;
for (int i = 1; i < n; i++) {
if (abs(a[i]-a[i-1]) > 1) return 0;
if (a[i] != a[i-1]) allsame = false;
}
if (allsame) return min(2*v,u+v);
return min(u,v);
}
int main() {
int q;
scanf("%d", &q);
while (q--) {
scanf("%d%d%d", &n, &u, &v);
for (int i = 0; i < n; i++) {
scanf("%d", a+i);
}
printf("%d\n", solve());
}
} |
// 2 months of future
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long int
#define pb push_back
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
cin >> t;
while (t--) {
ll n, u, v;
cin >> n >> u >> v;
ll temp, ans = 1e18 + 1;
vector <ll> ve;
for (int i = 0; i < n; i++) {
cin >> temp;
ve.pb(temp);
}
for (ll i = 1; i < n; i++) {
if (abs(ve[i] - ve[i - 1]) == 0) {
ans = min(ans, v + min(u, v));
}
else if (abs(ve[i] - ve[i - 1]) > 1) {
ans = 0;
}
else {
ans = min(ans, min(u, v));
}
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int min(int a,int b){
if(a<b)
return a;
else
return b;
}
int main()
{
int t,n;
vector <int> a;
int u,v;
int cost,diff,maxdiff;
cin>>t;
while(t--){
cin>>n>>u>>v;
for(int i=0;i<n;i++){
cin>>cost;
a.push_back(cost);
}
cost=0;
maxdiff=0;
for(int i=0;i<n-1;i++){
diff=a[i+1]-a[i];
if(diff<0)
diff=-1*diff;
if(diff>maxdiff)
maxdiff=diff;
if(maxdiff>1)
break;
}
if(maxdiff>1)
cout<<"0"<<endl;
if(maxdiff==1)
cout<<min(u,v)<<endl;
if(maxdiff==0)
cout<<min(u+v,2*v)<<endl;
a.clear();
}
return 0;
}
|
//R<3S
#include <bits/stdc++.h>
#define hell 1000000007
#define PI 3.14159265358979323844
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define vecmax(v) max_element(all(v))
#define vecmin(v) min_element(all(v))
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) m*(n/GCD(m,n))
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define repD(i, a, n) for(int i = a; i >= (n); --i)
#define trav(x) for(auto i : x)
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define int long long
#define ld long double
#define pii std::pair<int, int>
#define pll std::pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi >
#define vii vector<pii >
#define mii map<int,int>
#define mll map<ll,ll>
using namespace std;
void solve()
{
int n,u,v;
cin>>n>>u>>v;
int a[n];
rep(i,n)cin>>a[i];
int maxm=0;
rep(i,n)
{
if(i==n-1)break;
int j=i+1;
maxm=max(maxm,abs(a[i]-a[j]));
}
if(maxm>=2)cout<<0<<endl;
else if(maxm==1)cout<<min(u,v)<<endl;
else cout<<min(v+v,u+v)<<endl;
}
signed main()
{
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
t=1;
cin>>t;
while(t--)
{
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1e6 + 7;
int num[MAX];
signed main()
{
int T;
cin >> T;
while (T--)
{
int N, u, v;
cin >> N >> u >> v;
for (int i = 1; i <= N; i++)
{
cin >> num[i];
}
int canget = 0;
int flag = 0;
for (int i = 1; i < N; i++)
{
if (abs(num[i] - num[i + 1]) > 1)
{
canget = 1;
cout << 0 << '\n';
flag = 1;
break;
}
}
if (flag == 1)
{
continue;
}
if (canget)
{
continue;
}
int ban = 0;
for (int i = 1; i < N; i++)
{
if (num[i] != num[i + 1])
{
ban = 1;
}
}
if (ban)
{
cout << min(u, v) << '\n';
}
else
{
cout << min(u + v, v * 2) << '\n';
}
}
return 0;
} |
#include <bits/stdc++.h>
typedef long long int ll;
const unsigned int MOD = 1000000007;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin >> t;
for (int tt = 0; tt < t; tt++)
{
int n;
cin>>n;
int u,v;
cin>>u>>v;
int a[n];
cin>>a[0];
int td=0;
int oned=0;
for (int i = 1; i < n; i++)
{
cin>>a[i];
if(abs(a[i]-a[i-1])>=2)
{
td=1;
}
else if (abs(a[i] - a[i - 1]) == 1)
{
oned = 1;
}
}
int ans=0;
if (td==1)
{
cout<<0<<"\n";
continue;
}
if(oned==1)
{
cout<<min(u,v)<<"\n";
continue;
}
cout<<min(u+v,v+v)<<"\n";
}
#ifndef ONLINE_JUDGE
cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";
#endif
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int q; cin >> q;
while(q--){
int n; cin >> n;
ll u,v; cin >> u >> v;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
ll res=1e18;
for(int i=0;i+1<n;i++){
if(abs(a[i]-a[i+1])>1)res=0;
else if(abs(a[i]-a[i+1])==1){
res=min(res,min(u,v));
}
else{
res=min(res,v+min(u,v));
}
}
printf("%lld\n",res);
}
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t; cin >> t;
for (int l = 0; l < t; l++)
{
int n, u, v;
cin >> n >> u >> v;
int prev; cin >> prev;
int actl;
int main_case = 3;
for (int i = 1; i < n; i++)
{
int tmp_case = 3;
cin >> actl;
if (abs(actl - prev) == 0) tmp_case = 3;
if (abs(actl - prev) == 1) tmp_case = 2;
if (abs(actl - prev) > 1) tmp_case = 1;
main_case = min(main_case, tmp_case);
prev = actl;
}
if (main_case == 3)
cout << min(2 * v, v + u) << endl;
if (main_case == 2)
cout << min(u, v) << endl;
if (main_case == 1)
cout << 0 << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std ;
#define Next( i, x ) for( register int i = head[x]; i; i = e[i].next )
#define rep( i, s, t ) for( register int i = (s); i <= (t); ++ i )
#define drep( i, s, t ) for( register int i = (t); i >= (s); -- i )
#define re register
#define mp make_pair
#define pi pair<int, int>
#define pb push_back
#define vi vector<int>
#define int long long
int gi() {
char cc = getchar() ; int cn = 0, flus = 1 ;
while( cc < '0' || cc > '9' ) { if( cc == '-' ) flus = - flus ; cc = getchar() ; }
while( cc >= '0' && cc <= '9' ) cn = cn * 10 + cc - '0', cc = getchar() ;
return cn * flus ;
}
const int inf = 1e9 + 7 ;
const int N = 2e5 + 5 ;
int T, n, a, b, c[N] ;
int abc(int x) { return max(x, -x) ; }
signed main()
{
T = gi() ;
while(T--) {
n = gi(), a = gi(), b = gi() ;
int ANS = inf, flag = 1 ;
rep( i, 1, n ) c[i] = gi() ;
rep( i, 2, n ) if( c[i] != c[1] ) flag = 0 ;
if(flag) ANS = min(a + b, 2 * b) ;
else {
rep( i, 2, n ) {
int z = c[i] - c[i - 1] ;
if(abc(z) <= 1) ANS = min(min(ANS, b), a) ;
else ANS = 0 ;
}
}
cout << ANS << endl ;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define F first
#define S second
#define all(x) x.begin(), x.end()
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int mod = 1000000007;
//------------------------------------------------------------
void solve(){
ll n, u, v;
cin >> n >> u >> v;
int A[n];
for (auto &it : A){
cin >> it;
}
ll ans = INT_MAX;
for (int i=1; i<n; ++i){
if (abs(A[i-1] - A[i]) == 0) ans = min({ans, 2*v, u+v});
else if (abs(A[i-1] - A[i]) > 1){
ans = 0;
break;
}
else ans = min({ans, u, v});
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1;
cin >> t;
while (t--){
solve();
}
}
// ------------------------------------------------------------ |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin >> T;
while (T--) {
int n, u, v;
cin >> n >> u >> v;
int lst;
cin >> lst;
int stat = 0;
for (int i = 2, t; i <= n; i++) {
cin >> t;
if (abs(t - lst) >= 2) stat = 2;
else if (abs(t - lst) == 1) stat = max(stat, 1);
lst = t;
}
if (stat == 2) cout << 0 << "\n";
else if (stat == 1) cout << min(u, v) << "\n";
else cout << v + min(u, v) << "\n";
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define mod 1000000009
#define pi 3.141592653589793238
// cout<<fixed<<<<setprecision(9)<<ans<<endl;
// lower_bound(start_ptr, end_ptr, num)
// upper_bound(start_ptr, end_ptr, num)
int ceil(int a, int b) {
if (a % b == 0)return a / b;
else {
return a / b + 1;
}
}
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
int n, u, v;
cin >> n >> u >> v;
int a[n];
rep(i, n) {
int ele;
cin >> ele;
ele--;
a[i] = ele;
}
int max_diff = INT_MIN;
for (int i = 1; i < n; i++) {
max_diff = max(abs(a[i] - a[i - 1]), max_diff);
}
int ans = 0;
if (max_diff == 0) {
if (u < v) {
ans = v + u;
}
else {
ans = 2 * v;
}
}
else if (max_diff == 1) {
ans += min(u, v);
}
cout << ans << endl;
}
cin.clear();
cin.get();
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
using namespace std;
#define ll long long
#define pb(x) push_back(x)
#ifdef _OLIMPOLOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 1337
#endif
void debug_out() { cout << "\n";}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) { cout << " " << A; debug_out(B...); }
int test = 1;
#define out(x) {cout << x << "\n";return;}
#define all(N) N.begin(),N.end()
#define allr(N) N.rbegin(),N.rend()
template<typename T1>
void pr(vector<T1> V, int add = 0, int start = -1, int end = -1) {
if (start < 0) start = 0;
if (end < 0) end = V.size() - 1;
for (int i = start; i <= end; i++) {
cout << V[i] + add << ((i == end) ? "\n" : " ");
}
}
template<typename T1>
T1 chmin(T1 &x, const T1 v) { return x = min(x,v); }
template<typename T1>
T1 chmax(T1 &x, const T1 v) { return x = max(x,v); }
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define repsr(i, s, n) for (int i = n-1; i >= s; i--)
#define PI pair<int,int>
template<typename T1>
T1 gcd(const T1 &a, const T1 &b) {
if (a == 0 || b == 0) return a + b;
return gcd(b, a %b);
}
//-------------------------- ^ DONT TOUCH ^-----------------------------------------------------------------
#define MAX 100001
#define MOD 1000000007ll
ll f[MAX];
ll n, s;
long long power(long long x, long long n) {
long long p = x;
long long s = 1;
while (n > 0) {
if (n & 1) s = (s * p) % MOD;
p = (p * p) % MOD;
n /= 2;
}
return s;
}
ll val(vector<ll> V) {
sort(all(V));
ll a = f[V.size()];
for(int i = 0 ; i < V.size(); i++) {
int c = 1;
while(i + 1 < V.size() && V[i+1] == V[i]) {
c++;
i++;
}
if (c > 1) a *= power(f[c], MOD-2);
a %= MOD;
}
return a;
}
void solve() {
cin >> n;
vector<ll> N(n);
s = 0;
rep(i,n) {
cin >> N[i];
s += N[i];
}
if (s % n != 0) out(0);
s/=n;
vector<ll> L, H;
int c = 0;
ll a = 1;
rep(i,n) {
N[i] -= s;
if (N[i] > 0) {
H.push_back(N[i]);
}
if (N[i] < 0) {
L.push_back(-N[i]);
}
if (N[i] == 0) {
a *= n;
a %= MOD;
c++;
}
}
a = f[n];
a *= power(f[c], MOD-2);
a %= MOD;
a *= power(f[n-c], MOD-2);
a %= MOD;
n-=c;
ll l = val(L);
ll h = val(H);
int sl = L.size();
int sh = H.size();
ll s = 0;
ll r = (l * h) % MOD;
if(sl + sh == 0)out(a);
if (sl == 1 || sh == 1) {
out(val(N));
}
s = (2*r) % MOD;
s = ((s % MOD) + MOD) % MOD;
debug(l,h);
out((a * s) % MOD);
}
int main() {
f[0] = 1;
reps(i,1,MAX) f[i] = (f[i-1] * (ll)i) % MOD;
ios_base::sync_with_stdio(0);cin.tie(0);
//cin >> test;
rep(testCase, test) {
#ifdef _OLIMPOLOCAL
cout << "Case #" << testCase + 1 << "\n";
#endif
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
const int MOD = 1e9 + 7;//XXX
const int C = 26;//XXX
void add(int &x, int y){
x += y;
while (x >= MOD) x -= MOD;
while (x < 0) x += MOD;
}
int fix(int x){
while (x >= MOD) x -= MOD;
while (x < 0) x += MOD;
return x;
}
int pw(int a, int b){
int ret = 1;
while (b){
if (b & 1)
ret = 1ll*ret*a%MOD;
b >>= 1;
a = 1ll*a*a%MOD;
}
return ret;
}
int mul(int a, int b) {
return (ll) a * b % MOD;
}
const int MAXN = 1e5 + 10;
int fact[MAXN], finv[MAXN];
int a[MAXN];
int binom(int n, int k) {
if (k > n)
return 0;
return mul(fact[n], mul(finv[k], finv[n-k]));
}
void solve() {
fact[0] = 1;
for (int i = 1; i < MAXN; i++)
fact[i] = mul(i, fact[i-1]);
finv[MAXN-1] = pw(fact[MAXN-1], MOD-2);
for (int i = MAXN-2; ~i; --i)
finv[i] = mul(i+1, finv[i+1]);
int n; cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
ll s = 0;
for (int i = 0; i < n; i++)
s += a[i];
if (s % n) {
cout << "0\n";
return;
}
s /= n;
map<int,int> mp;
int sources = 0, sinks = 0, dont_care = 0;
for (int i = 0; i < n; i++) {
if (a[i] > s)
++sources;
if (a[i] < s)
++sinks;
if (a[i] == s)
++dont_care;
++mp[a[i]];
}
if (sources == 1 || sinks == 1) {
cerr << " ONE end\n";
int ans = fact[n];
for (auto [k, v] : mp)
ans = mul(ans, finv[v]);
cout << ans << "\n";
return;
}
cerr << " BOTH\n";
int ans = mul((int) mp.size() > 1 ? 2 : 1, binom(n, dont_care));
ans = mul(ans, fact[sources]);
ans = mul(ans, fact[sinks]);
//cerr << ans << "\n";
for (auto [k, v] : mp)
if (k != s)
ans = mul(ans, finv[v]);
cout << ans << "\n";
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//cout << fixed << setprecision(6);
int te = 1;
//cin >> te;
for (int w = 1; w <= te; w++){
//cout << "Case #" << w << ": ";
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#define pb push_back
#define eb emplace_back
#define ll long long
#define ld long double
#define vll vector<ll>
#define infl LONG_LONG_MAX
#define infd LDBL_MAX
#define F first
#define S second
#define pll pair<ll,ll>
#define G(a,b) get<a>(b)
#define ALL(v) v.begin(),v.end()
#define MP make_pair
#define MT make_tuple
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fi(i,a,b) for(ll i=(b-1);i>=a;i--)
#define endl "\n"
#define nl cout<<"\n";
#define pr(x) cout<<x;
#define pr1(x) cout<<x<<" ";
#define pr2(x,y) cout<<x<<" "<<y;
#define sz(x) (ll)x.size()
#define ara cout<<"ara-ara\n";
const ld PI=3.1415926535897932384626433;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 <<"\n";
//use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
const ll N=1e5+5,p=1e9+7;
ll n,a[N],fac[N],faci[N];
ll pow_mod_p(ll a,ll b)
{
a=a%p;
ll res=1;
while(b>0)
{
if(b&1) res=(res*a)%p;
b=b>>1;
a=(a*a)%p;
}
return res;
}
inline ll mod_inv(ll x)
{
return pow_mod_p(x,p-2);
}
ll Get(vll &v)
{
ll cnt=sz(v);
vector<pll>vec;
vec.eb(v[0],1);
f(i,1,sz(v))
{
ll val=v[i];
if(val==vec.back().F) vec.back().S++;
else vec.eb(v[i],1);
}
ll res=fac[cnt];
ll den=1;
for(auto i : vec) den=(den*faci[i.S])%p;
res=(res*den)%p;
return res;
}
ll nCr(ll x,ll y)
{
if(x<y) return 0;
if(x==y) return 1;
ll res=fac[x];
ll deni=(faci[y]*faci[x-y])%p;
res=(res*deni)%p;
return res;
}
void func()
{
cin>>n;
ll sm=0;
f(i,1,n+1)
{
cin>>a[i];
sm+=a[i];
}
if(sm%n!=0)
{
cout<<"0\n";
return;
}
fac[0]=fac[1]=1;
f(i,2,n+1) fac[i]=(fac[i-1]*i)%p;
f(i,0,n+1) faci[i]=mod_inv(fac[i]);
ll d=sm/n;
vll v1,v2;
f(i,1,n+1)
{
if(a[i]<d) v1.pb(d-a[i]);
else if(a[i]>d) v2.pb(a[i]-d);
}
vector<pll>vec;
sort(a+1,a+n+1);
vec.eb(a[1],1);
f(i,2,n+1)
{
if(a[i]==vec.back().F) vec.back().S++;
else vec.eb(a[i],1);
}
ll den=1;
for(auto i : vec) den=(den*faci[i.S])%p;
ll tt=(fac[n]*den)%p;
if(v1.empty() && v2.empty())
{
cout<<tt<<"\n";
return;
}
sort(ALL(v1));
sort(ALL(v2));
if(sz(v1)==1 || sz(v2)==1)
{
cout<<tt<<"\n";
return;
}
/*if(v1[0]!=v1.back() || v2[0]!=v2.back())
{
cout<<"0\n";
return;
}
cout<<"2\n";*/
ll ans=(Get(v1)*Get(v2))%p;
ans=(ans*2)%p;
ans=(ans*nCr(n,n-sz(v1)-sz(v2)))%p;
cout<<ans<<"\n";
}
int main()
{
fast
//#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//#endif // ONLINE_JUDGE
ll ntc=1;
//cin>>ntc;
f(i,1,ntc+1)
{
func();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int read();
#define LL long long
#define fr(i,l,r) for(int i = (l);i <= (r);++i)
#define rf(i,l,r) for(int i = (l);i >= (r);--i)
#define fo(i,l,r) for(int i = (l);i < (r);++i)
#define foredge(i,u,v) for(int i = fir[u],v;v = to[i],i;i = nxt[i])
#define ci const int &
#define cl const LL &
#define I inline void
#define filein(File) freopen(File".in","r",stdin)
#define fileout(File) freopen(File".out","w",stdout)
const int N = 1e5 + 5,MOD = 1e9 + 7;
int n,a[N];
LL ifac[N],fac[N];
inline LL qpow(LL a,int x) {
LL res = 1;
for(;x;x >>= 1) (x & 1) && (res = res * a % MOD),a = a * a % MOD;
return res;
}
inline LL C(int n,int m) {
return fac[n] * ifac[m] % MOD * ifac[n-m] % MOD;
}
map<int,int> mp;
int main() {
LL sum = 0;
scanf("%d",&n);
fr(i,1,n) scanf("%d",a+i),sum += a[i];
if(sum % n) cout << 0 << endl;
else {
sum /= n;
fac[0] = 1;
fr(i,1,n) fac[i] = fac[i-1] * i % MOD;
ifac[n] = qpow(fac[n],MOD-2);
rf(i,n-1,0) ifac[i] = ifac[i+1] * (i+1) % MOD;
int cnt1 = 0,cnt2 = 0,cnt3 = 0;
LL res = 1,ans = 0;
fr(i,1,n) {
if(a[i] == sum) ++cnt3;
else if(a[i] < sum) ++cnt1;
else ++cnt2;
res = res * fac[mp[a[i]]] % MOD;
++mp[a[i]];
res = res * ifac[mp[a[i]]] % MOD;
}
if(cnt3 == n) ans = 1;
else if(cnt1 == 1 || cnt2 == 1)
ans = (cnt1 + cnt2) * fac[cnt2] * fac[cnt1] % MOD;
else ans = fac[cnt1] * fac[cnt2] % MOD * 2 % MOD;
ans = ans * C(n,cnt3) % MOD * fac[cnt3] % MOD * res % MOD;
printf("%lld\n",ans);
}
return 0;
}
const int S = 1 << 21;
char p0[S],*p1,*p2;
#define getchar() (p2 == p1 && (p2 = (p1 = p0) + fread(p0,1,S,stdin)) == p1 ? EOF : *p1++)
inline int read() {
static int x,c,f;x = 0;f = 1;
do c = getchar(),c == '-' && (f = -1);while(!isdigit(c));
do x = x * 10 + (c & 15),c = getchar();while(isdigit(c));
return x * f;
}
|
//Copied model soln
#include "bits/stdc++.h"
#define ll long long
#define MOD 1000000007
ll power(ll x,ll y, ll md=MOD){ll res = 1;x%=md;while(y){if(y&1)res = (res*x)%md;x *= x; if(x>=md) x %= md; y >>= 1;}return res;}
using namespace std;
#define int long long
#define MAX 100005
vector<int> f(MAX);
vector<int> inv(MAX);
void init() {
f[0] = 1;
for(int i=1;i<MAX;i++) f[i] = (f[i-1]*i)%MOD;
inv[MAX-1] = power(f[MAX-1], MOD-2, MOD);
for(int i=MAX-2;i>=0;i--) inv[i] = (inv[i+1]*(i+1)) % MOD;
for(int i=0;i<MAX;i++) assert(inv[i]==power(f[i],MOD-2,MOD));
}
int ncr(int n, int r) {
if(r > n || r < 0) return 0;
int ans = f[n];
ans *= (inv[r] * inv[n - r]) % MOD;
ans %= MOD;
return ans;
}
int solve(const vector<int> &v) {
int n = v.size();
int s = 0;
for(auto x: v) s += x;
if(!(s % n == 0)) return 0;
int src = 0;
int snk = 0;
map<int,int> freqSrc, freqSnk;
for(auto x: v) {
if(s / n < x) {
freqSrc[x]++;
src ++;
}
if(s / n > x) {
freqSnk[x]++;
snk ++;
}
}
if(src == 0 && snk == 0) return 1;
if(src == 1 || snk == 1) {
int ans = f[n];
for(auto x: freqSnk) {
ans = (ans * inv[x.second]) % MOD;
}
for(auto x: freqSrc) {
ans = (ans * inv[x.second]) % MOD;
}
ans *= inv[n - src - snk];
ans %= MOD;
return ans;
}
int ans = (2 * f[src] * f[snk]) % MOD;
// Divide by freq of repeating elements
for(auto x: freqSnk) {
ans = (ans * inv[x.second]) % MOD;
}
for(auto x: freqSrc) {
ans = (ans * inv[x.second]) % MOD;
}
int tot = src + snk;
int left = n - tot;
// Number of Solution: x_0 + x_1 + x_2 + ... + x_tot = left
ans = (ans * ncr(left + tot, tot)) % MOD;
return ans;
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
init();
int n;
cin>>n;
vector<int> v(n);
for(auto &x: v) cin>>x;
cout<<solve(v);
} |
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstring>
#define ios ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define bug(str, x) cerr << "# " << str << " : " << x << '\n'
#define here(x) cerr << "here " << x << '\n'
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 1e9;
int fact[maxn], invfact[maxn];
int a[maxn];
map<int, int> cnt;
int mul(int a, int b){
return 1ll * a * b % mod;
}
int pwr(int a, int b){
int res = 1;
for(; b; b >>= 1){
if(b & 1){
res = mul(res, a);
}
a = mul(a, a);
}
return res;
}
int inv(int a){
return pwr(a, mod - 2);
}
int C(int a, int b){
int res = fact[b];
res = mul(res, invfact[a]);
res = mul(res, invfact[b - a]);
return res;
}
int main(){
ios;
int n;
cin >> n;
fact[0] = 1;
for(int i = 1; i <= n; i ++){
fact[i] = mul(fact[i - 1], i);
}
for(int i = 0; i <= n; i ++){
invfact[i] = inv(fact[i]);
}
ll sum = 0;
for(int i = 0; i < n; i ++){
cin >> a[i];
sum += a[i];
cnt[a[i]] ++;
}
if(sum % n){
return cout << 0, 0;
}
int mid = sum / n;
int src_cnt = 0, sink_cnt = 0;
int res1 = 1, res2 = 1;
for(auto u : cnt){
if(u.first > mid){
src_cnt += u.second;
res1 = mul(res1, invfact[u.second]);
}
else if(u.first < mid){
sink_cnt += u.second;
res2 = mul(res2, invfact[u.second]);
}
}
if(!src_cnt && !sink_cnt){
return cout << 1, 0;
}
int ans = 1;
if(src_cnt == 1){
ans = fact[n];
ans = mul(ans, res2);
ans = mul(ans, invfact[n - (src_cnt + sink_cnt)]);
}
else if(sink_cnt == 1){
ans = fact[n];
ans = mul(ans, res1);
ans = mul(ans, invfact[n - (src_cnt + sink_cnt)]);
}
else{
res1 = mul(res1, fact[src_cnt]);
res2 = mul(res2, fact[sink_cnt]);
ans = mul(res1, res2);
ans = mul(ans, 2);
ans = mul(ans, C(src_cnt + sink_cnt, n));
}
cout << ans << '\n';
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<vector>
#include<sstream>
#include<algorithm>
#include<bitset>
#include<stack>
#include<map>
#include<set>
#include<ctime>
#include<cstdlib>
#define rep(i,n) for(int i=0;(i)<(n);i++)
#define rep1(i,n) for(int i=1;(i)<=(n);i++)
#define mst(a,b) memset(a,b,sizeof(a))
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define dbg(a) cout<<"* "<< #a <<" : "<<a<<endl
#define fr first
#define se second
#define ls x<<1
#define rs x<<1|1
#define ll long long
#define LL long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define lowbit(x) x&(-x)
#define ac cout<<ans<<endl
using namespace std;
const double pi=acos(-1.0);
const double eps=1e-7;
const ull hashp=131;
const ll INF=0x3f3f3f3f3f3f3f3fll;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const int maxn=2e5+100;
int jc[maxn]={1},inv[maxn],arr[maxn];
int qpow(int a,int b){
int ret=1;
while(b){
if(b&1)ret=1ll*ret*a%mod;
b>>=1;
a=1ll*a*a%mod;
}
return ret;
}
void init(){
rep1(i,maxn-99)jc[i]=1ll*jc[i-1]*i%mod;
inv[maxn-99]=qpow(jc[maxn-99],mod-2);
for(int i=maxn-100;~i;i--)
inv[i]=1ll*inv[i+1]*(i+1)%mod;
//dbg(inv[0]);
}
int c(int n,int m){
return 1ll*jc[n]*inv[m]%mod*inv[n-m]%mod;
}
map<int,int>mp;
void solve(){
int _=1;//scd(_);
init();
for(;_--;){
int n;scd(n);
ll sum=0;
rep1(i,n){
scd(arr[i]);
sum+=1ll*arr[i];
mp[arr[i]]++;
}
if(sum%n){
puts("0");
continue;
}
sum/=n;
int l=0,r=0,m=0;
rep1(i,n){
if(arr[i]>sum)r++;
else if(arr[i]==sum)m++;
else l++;
}
int inv_p=1;
for(auto now:mp)
inv_p=1ll*inv_p*qpow(jc[now.se],mod-2)%mod;
int ext=1ll*jc[n]*inv[l+r]%mod;
int ans=1ll*(1+(l&&r))*jc[l]*jc[r]%mod*ext%mod*inv_p%mod;
if(l>=2&&r==1)rep1(i,l-1)ans=(ans+1ll*jc[i]*jc[l-i]%mod*c(l,i)%mod*jc[r]%mod*ext%mod*inv_p%mod)%mod;
if(r>=2&&l==1)rep1(i,r-1)ans=(ans+1ll*jc[i]*jc[r-i]%mod*c(r,i)%mod*jc[l]%mod*ext%mod*inv_p%mod)%mod;ac;
}
}
int main(){
//IOS;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; ;;
;; ;; ;;;;;;;;; ;; ;;
;; ;; ;; ;; ;; ;;
;; ;; ;; ;; ;; ;;
;; ;;;;;;;;; ;; ;; ;;
;; ;; ;; ;; ;;
;; ;; ;; ;;;;;;;;; ;; ;;
;; ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = (1e5 + 20), INF = 0x3f3f3f3f3f3f3f3f, mod = 1e9 + 7;
int a[N];
map<int, int> mp;
vector<int> source, sink;
int ksm(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
int fac[N], inv[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
fac[0] = 1;
for (int i = 1; i < N; i++) fac[i] = fac[i - 1] * i % mod;
inv[N - 1] = ksm(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % n) {
cout << 0 << "\n";
} else {
int x = sum / n;
int cntsou = 0, cntsink = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > x) {
cntsou++;
if (!mp[a[i]]) source.push_back(a[i]);
} else if (a[i] < x) {
cntsink++;
if (!mp[a[i]]) sink.push_back(a[i]);
}
++mp[a[i]];
}
if (cntsou <= 1 || cntsink <= 1) {
int ans = fac[n];
for (auto x : mp) {
ans = ans * inv[x.second] % mod;
}
cout << ans << "\n";
} else {
int res1 = fac[cntsou];
for (auto x : source) res1 = res1 * inv[mp[x]] % mod;
int res2 = fac[cntsink];
for (auto x : sink) res2 = res2 * inv[mp[x]] % mod;
int res3 = fac[n] % mod * inv[cntsink + cntsou] % mod *
inv[n - cntsink - cntsou] % mod;
int ans = res1 * res2 % mod * res3 % mod * 2 % mod;
cout << ans << "\n";
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void canhazfast() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
while (b) {
T q = a/b; a %= b; swap(a, b);
x0 -= q*x1; swap(x0, x1);
y0 -= q*y1; swap(y0, y1);
}
x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}
#define MOD 1000000007
uint add(uint a, uint b) { return a+b < MOD ? a+b : a+b-MOD; }
uint sub(uint a, uint b) { return a < b ? a+MOD-b : a-b; }
uint mul(uint a, uint b) { return (ull)a*b%MOD; }
uint sqr(uint a) { return mul(a, a); }
uint modpow(uint b, uint e)
{
uint r = 1;
for (; e; e >>= 1) {
if (e&1) r = mul(r, b);
b = sqr(b);
}
return r;
}
uint modpowll(uint b, ull e)
{
uint r = 1;
for (; e; e >>= 1) {
if (e&1) r = mul(r, b);
b = sqr(b);
}
return r;
}
uint modinv(uint n) { return modpow(n, MOD-2); }
uint moddiv(uint n, uint d) { return mul(n, modinv(d)); }
#define N 100016
int a[N];
uint fac[N];
uint binom(int n, int k)
{
return moddiv(fac[n], mul(fac[k], fac[n-k]));
}
uint multinom(const vi &f)
{
int n = 0;
uint res = 1;
for (int k : f) {
n += k;
res = mul(res, fac[k]);
}
return moddiv(fac[n], res);
}
int main()
{
canhazfast();
int n, avg, kz = 0, kmi = 0, kpl = 0;
ll s = 0;
vi fmi, fpl;
uint ans;
cin >> n;
fac[0] = fac[1] = 1;
for (int i = 2; i <= n; ++i) fac[i] = mul(fac[i-1], i);
for (int i = 0; i < n; ++i) {
cin >> a[i];
s += a[i];
}
retif(s%n) cout << "0\n", 0;
avg = s/n;
sort(a, a+n);
for (int i = 0, j = 0; i < n; i = j) {
while (j < n && a[j] == a[i]) ++j;
int k = j-i;
if (a[i] < avg) fmi.pb(k), kmi += k;
else if (a[i] > avg) fpl.pb(k), kpl += k;
else kz = k;
}
if (kmi <= 1 || kpl <= 1) {
for (int k : fmi) fpl.pb(k);
fpl.pb(kz);
ans = multinom(fpl);
} else {
ans = mul(multinom(fmi), multinom(fpl));
ans = mul(ans, binom(n, kz));
ans = add(ans, ans);
}
cout << ans << '\n';
return 0;
}
|
//int max = 2 147 483 647 (2^31-1)
//ll max = 9 223 372 036 854 775 807 (2^63-1)
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
//Fast input and output
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);}
//Printing pairs and vectors
template<typename A, typename B> ostream& operator<< (ostream &cout, pair<A,B> const &p) {return cout << "(" << p.f << ", " << p.s << ")";}
template<typename A> ostream& operator<< (ostream &cout, vector<A> const&v){
cout << "["; forn(i,(int)v.size()){ if (i) cout << ", "; cout << v[i];} return cout << "]";}
vector<ll>fac(1e7);
ll mpow(ll base, ll exp) {
ll res = 1;
while (exp) {
if (exp % 2 == 1){
res = (res * base) % MOD;
}
exp >>= 1;
base = (base * base) % MOD;
}
return res;
}
ll minv(ll base) {
return mpow(base, MOD - 2);
}
ll mchoose(int n, int k){
if(n<k) return 0;
return ((fac[n]*minv(fac[k]))%MOD*minv(fac[n-k]))%MOD;
}
int main(){
fast_io();
fac[0]=1;
for(int i=1;i<1e7;i++){
fac[i]=(fac[i-1]*i)%MOD;}
int n; cin >> n;
vi a(n); ll tot=0;
map<int,int>occ;
forn(i,n){
cin >> a[i]; tot+=a[i]; occ[a[i]]++;}
if(tot%n>0){
cout << 0; return 0;}
int x=0,y=0,z=0;
forn(i,n){
if(a[i]>tot/n) x++;
if(a[i]<tot/n) y++;
if(a[i]==tot/n) z++;
}
if(x==1 or y==1){
ll ans=fac[n];
for(auto i:occ){
ans=(ans*minv(fac[i.s]))%MOD;}
cout << ans; return 0;
}
if(x==0){
cout << 1; return 0;}
ll ans = (((mchoose(n,z)*fac[z])%MOD*fac[y])%MOD*fac[x]*2)%MOD;
for(auto i:occ){
ans=(ans*minv(fac[i.s]))%MOD;}
cout << ans;
}
//code by DanTheMan
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
const int mod = 1000000000 + 7;
const int maxn = 100000 + 10;
int a[maxn], n;
LL p[maxn];
LL pow(LL x, int k) {
if (k == 0) return 1;
LL tmp = pow(x, k / 2);
tmp = (tmp * tmp) % mod;
if (k % 2 == 1) tmp = (tmp * x) % mod;
return tmp;
}
int main() {
p[0] = p[1] = 1;
for (int i = 2; i < maxn; i++) {
p[i] = (p[i-1] * i) % mod;
}
cin >> n;
LL sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a+n);
LL fm = 1;
for (int i = 0; i < n; i++) {
int j = i;
while (j < n && a[j] == a[i]) j++;
fm = (fm * p[j - i]) % mod;
i = j - 1;
}
if (sum % n != 0) {
cout << 0 << endl;
} else if (n == 1) {
cout << 1 << endl;
}else {
LL avg = sum / n;
int l = 0, m = 0, r = 0;
for (int i = 0; i < n; i++) {
if (a[i] == avg) m++;
else if (a[i] < avg) l++;
else r++;
}
if (m == n) {
cout << 1 << endl;
} else {
fm = fm * p[n - m] % mod;
// cout << fm << endl;
LL fz = (p[n] * p[l] % mod) * p[r] % mod;
// cout << n << " " << m << " " << l << " " << r << endl;
// cout << fz << endl;
if (l != 1 && r != 1) {
cout << pow(fm, mod - 2) * fz * 2 % mod << endl;
} else {
int mul = (r > l ? r : l) + 1;
cout << (pow(fm, mod - 2) * fz % mod) * mul % mod << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5+15;
const int mod = 1e9+7;
int fac[N],inv[N];
int add(int x,int y) {
return ((x+y)%mod+mod)%mod;
}
int mul(int x,int y) {
return (ll)x*y%mod;
}
int mypow(int x,int c) {
int ret = 1;
while(c>0) {
if(c&1) {
ret = mul(ret,x);
}
c/=2;
x = mul(x,x);
}
return ret;
}
int gcd(int x,int y) {
if(x==0) {
return y;
}
return gcd(y%x,x);
}
int combi(int n,int r) {
if(n<r) {
return 0;
}
return mul(fac[n],mul(inv[r],inv[n-r]));
}
int a[N];
int go(int n,ll g) {
int ret = 1;
for(int i=1;i<=n;) {
int j = i;
for(j=i;j<=n;++j) {
if(a[j]!=a[i]) break;
}
ret = mul(ret, inv[j-i]);
i = j;
}
return ret;
}
void solve2() {
int n;
scanf("%d ", &n);
ll sum = 0;
for(int i=1;i<=n;++i) {
scanf("%d ", &a[i]);
sum += a[i];
}
if(n==1) {
printf("1\n");
return;
}
if(sum%n!=0) {
printf("0\n");
return;
}
ll g= sum/n;
int sm= 0,big = 0;
sort(a+1,a+n+1);
for(int i=1;i<=n;++i) {
if(a[i]<g) {
++sm;
} else if(a[i]>g) {
++big;
}
}
int ret;
if(sm==1 || big==1 || sm==0 || big==0) {
ret = fac[n];
} else {
ret = mul(2,combi(n,sm+big));
ret = mul(ret, mul(fac[sm],fac[big]));
ret = mul(ret, fac[n-sm-big]);
}
ret = mul(ret,go(n,g));
printf("%d\n", ret);
}
void init() {
fac[0] = 1;
for(int i=1;i<N;++i) {
fac[i] = mul(fac[i-1],i);
}
inv[N-1] = mypow(fac[N-1],mod-2);
for(int i=N-2;i;--i) {
inv[i] = mul(inv[i+1],i+1);
assert(mul(inv[i],fac[i])==1);
}
inv[0] = 1;
}
void solve() {
init();
// int t;
// cin>>t;
// while (t--)
solve2();
}
inline bool exists_test0 (const std::string& name);
inline bool exists_test1 (const std::string& name);
int main() {
#ifdef LOCAL
string file_name = "input.txt";
assert(exists_test0(file_name));
assert(exists_test1(file_name));
freopen("input.txt","r",stdin);
#endif
solve();
return 0;
}
/*
0. Enough array size? Enough array size? Integer overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
4. Be careful to use wrong variable.
*/
inline bool exists_test0 (const std::string& name) {
ifstream f(name.c_str());
return f.good();
}
inline bool exists_test1 (const std::string& name) {
if (FILE *file = fopen(name.c_str(), "r")) {
fclose(file);
return true;
} else {
return false;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i=0; i<(n); i++)
#define readVec(v) forn(i, v.size()){cin >> v[i];}
#define printArr(arr, n) forn(i, n){if (i) cout << " "; cout << arr[i];} cout << endl;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define f first
#define s second
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<vi> vii;
//Printing pairs and vectors
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
//2 147 483 647 int max
//9 223 372 036 854 775 807 ll max
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void file_io(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
fast_io();
}
ll mpow(ll base, ll exp) {
ll res = 1;
while (exp) {
if (exp % 2 == 1){
res = (res * base) % MOD;
}
exp >>= 1;
base = (base * base) % MOD;
}
return res;
}
ll minv(ll base) {
return mpow(base, MOD - 2);
}
int main(){
fast_io();
int n;
cin >> n;
vl fac(2*n+5), ifac(2*n+5);
fac[0] = 1;
ifac[0] = 1;
forn(i, 2*n){
fac[i+1] = (fac[i] * (i+1))%MOD;
ifac[i+1] = minv(fac[i+1]);
}
function<ll(int, int)> choose = [&](int a, int b){
return (((fac[a]*ifac[b])%MOD)*ifac[a-b])%MOD;
};
vl v(n);
ll s = 0;
forn(i, n){
cin >> v[i];
s += v[i];
}
if(s%n != 0){
cout << 0 << "\n";
return 0;
}
ll av = s/n;
vl pos, neg;
int zer = 0;
forn(i, n){
v[i] -= av;
if(v[i] < 0){
neg.pb(v[i]);
}else if(v[i] > 0){
pos.pb(v[i]);
}else{
zer++;
}
}
if(zer == n){
cout << "1\n";
return 0;
}
sort(pos.begin(), pos.end());
sort(neg.begin(), neg.end());
ll pperm = fac[pos.size()];
ll bef = MOD;
int run = 0;
forn(i, pos.size()){
if(pos[i] == bef) run++;
else{
pperm = (pperm * ifac[run])%MOD;
run = 1;
bef = pos[i];
}
}
pperm = (pperm * ifac[run])%MOD;
ll nperm = fac[neg.size()];
bef = MOD;
run = 0;
forn(i, neg.size()){
if(neg[i] == bef) run++;
else{
nperm = (nperm * ifac[run])%MOD;
run = 1;
bef = neg[i];
}
}
nperm = (nperm * ifac[run])%MOD;
ll tot = choose(n, zer);
n -= zer;
if(pos.size() == 1){
tot = (tot*n)%MOD;
tot = (tot*nperm)%MOD;
}else if(neg.size() == 1){
tot = (tot*n)%MOD;
tot = (tot*pperm)%MOD;
}else{
tot = (tot*2)%MOD;
tot = (tot*pperm)%MOD;
tot = (tot*nperm)%MOD;
}
cout << tot << "\n";
}
|
/*https://codeforces.com/contest/1513/problem/E*/
#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const int N = 1e5 + 5, MOD = 1e9 + 7;
ll power[N], inv[N], fact[N];
struct Math{
Math(){preprocess();}
ll exp(ll a,ll n){
if(n==0) return 1;
if(n==1) return a;
ll ans = exp(a,n/2);
ans *= ans; ans %= MOD;
if(n&1ll) ans *= a;
return ans % MOD;
}
void preprocess(){
fact[0] = inv[0] = 1;
for(int i=1; i<N; i++)
fact[i] = (fact[i-1] * i) % MOD;
inv[N-1] = exp(fact[N-1], MOD-2);
for(int i = N-2; i>=0; i--)
inv[i] = (inv[i+1] * (i+1)) % MOD;
}
ll ncr(int n,int r){
ll ans = fact[n];
mul(ans, inv[r]);
mul(ans, inv[n-r]);
return ans;
}
ll npr(int n,int r){
ll ans = fact[n];
mul(ans, inv[n-r]);
return ans;
}
void mul(ll &a, ll b){
a = (a * b) % MOD;
}
}node;
// n! / (p1! * p2! * p3!)
int solve(vector<int> &a){
int n = a.size();
int ans = fact[n], den = 1;
map<int,int> m;
for(auto &x:a) m[x]++;
for(auto &x:m)
node.mul(ans, inv[x.second]);
return ans;
}
void solve(){
int n, sum = 0;cin>>n;
vector<int> a(n);
for(int i=0; i<n; i++)
cin>>a[i], sum += a[i];
if(sum % n){
cout<<0<<"\n";
return;
}
int req = sum/n;
vector<int>sm, lg;
int count[3]{};
for(int i=0;i<n;i++){
if(a[i] < req) count[0]++, sm.push_back(a[i]);
if(a[i] == req) count[1]++;
if(a[i] > req) count[2]++, lg.push_back(a[i]);
}
if(min(count[0], count[2]) < 2){
cout<<solve(a)<<"\n";
return;
}
int ans = 1;
node.mul(ans, solve(sm));
node.mul(ans, solve(lg));
node.mul(ans, 2);
node.mul(ans, node.ncr(n, count[1]));
cout << ans << "\n";
}
signed main(){
solve();
return 0;
}
|
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <memory.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string.h>
#include <string>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
ll fac[100100];
ll inv[100100];
ll modpow(ll a, ll x) {
if (x == 1) return a;
ll half = modpow(a, x / 2);
ll ret = (half*half) % MOD;
if (x % 2 == 1) ret = (ret * a) % MOD;
return ret;
}
void init() {
fac[0] = 1;
for (int i = 1; i < 100100; i++)
fac[i] = (fac[i - 1] * i) % MOD;
inv[100100 - 1] = modpow(fac[100100 - 1], MOD - 2);
for (int i = 100100 - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % MOD;
}
ll nCk(int n, int k) {
if (n < k) return 0;
return (((fac[n] * inv[n - k]) % MOD) * inv[k]) % MOD;
}
int arr[100100];
int cnt[100100];
int main()
{
int n;
int scnt, tcnt, acnt;
ll dups, ans, avg;
scanf("%d", &n);
init();
avg = 0;
for (int i = 0; i < n; i++){
scanf("%d", &arr[i]);
avg += arr[i];
}
sort(arr, arr + n);
if (avg % n != 0){
printf("0\n");
return 0;
}
avg /= n;
scnt = 0;
tcnt = 0;
acnt = 0;
dups = 1;
for (int i = 0; i < n; i++){
if (arr[i] < avg){
tcnt++;
cnt[i] = 1;
if (i > 0 && arr[i - 1] == arr[i]) {
cnt[i] += cnt[i - 1];
dups *= cnt[i];
dups %= MOD;
}
}
if (arr[i] > avg){
scnt++;
cnt[i] = 1;
if (i > 0 && arr[i - 1] == arr[i]) {
cnt[i] += cnt[i - 1];
dups *= cnt[i];
dups %= MOD;
}
}
if (arr[i] == avg) acnt++;
}
if (scnt == 1 || tcnt == 1){
ans = nCk(n, acnt);
ans *= fac[scnt + tcnt];
ans %= MOD;
ans *= modpow(dups, MOD - 2);
ans %= MOD;
printf("%lld\n", ans);
}
else if (scnt + tcnt == 0){
printf("1\n");
}
else{
ans = 2 * nCk(n, acnt) % MOD;
ans *= fac[scnt];
ans %= MOD;
ans *= fac[tcnt];
ans %= MOD;
ans *= modpow(dups, MOD - 2);
ans %= MOD;
printf("%lld\n", ans);
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<cstdlib>
#include<utility>
using namespace std;
int a[100000+5];
const int mod=1e9+7;
int q[100000+5],tot;
int jc[100000+5];
int jcn[100000+5];
int C(int x,int y)
{
return 1ll*jc[x]*jcn[y]%mod*jcn[x-y]%mod;
}
int ksm(int a,int k)
{
int s=1;
while (k)
{
if (k&1)
s=1ll*s*a%mod;
a=1ll*a*a%mod;
k>>=1;
}
return s;
}
int main()
{
int n,i,t1=0,t2=0,t3=0;
long long m=0;
scanf("%d",&n);
jc[0]=1;
for (i=1;i<=n;i++)
jc[i]=1ll*jc[i-1]*i%mod;
jcn[n]=ksm(jc[n],mod-2);
for (i=n-1;i>=0;i--)
jcn[i]=1ll*jcn[i+1]*(i+1)%mod;
for (i=1;i<=n;i++)
scanf("%d",&a[i]),m+=a[i];
if (m%n)
{
printf("0\n");
return 0;
}
m/=n;
for (i=1;i<=n;i++)
if (a[i]==m)
t3++;
else if (a[i]>m)
t1++;
else
t2++;
if (t1<=1||t2<=1)
{
int num=1,all=n,ans=1;
sort(a+1,a+n+1);
for (i=2;i<=n;i++)
if (a[i]==a[i-1])
num++;
else
ans=1ll*ans*C(all,num)%mod,all-=num,num=1;
ans=1ll*ans*C(all,num)%mod;
printf("%d\n",ans);
return 0;
}
int ans=2;
tot=0;
for (i=1;i<=n;i++)
if (a[i]==m)
q[++tot]=a[i];
sort(q+1,q+tot+1);
int num=1,all=n;
if (tot!=0)
{
for (i=2;i<=tot;i++)
if (q[i]==q[i-1])
num++;
else
ans=1ll*ans*C(all,num)%mod,all-=num,num=1;
ans=1ll*ans*C(all,num);
}
tot=0;
for (i=1;i<=n;i++)
if (a[i]>m)
q[++tot]=a[i];
sort(q+1,q+tot+1);
num=1,all=tot;
for (i=2;i<=tot;i++)
if (q[i]==q[i-1])
num++;
else
ans=1ll*ans*C(all,num)%mod,all-=num,num=1;
tot=0;
for (i=1;i<=n;i++)
if (a[i]<m)
q[++tot]=a[i];
sort(q+1,q+tot+1);
num=1,all=tot;
for (i=2;i<=tot;i++)
if (q[i]==q[i-1])
num++;
else
ans=1ll*ans*C(all,num)%mod,all-=num,num=1;
printf("%d\n",ans);
}
|
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
#define se second
#define fi first
#define pb emplace_back
#define mp make_pair
#define sqr(n) ((n)*(n))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define precision(a) setiosflags(ios::fixed) << setprecision(a)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<long long> VL;
typedef double db;
template <typename T> inline char read(T& x) {
x = 0; T fg = 1; char ch = getchar();
while (!isdigit(ch)) { if (ch == '-') fg = -1; ch = getchar(); }
while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ '0'), ch = getchar();
x = fg * x; return ch;
}
template <typename T, typename... Args> inline void read(T& x, Args &... args) { read(x), read(args...); }
template <typename T> inline void write(T x) {
int len = 0; char c[40]; if (x < 0) putchar('-'), x = -x;
do { ++len; c[len] = x % 10 + '0'; } while (x /= 10);
for (int i = len; i >= 1; i--) putchar(c[i]);
}
template <typename T, typename... Args> inline void write(T& x, Args &... args) { write(x), write(args...); }
template<class T1, class T2> bool umin(T1& a, T2 b) { return a > b ? (a = b, true) : false; }
template<class T1, class T2> bool umax(T1& a, T2 b) { return a < b ? (a = b, true) : false; }
template<class T> void clear(T& a) { T().swap(a); }
const int N = 1e5 + 5, mod = 1e9 + 7;
int n, m, _, k, cas;
ll fac[N], facinv[N], inv[N];
int a[N];
void init(int n) {
fac[0] = fac[1] = facinv[0] = facinv[1] = inv[0] = inv[1] = 1;
rep(i, 2, n)
fac[i] = fac[i - 1] * i % mod,
inv[i] = inv[mod % i] * (mod - mod / i) % mod,
facinv[i] = facinv[i - 1] * inv[i] % mod;
}
int main() {
IOS; cin >> n; init(n); ll s = 0;
rep(i, 1, n) cin >> a[i], s += a[i];
if (s % n) return cout << 0, 0;
sort(a + 1, a + 1 + n); s /= n;
int l = lower_bound(a + 1, a + 1 + n, s) - a, r = upper_bound(a + 1, a + 1 + n, s) - a - 1;
if (l == 1 && r == n) return cout << 1, 0;
ll x = fac[l - 1], y = fac[n - r], ans = fac[n] * facinv[r - l + 1] % mod * facinv[n - r + l - 1] % mod;
for (int i = 1, c = 0; i < l; ++i, ++c) if (a[i] != a[i + 1]) x = x * facinv[++c] % mod, c = -1;
for (int i = n, c = 0; i > r; --i, ++c) if (a[i] != a[i - 1]) y = y * facinv[++c] % mod, c = -1;
if (l == 2) cout << ans * y % mod * (n - r + l - 1) % mod;
else if (r == n - 1) cout << ans * x % mod * l % mod;
else cout << ans * x % mod * y % mod * 2 % mod;
return 0;
} |
//and the LIFE begins...
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn=1e5+10,mod=1e9+7;
ll fac[maxn],ifac[maxn];
ll poww(ll a,ll b){
ll ans=1;
for(;b;b>>=1,a=1ll*a*a%mod)
if(b&1)
ans=1ll*a*ans%mod;
return ans;
}
ll c(ll n,ll k){
if(n<k||k<0)
return 0;
return 1ll*fac[n]*ifac[k]%mod*ifac[n-k]%mod;
}
signed main(){
ios_base::sync_with_stdio(false),cin.tie(0);
fac[0]=1;
for(ll i=1;i<maxn;i++)
fac[i]=i*fac[i-1]%mod;
ifac[maxn-1]=poww(fac[maxn-1],mod-2);
for(ll i=maxn-2;i>-1;i--)
ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
ll n;
cin>>n;
ll arr[n],sum=0;
for(ll i=0;i<n;i++){
cin>>arr[i];
sum+=arr[i];
}
if(sum%n!=0)
return cout<<"0\n",0;
ll avg=sum/n;
ll big=0,small=0,havig=0;
for(ll i=0;i<n;i++){
if(arr[i]<avg)
small++;
else if(arr[i]==avg)
havig++;
else
big++;
}
vector<ll> same;
ll avgd=0;
sort(arr,arr+n);
ll cur=1;
for(ll i=1;i<n;i++){
if(arr[i]==arr[i-1])
cur++;
else{
if(arr[i-1]!=avg)
same.push_back(cur);
else
avgd=cur;
cur=1;
}
}
if(arr[n-1]!=avg)
same.push_back(cur);
else
avgd=cur;
if(min(small,big)<=1){
ll ans=fac[n];
if(avgd)
ans=ans*ifac[avgd]%mod;
for(ll i:same)
ans=1ll*ans*ifac[i]%mod;
return cout<<ans<<'\n',0;
}
ll ans=2ll*fac[big]*fac[small]%mod;
for(ll i:same)
ans=1ll*ans*ifac[i]%mod;
ans=ans*c(big+small+havig,havig)%mod;
cout<<ans;
return cout<<'\n',0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 100010;
typedef long long LL;
int Pow(int x, int y) {
int res = 1;
for (; y; y >>= 1, x = (LL)x * x % mod) if (y & 1) res = (LL)res * x % mod;
return res;
}
int a[N], frac[N], inv[N];
int C(int n, int r) {
return (LL)frac[n] * inv[r] % mod * inv[n - r] % mod;
}
int main() {
int n, A = 0, B = 0; scanf("%d", &n); LL sum = 0;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), sum += a[i];
if (sum % n) return puts("0"), 0;
sum /= n;
for (int i = 1; i <= n; i++) if (a[i] != sum) {
if (a[i] > sum) A++;
else B++;
}
frac[0] = inv[0] = 1;
for (int i = 1; i <= n; i++) frac[i] = (LL)frac[i - 1] * i % mod, inv[i] = Pow(frac[i], mod - 2);
int res = 0;
if (A <= 1 || B <= 1) res = (LL)frac[A + B] * C(n, A + B) % mod;
else res = (LL)frac[A] * frac[B] * 2 % mod * C(n, A + B) % mod;
map<int, int> buk;
for (int i = 1; i <= n; i++) if (a[i] != sum) buk[a[i]]++;
for (auto t : buk) res = (LL)res * inv[t.second] % mod;
printf("%d\n", res);
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1000000007; // faster if const
ll modpow(ll b, ll e) {
ll ans = 1;
for (; e; b = b * b % mod, e /= 2)
if (e & 1) ans = ans * b % mod;
return ans;
}
const int N = 112345;
vl fac(N), ifac(N);
void calc() {
fac[0] = ifac[0] = 1;
rep(i,1,N) {
fac[i] = ll(i) * fac[i-1] % mod;
ifac[i] = modpow(fac[i], mod-2);
}
}
ll nck(ll n, ll k) {
if (k < 0 || k > n) return 0;
return ((fac[n] * ifac[k] % mod) * ifac[n-k]) % mod;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
calc();
int n;
cin >> n;
vi a(n);
rep(i,0,n) cin >> a[i];
ll sum = accumulate(all(a), 0ll);
if (sum % n) return cout << 0 << '\n', 0;
// n | sum
ll per = sum / n;
int s = 0, t = 0, m = 0;
map<int, int> cnt;
rep(i,0,n) {
++cnt[a[i]];
if (a[i] < per) ++t;
else if (a[i] > per) ++s;
else ++m;
}
assert(s+t+m == n);
ll ans = 2;
(ans *= fac[s]) %= mod;
(ans *= fac[t]) %= mod;
(ans *= fac[m]) %= mod;
int k = s+t+1;
(ans *= nck(m+k-1, m)) %= mod;
if (min(s, t) <= 1) ans = fac[n];
for (auto [x, y]: cnt) {
(ans *= ifac[y]) %= mod;
}
cout << ans << '\n';
} |
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#include <immintrin.h>
//#include <emmintrin.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,h,t) for (int i=h;i<=t;i++)
#define dep(i,t,h) for (int i=t;i>=h;i--)
#define ll long long
#define me(x) memset(x,0,sizeof(x))
#define IL inline
#define rint register int
inline ll rd(){
ll x=0;char c=getchar();bool f=0;
while(!isdigit(c)){if(c=='-')f=1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}
return f?-x:x;
}
char ss[1<<24],*A=ss,*B=ss;
IL char gc()
{
return A==B&&(B=(A=ss)+fread(ss,1,1<<24,stdin),A==B)?EOF:*A++;
}
template<class T>void maxa(T &x,T y)
{
if (y>x) x=y;
}
template<class T>void mina(T &x,T y)
{
if (y<x) x=y;
}
template<class T>void read(T &x)
{
int f=1,c; while (c=gc(),c<48||c>57) if (c=='-') f=-1; x=(c^48);
while(c=gc(),c>47&&c<58) x=x*10+(c^48); x*=f;
}
const int mo=1e9+7;
struct re{
int a,b,c;
};
const int N=1e6;
int a[N];
ll ans=0;
int n;
ll AA(int x,int y)
{
ll ans=1;
dep(i,x,x-y+1) ans=ans*i%mo;
return ans;
}
map<int,int> M;
ll fsp(int x,int y)
{
if (y==1) return x;
ll ans=fsp(x,y/2);
ans=ans*ans%mo;
if (y%2==1) ans=ans*x%mo;
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin>>n;
rep(i,1,n) cin>>a[i];
rep(i,1,n) ans+=a[i];
if (ans%n!=0)
{
cout<<0<<endl;
} else
{
ans/=n;
int ans1=0,ans2=0,ans3=0;
ll t=1,t2=1;
rep(i,1,n)
{
if (a[i]<ans) ans1++;
if (a[i]==ans) ans2++;
if (a[i]>ans) ans3++;
M[a[i]]++;
}
if (min(ans1,ans3)>1)
{
t=1ll*AA(n,ans2)*AA(ans1,ans1)%mo*AA(ans3,ans3)%mo;
t=t*2%mo;
} else
{
t=AA(n,n);
}
rep(i,1,n)
{
if(M[a[i]])t2=t2*AA(M[a[i]],M[a[i]])%mo;
M[a[i]]=0;
}
t=t*fsp(t2,mo-2)%mo;
cout<<t<<endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.