Submission #1121008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1121008		steveonalex	Zoltan (COCI16_zoltan)	C++17	140 / 140	108 ms	10052 KiB

zoltan

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll gcd(ll a, ll b){return __gcd(a, b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }


template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


 
const int MOD = 1e9 + 7;
struct Modular{
    ll x;
    Modular(ll _x = 0){
        x = _x % MOD;
        if (x < 0) x += MOD;
    }
    Modular& operator += (Modular y){
        x += y.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    Modular operator + (Modular y) {
        Modular tmp = *this;
        return tmp += y;
    }
 
    Modular& operator -= (Modular y){
        x -= y.x;
        if (x < 0) x += MOD;
        return *this;
    }
    Modular operator - (Modular y) {
        Modular tmp = *this;
        return tmp -= y;
    }
 
    Modular& operator *= (Modular y){
        x *= y.x;
        if (x >= MOD) x %= MOD;
        return *this;
    }
    Modular operator * (Modular y) {
        Modular tmp = *this;
        return tmp *= y;
    }
 
    // use at your own risk
    bool operator == (Modular y){
        return x == y.x;
    }
    bool operator != (Modular y){
        return x != y.x;
    }
};
ostream& operator << (ostream& out, Modular x){
    out << x.x;
    return out;
}

Modular fast_pow(Modular a, int n){
    Modular ans = 1;
    while(n > 0){
        if (n & 1) ans *= a;
        a *= a;
        n >>= 1;
    }
    return ans;
}
Modular inverse(Modular a){return fast_pow(a, MOD - 2);}


pair<int, Modular> combine(pair<int, Modular> a, pair<int, Modular> b){
    if (a.first == b.first) return make_pair(a.first, a.second + b.second);
    if (a.first > b.first) return a;
    return b;
}

struct FenwickTree{
    int n;
    vector<pair<int, Modular>> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n+1, make_pair(0, 0));
    }


    void update(int i, pair<int, Modular> v){
        while(i <= n){
            a[i] = combine(a[i], v);
            i += LASTBIT(i);
        }
    }

    pair<int, Modular> get(int i){
        pair<int, Modular> ans = make_pair(0, 1);
        while(i > 0){
            ans = combine(ans, a[i]);
            i -= LASTBIT(i);
        }
        return ans;
    }
};

void solve(){
    int n; cin >> n;
    vector<int> a(n+1);
    for(int i= 1; i<=n; ++i) cin >> a[i];

    vector<int> b = a;
    remove_dup(b);

    int m = b.size() - 1;
    for(int i = 1; i<=n; ++i) a[i] = lower_bound(ALL(b), a[i]) - b.begin();

    pair<int, Modular> ans = make_pair(0, 0);
    FenwickTree bit1(m), bit2(m);
    for(int i = n; i >= 1; --i){
        pair<int, Modular> cur1 = bit1.get(a[i] - 1), cur2 = bit2.get(m - a[i]);
        cur1.first++; cur2.first++;
        pair<int, Modular> cur = make_pair(cur1.first + cur2.first - 1, cur1.second * cur2.second);
        cur.second *= fast_pow(2, (i - 1) + (n - i + 1 - cur.first));
        ans = combine(ans, cur);

        bit1.update(a[i], cur1);
        bit2.update(m - a[i] + 1, cur2);
    }

    cout << ans.first << " " << ans.second << "\n";
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    clock_t start = clock();
    
    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

• Subtask 1: 140 / 140