Submission #00115

ソースコード

?
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include "bits/stdc++.h"
// 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);
vector<intmax_t> a(N);
input(a);
intmax_t mcnt = 0;
for (const auto ai: a) mcnt += (ai < 0);
if (mcnt == N) {
if (mcnt % 2 == 0) {
size_t idx;
intmax_t maxv = 0;
rep(i, 0, N) {
if (chmax(maxv, abs(a[i]))) idx = i;
}
output(idx + 1);
return 0;
}
}
if (mcnt & 1) {
size_t idx;
intmax_t minv = LINF;
rep(i, 0, N) {
if (a[i] < 0) {
if (chmin(minv, abs(a[i]))) idx = i;
}
}
output(idx + 1);
} else {
size_t idx;
intmax_t minv = LINF;
rep(i, 0, N) {
if (a[i] > 0) {
if (chmin(minv, abs(a[i]))) idx = i;
}
}
output(idx + 1);
}
return 0;
}

ステータス

項目 データ
問題 0003 - Product Maximization
ユーザー名 もけ
投稿日時 2020-04-25 22:44:12
言語 C++17
状態 Accepted
得点 300
ソースコード長 4297 Byte
最大実行時間 31 ms
最大メモリ使用量 1392 KB

セット

セット 得点 Cases
1 ALL 300 / 300 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 23 ms 604 KB
1
in02.txt AC 21 ms 436 KB
1
in03.txt AC 20 ms 524 KB
1
in04.txt AC 24 ms 480 KB
1
in05.txt AC 22 ms 564 KB
1
in06.txt AC 21 ms 908 KB
1
in07.txt AC 27 ms 980 KB
1
in08.txt AC 24 ms 1268 KB
1
in09.txt AC 19 ms 716 KB
1
in10.txt AC 22 ms 744 KB
1
in11.txt AC 23 ms 588 KB
1
in12.txt AC 27 ms 1296 KB
1
in13.txt AC 24 ms 1120 KB
1
in14.txt AC 21 ms 684 KB
1
in15.txt AC 23 ms 680 KB
1
in16.txt AC 21 ms 744 KB
1
in17.txt AC 25 ms 1228 KB
1
in18.txt AC 24 ms 1208 KB
1
in19.txt AC 26 ms 896 KB
1
in20.txt AC 25 ms 1252 KB
1
in21.txt AC 30 ms 1316 KB
1
in22.txt AC 28 ms 1252 KB
1
in23.txt AC 31 ms 1316 KB
1
in24.txt AC 23 ms 612 KB
1
in25.txt AC 22 ms 572 KB
1
in26.txt AC 17 ms 524 KB
1
in27.txt AC 20 ms 480 KB
1
in28.txt AC 27 ms 1336 KB
1
in29.txt AC 29 ms 1392 KB
1
sample01.txt AC 14 ms 688 KB
1
sample02.txt AC 17 ms 644 KB
1