This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int increase=1;
    int dp[n];
    int a[n];
    int b[n];
    for(int i=0;i<n;i++)
        cin >> a[i] >> b[i];
    dp[0]=1;
    for(int i=1;i<n;i++)
    {
        if(a[i]>a[i-1])
        {
            increase += increase+1;
            dp[i] = 2*dp[i-1] +1;
        }
        else
        {
            dp[i] = dp[i-1]+increase;
        }
    }
    cout << dp[n-1];
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |