#388880 (C++14) No.905 Sorted?

• 問題: No.905 Sorted?
• ユーザー: a
• 提出日時: 2019-10-11 21:46:00
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 222 ms / 2,000 ms
• コード長: 1,765 bytes
• コンパイル時間: 1,543 ms
• コンパイル使用メモリ: 176,116 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-11-25 07:10:31
• 合計ジャッジ時間: 4,913 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
other	AC * 23

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include "bits/stdc++.h"
using namespace std;
//------------------------------- Libraries --------------------------------//
//------------------------------- Type Names -------------------------------//
using i64 = int_fast64_t;
using seika = string;
//akari : 1D, yukari : 2D, maki : 3D vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//akane : ascending order, aoi : decending order
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;
//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//
void solve()
{
    int n;
    cin >> n;
    akari<i64> as(n), bs, cs(n);
    for (int i = 0; i < n; i++)
    {
        cin >> as[i];
    }
    bs = as;
    sort(bs.begin(), bs.end());
    for (int i = 0; i < n; i++)
    {
        cs[i] = distance(bs.begin(), lower_bound(bs.begin(), bs.end(), as[i]));
    }
    as = cs;
    bs.resize(n, 0);
    cs.resize(n, 0);
    for (int i = 0; i < n - 1; i++)
    {
        bs[i + 1] = bs[i] + (as[i] <= as[i + 1]);
        cs[i + 1] = cs[i] + (as[i] >= as[i + 1]);
    }
    int q;
    cin >> q;
    while (q--)
    {
        int l, r;
        cin >> l >> r;
        print(bs[r] - bs[l] == (r - l), cs[r] - cs[l] == (r - l));
    }
}
int main()
{
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX