#954631 (C++17(clang)) No.2650 [Cherry 6th Tune *] セイジャク

• 問題: No.2650 [Cherry 6th Tune *] セイジャク
• ユーザー: abap34
• 提出日時: 2024-02-23 22:53:09
• 言語: C++17(clang) (17.0.6 + boost 1.87.0)
• 結果: RE
• 実行時間: -
• コード長: 1,813 bytes
• コンパイル時間: 3,815 ms
• コンパイル使用メモリ: 181,760 KB
• 実行使用メモリ: 22,372 KB
• 最終ジャッジ日時: 2024-09-29 08:08:02
• 合計ジャッジ時間: 24,398 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 2
other	WA * 29 RE * 2

ソースコード

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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(), (a).end()
int searchsortedfirst(const std::vector<int> &vec, int value)
{
    int low = 0;
    int high = vec.size() - 1;
    int pos = 0;
    while (low <= high)
    {
        int mid = low + (high - low) / 2;
        if (vec[mid] == value)
        {
            return mid;
        }
        else if (vec[mid] < value)
        {
            pos = mid + 1;
            low = mid + 1;
        }
        else
        {
            pos = mid;
            high = mid - 1;
        }
    }
    return pos;
}
int main()
{
    int N, A, T;
    cin >> N >> A;
    vector<int> X(N);
    rep(i, N) cin >> X[i];
    sort(ALL(X));
    cin >> T;
    vector<vector<int>> pusht(T + 1);
    vector<vector<int>> popt(T + 1);
    vector<int> L(T);
    vector<int> R(T);
    rep(i, N) cin >> L[i] >> R[i];
    rep(t, T)
    {
        int l = L[t];
        int r = R[t];
        // Xへの挿入位置を二分探索
        int lpos = searchsortedfirst(X, l);
        int rpos = searchsortedfirst(X, r);
        assert(lpos <= rpos);
        assert(lpos >= 0);
        assert(rpos <= pusht.size());
        pusht[lpos].push_back(t + 1);
        popt[rpos].push_back(t + 1);
    }
    set<int> current;
    rep(i, N)
    {
        for (auto t : popt[i])
        {
            if (current.count(t))
            {
                current.erase(t);
            }
        }
        for (auto t : pusht[i])
        {
            current.insert(t);
        }
        if (current.size() > 0)
        {
            cout << *current.rbegin() << endl;
        }
        else
        {
            cout << -1 << endl;
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX