Submission #11171673


Source Code Expand

Copy
#include <bits/stdc++.h>
#include <cmath>

const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;

std::istream &operator>>(std::istream &in, set<int> &o) {
    ll a;
    in >> a;
    o.insert(a);
    return in;
}

std::istream &operator>>(std::istream &in, queue<int> &o) {
    ll a;
    in >> a;
    o.push(a);
    return in;
}

bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }

//ifstream myfile("C:\\Users\\riku\\Downloads\\0_00.txt");
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
const int mod = 1000000007;
//const ll mod = 1e10;
typedef priority_queue<string, vector<string>, greater<string> > PQ_ASK;

#include <iostream>
#include <vector>

using namespace std;

void tow_pointer(int n,
                 function<bool(int left)> check_begin,
                 function<void(int left)> begin,
                 function<bool(int right)> check_right,
                 function<void(int right)> push_right,
                 function<void(int left)> pop_left,
                 function<void(int left, int right)> dead_end
) {

    auto go = [&](P range) {
        int right = -1;
        for (int left = range.first; left <= range.second; left++) {
            if (right < left) {
                right = left;
                begin(left);
            }
            while (right + 1 <= range.second && check_right(right + 1)) {
                right++;
                push_right(right);
            }
            dead_end(left, right);
            pop_left(left);
        }
    };


    auto get_ranges = [&] {
        vector<bool> enable_items(n);
        rep(i, n) enable_items[i] = check_begin(i);

        auto start = [&](int i) {
            if (i == 0) {
                return enable_items[i] == true;
            }
            if (!enable_items[i - 1] && enable_items[i]) {
                return true;
            }
            return false;
        };

        auto end = [&](int i) {

            if (i == n - 1) {
                return enable_items[i] == true;
            }

            if (enable_items[i] && !enable_items[i + 1]) {
                return true;
            }

            return false;
        };

        vector<P> ans;
        P p;
        rep(i, n) {
            if (start(i)) {
                p = P(i, -1);
            }
            if (end(i)) {
                p.second = i;
                ans.push_back(p);
            }
        }
        return ans;
    };


    vector<P> ranges = get_ranges();
    for (P range: ranges) go(range);
}


int main() {
    int n;
    cin >> n;

    vector<ll> numbers(n);
    rep(i, n) cin >> numbers[i];


    auto check_begin = [&](int i) {
        return true;
    };

    auto begin = [&](int i) {
    };

    auto check_right = [&](int right) {
        return numbers[right - 1] < numbers[right];
    };

    auto push_right = [&](int right) {

    };
    auto pop_left = [&](int left) {

    };

    ll ans = 0;

    auto dead_end = [&](int left, int right) {
        ll now = right - left + 1;
        ans += now;
    };


    tow_pointer(
            n,
            check_begin,
            begin,
            check_right,
            push_right,
            pop_left,
            dead_end
    );
    cout << ans << endl;

}

Submission Info

Submission Time
Task C - 単調増加
User riku_tanide
Language C++14 (GCC 5.4.1)
Score 100
Code Size 3821 Byte
Status
Exec Time 31 ms
Memory 1024 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample0.txt, sample1.txt, sample2.txt, sample3.txt
Subtask0 40 / 40 sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt
All 60 / 60 sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt 1 ms 256 KB
sample1.txt 1 ms 256 KB
sample2.txt 1 ms 256 KB
sample3.txt 1 ms 256 KB
subtask0_0.txt 2 ms 256 KB
subtask0_1.txt 2 ms 256 KB
subtask0_10.txt 2 ms 256 KB
subtask0_11.txt 2 ms 256 KB
subtask0_12.txt 2 ms 256 KB
subtask0_13.txt 2 ms 256 KB
subtask0_14.txt 2 ms 256 KB
subtask0_2.txt 1 ms 256 KB
subtask0_3.txt 1 ms 256 KB
subtask0_4.txt 2 ms 256 KB
subtask0_5.txt 1 ms 256 KB
subtask0_6.txt 1 ms 256 KB
subtask0_7.txt 1 ms 256 KB
subtask0_8.txt 1 ms 256 KB
subtask0_9.txt 2 ms 256 KB
subtask1_0.txt 26 ms 896 KB
subtask1_1.txt 11 ms 512 KB
subtask1_10.txt 30 ms 1024 KB
subtask1_11.txt 31 ms 1024 KB
subtask1_12.txt 30 ms 1024 KB
subtask1_13.txt 30 ms 1024 KB
subtask1_14.txt 30 ms 1024 KB
subtask1_15.txt 30 ms 1024 KB
subtask1_2.txt 9 ms 512 KB
subtask1_3.txt 20 ms 768 KB
subtask1_4.txt 23 ms 896 KB
subtask1_5.txt 22 ms 768 KB
subtask1_6.txt 13 ms 512 KB
subtask1_7.txt 27 ms 1024 KB
subtask1_8.txt 9 ms 512 KB
subtask1_9.txt 4 ms 384 KB