Submission #61086

ソースコード

?
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
for (auto &e: vec) {
is >> e;
}
return is;
}
inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) {
cout << " ";
}
output(forward<Tail>(tail)...);
}
template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
os << e << delim[&e == &vec.back()];
}
return os;
}
template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container &c;
reverse_t(Container &c) : c(c) {}
auto begin() { return c.rbegin(); }
auto end() { return c.rend(); }
};
template <class Container>
auto reversed(Container &c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
// End Header }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios_base::fixed);
cout.precision(10);
var(size_t, N, Q);
vector<intmax_t> a(N); input(a);
vector<intmax_t> minv(N); minv[0] = a[0];
rep(i, 1, N) minv[i] = min(minv[i - 1], a[i]);
while (Q--) {
var(size_t, R);
output(minv[R - 1]);
}
return 0;
}

ステータス

項目 データ
問題 1356 - Minimum Value
ユーザー名 もけ
投稿日時 2020-07-17 20:35:25
言語 C++17
状態 Accepted
得点 30
ソースコード長 3683 Byte
最大実行時間 65 ms
最大メモリ使用量 25652 KB

セット

セット 得点 Cases
1 task01 10 / 10 in01*, sample01.txt
2 task02 20 / 20 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01_01.txt AC 31 ms 604 KB
1
2
in01_02.txt AC 24 ms 416 KB
1
2
in01_03.txt AC 18 ms 484 KB
1
2
in01_04.txt AC 24 ms 544 KB
1
2
in01_05.txt AC 23 ms 600 KB
1
2
in01_06.txt AC 22 ms 664 KB
1
2
in01_07.txt AC 17 ms 716 KB
1
2
in01_08.txt AC 23 ms 640 KB
1
2
in01_09.txt AC 20 ms 568 KB
1
2
in01_10.txt AC 21 ms 628 KB
1
2
in01_11.txt AC 23 ms 684 KB
1
2
in01_12.txt AC 21 ms 620 KB
1
2
in01_13.txt AC 29 ms 800 KB
1
2
in02_01.txt AC 33 ms 2520 KB
2
in02_02.txt AC 50 ms 5268 KB
2
in02_03.txt AC 41 ms 5456 KB
2
in02_04.txt AC 61 ms 7684 KB
2
in02_05.txt AC 56 ms 10008 KB
2
in02_06.txt AC 61 ms 12080 KB
2
in02_07.txt AC 61 ms 14400 KB
2
in02_08.txt AC 65 ms 16596 KB
2
in02_09.txt AC 65 ms 18664 KB
2
in02_10.txt AC 63 ms 20732 KB
2
in02_11.txt AC 63 ms 22928 KB
2
in02_12.txt AC 59 ms 25252 KB
2
in02_13.txt AC 49 ms 25652 KB
2
sample01.txt AC 21 ms 22604 KB
1
2