제출 #249024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249024		leaked	Zoltan (COCI16_zoltan)	C++14	140 / 140	132 ms	9976 KiB

zoltan

#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=2e5+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
    cout<<-1;
    exit(0);
}
void mul(int &a,int b){
    a=(1ll*a*b)%M;
}
void add(int &a,int b){
    a+=b;
    if(a<0) a+=M;
    if(a>=M) a-=M;
}
vector<int>a,b;
int n;
pii fnw[2][N];
void upd(pii& a,pii b){
    if(a.f==b.f) add(a.s,b.s);
    else if(b.f>a.f) a=b;
}
pii get(int tp,int val){
    pii to={0,0};
    while(val>0){
        upd(to,fnw[tp][val]);
        val-=val&-val;
    }
    return to;
}
void  upda(int tp,int val,pii to){
   // pii to={0,0};
    while(val<N){
        upd(fnw[tp][val],to);
        val+=val&-val;
    }
}
signed main()
{
    fast_io;
    ///TODO :написать фенветосы для LIS& DIS
    cin>>n;
    a.resize(n);
    for(auto &z : a) cin>>z;
    b=a;sort(all(b));b.erase(unique(all(b)),b.end());
    for(int i=0;i<n;i++){
        a[i]=lower_bound(all(b),a[i])-b.begin()+1;
    }
    vector<pii>c(n),d(n);///inc,dic
    pii mx;
    for(int i=n-1;i>=0;i--){
        pii f=get(0,a[i]-1),s=get(1,sz(b)-a[i]);
        ///     inc ,            inc
        if(!f.f){
            c[i]={0,1};
            f.s=1;
        }
        if(!s.f){
            d[i]={0,1};
            s.s=1;
        }
        upda(0,a[i],{f.f+1,f.s});
        upda(1,sz(b)-a[i]+1,{s.f+1,s.s});
        mul(f.s,s.s);
        pii nw={f.f+s.f+1,f.s};
        upd(mx,nw);
    }
    mul(mx.s,binpow(2,n-mx.f,M));
    cout<<mx.f<<' '<<mx.s;
    return 0;
}
/*

*/

• Subtask 1: 140 / 140