Submission #653179

# Submission time Handle Problem Language Result Execution time Memory
653179 2022-10-26T02:31:43 Z guagua0407 Zoltan (COCI16_zoltan) C++17
14 / 140
218 ms 35952 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
	freopen((s + ".in").c_str(), "r", stdin);
	freopen((s + ".out").c_str(), "w", stdout);
}

const ll mxn=2e5+5;
const ll mod=1e9+7;
ll arr[mxn];
ll id[mxn];
map<ll,ll> num;
ll MX=0;
pair<ll,ll> segtree[mxn][2];

ll fpow(ll a,ll b){
	ll ans=1;
	while(b>0){
		if(b&1) ans=(ans*a)%mod;
		a=(a*a)%mod;
		b/=2;
	}
	return ans;
}

pair<ll,ll> comb(pair<ll,ll> a,pair<ll,ll> b){
	if(a.f==b.f){
		return {a.f,a.s+b.s};
	}
	return max(a,b);
}

void update(ll pos,pair<ll,ll> val,ll k,ll l=1,ll r=MX,ll v=1){
	if(l==r){
		segtree[v][k]=comb(segtree[v][k],val);
		return;
	}
	ll mid=(l+r)/2;
	if(pos<=mid) update(pos,val,k,l,mid,v*2);
	else update(pos,val,k,mid+1,r,v*2+1);
	segtree[v][k]=comb(segtree[v*2][k],segtree[v*2+1][k]);
}

pair<ll,ll> query(ll tl,ll tr,ll k,ll l=1,ll r=MX,ll v=1){
	if(tl>tr){
		return {0,1};
	}
	else if(tl<=l and r<=tr){
		return segtree[v][k];
	}
	ll mid=(l+r)/2;
	return comb(query(tl,min(mid,tr),k,l,mid,v*2),query(max(tl,mid+1),tr,k,mid+1,r,v*2+1));
}


int main() {_
	//setIO("wayne");
    ll n;
	cin>>n;
	for(ll i=1;i<=n;i++){
		cin>>arr[i];
		num[arr[i]]++;
	}
	for(auto &v:num){
		MX++;
		v.s=MX;
	}
	for(ll i=1;i<=n;i++){
		id[i]=num[arr[i]];
	}
	for(ll i=n;i>=1;i--){
		pair<ll,ll> tmp=query(id[i]+1,MX,0);
		update(id[i],{tmp.f+1,tmp.s},0);
	}
	for(ll i=n;i>=1;i--){
		pair<ll,ll> tmp=query(1,id[i]-1,1);
		update(id[i],{tmp.f+1,tmp.s},1);
	}
	pair<ll,ll> best={0,0};
	for(ll i=1;i<=n;i++){
		best=comb(best,{(query(id[i],id[i],1).f+query(id[i]+1,MX,0).f)%mod,(query(id[i],id[i],1).s*query(id[i]+1,MX,0).s)%mod});
		//cout<<best.f<<' '<<best.s<<'\n';
	}
	int one=1;
	if(best.s%2==0){
		best.s/=2;
		one=0;
	}
	cout<<best.f<<' '<<(best.s*fpow(2,n-best.f-one))%mod;
	return 0;
}
//maybe its multiset not set

Compilation message

zoltan.cpp: In function 'void setIO(std::string)':
zoltan.cpp:10:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  freopen((s + ".in").c_str(), "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
zoltan.cpp:11:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  freopen((s + ".out").c_str(), "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 2 ms 468 KB Output isn't correct
8 Incorrect 2 ms 468 KB Output isn't correct
9 Incorrect 2 ms 468 KB Output isn't correct
10 Incorrect 2 ms 468 KB Output isn't correct
11 Runtime error 112 ms 26020 KB Execution killed with signal 11
12 Runtime error 84 ms 22476 KB Execution killed with signal 11
13 Runtime error 90 ms 26540 KB Execution killed with signal 11
14 Runtime error 104 ms 22596 KB Execution killed with signal 11
15 Runtime error 218 ms 27708 KB Execution killed with signal 11
16 Runtime error 190 ms 35952 KB Execution killed with signal 11
17 Runtime error 110 ms 28088 KB Execution killed with signal 11
18 Runtime error 108 ms 28108 KB Execution killed with signal 11
19 Runtime error 105 ms 28152 KB Execution killed with signal 11
20 Runtime error 97 ms 28208 KB Execution killed with signal 11