Submission #71169104
Source Code Expand
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cctype>
#include <cmath>
#include <compare>
#include <cstdint>
#include <deque>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numbers>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using llong = long long;
using ullong = unsigned long long;
using namespace std::literals;
template <typename T, typename = void> struct IsIterable : std::false_type {};
template <typename T>
struct IsIterable<T, std::void_t<typename std::decay_t<T>::iterator>>
: public std::true_type {};
template <typename T> inline constexpr bool IsIterableV = IsIterable<T>::value;
template <typename T, typename = void> struct IsReadable : std::false_type {};
template <typename T>
struct IsReadable<
T, std::void_t<decltype(std::declval<std::istream>() >> std::declval<T>())>>
: public std::true_type {};
template <typename T> inline constexpr bool IsReadableV = IsReadable<T>::value;
template <typename T, typename = void> struct IsWritable : std::false_type {};
template <typename T>
struct IsWritable<
T, std::void_t<decltype(std::declval<std::ostream>() << std::declval<T>())>>
: public std::true_type {};
template <typename T> inline constexpr bool IsWritableV = IsWritable<T>::value;
template <typename T, typename U = std::decay_t<T>>
struct IsIOManip
: std::disjunction<std::is_function<U>,
std::is_same<U, decltype(std::resetiosflags({}))>,
std::is_same<U, decltype(std::setiosflags({}))>,
std::is_same<U, decltype(std::setbase({}))>,
std::is_same<U, decltype(std::setfill(char{}))>,
std::is_same<U, decltype(std::setprecision({}))>,
std::is_same<U, decltype(std::setw({}))>> {};
template <typename T> inline constexpr bool IsIOManipV = IsIOManip<T>::value;
template <typename T, typename = void> struct IsTupleLike : std::false_type {};
template <typename T>
struct IsTupleLike<
T, std::void_t<decltype(std::tuple_size<std::decay_t<T>>::value)>>
: public std::true_type {};
template <typename T>
inline constexpr bool IsTupleLikeV = IsTupleLike<T>::value;
std::string separator = " ";
ullong column = 0;
ullong row = 0;
bool flushEnabled = false;
void setSeparator(std::string_view s) { separator = s; }
void setFlushEnabled(bool enabled) { flushEnabled = enabled; }
std::istream &read() { return std::cin; }
std::istream &readln(std::string &s) { return std::getline(std::cin, s); }
std::istream &read(std::ios_base &(*f)(std::ios_base &)) {
return std::cin >> f;
}
std::istream &read(std::ios &(*f)(std::ios &)) { return std::cin >> f; }
std::istream &read(std::istream &(*f)(std::istream &)) { return std::cin >> f; }
template <typename T, std::enable_if_t<IsReadableV<T &>> * = nullptr>
std::istream &read(T &t) {
return std::cin >> t;
}
template <typename T, size_t N = 0,
std::enable_if_t<IsTupleLikeV<T &> && !IsReadableV<T &>> * = nullptr>
std::istream &read(T &t);
template <typename T,
std::enable_if_t<IsIterableV<T &> && !IsReadableV<T &>> * = nullptr>
std::istream &read(T &t) {
for (auto &&t_i : t) {
read(t_i);
}
return std::cin;
}
template <typename T, size_t N,
std::enable_if_t<IsTupleLikeV<T &> && !IsReadableV<T &>> *>
std::istream &read(T &t) {
if constexpr (std::tuple_size_v<std::decay_t<T>> != N) {
read(std::get<N>(t));
return read<T &, N + 1>(t);
} else {
return std::cin;
}
}
template <typename T, typename... U> std::istream &read(T &t, U &...u) {
read(t);
return read(u...);
}
std::ostream &write() { return std::cout; }
std::ostream &writeln() {
++row;
column = 0;
if (flushEnabled) {
return std::cout.put('\n').flush();
} else {
return std::cout.put('\n');
}
}
std::ostream &write(std::ios_base &(*f)(std::ios_base &)) {
return std::cout << f;
}
std::ostream &write(std::ios &(*f)(std::ios &)) { return std::cout << f; }
std::ostream &write(std::ostream &(*f)(std::ostream &)) {
return std::cout << f;
}
template <typename T, std::enable_if_t<IsIOManipV<T &&>> * = nullptr>
std::ostream &write(T &&t) {
return std::cout << t;
}
template <typename T,
std::enable_if_t<IsWritableV<T &&> && !IsIOManipV<T &&>> * = nullptr>
std::ostream &write(T &&t) {
if (column > 0 && !separator.empty()) {
std::cout << separator;
}
++column;
return std::cout << t;
}
template <
typename T, size_t N = 0,
std::enable_if_t<IsTupleLikeV<T &&> && !IsWritableV<T &&>> * = nullptr>
std::ostream &write(T &&t);
template <typename T,
std::enable_if_t<IsIterableV<T &&> && !IsWritableV<T &&>> * = nullptr>
std::ostream &write(T &&t) {
ullong i = 0;
for (auto it = t.begin(); it != t.end(); ++it, ++i) {
if constexpr (IsIterableV<decltype(*it)> || IsTupleLikeV<decltype(*it)>) {
if (i > 0) {
writeln();
}
}
write(*it);
}
return std::cout;
}
template <typename T, size_t N,
std::enable_if_t<IsTupleLikeV<T &&> && !IsWritableV<T &&>> *>
std::ostream &write(T &&t) {
if constexpr (std::tuple_size_v<std::decay_t<T>> != N) {
write(std::get<N>(t));
return write<T &&, N + 1>(std::forward<T>(t));
} else {
return std::cout;
}
}
template <typename T, typename... U> std::ostream &write(T &&t, U &&...u) {
write(std::forward<T>(t));
return write(std::forward<U>(u)...);
}
template <typename... T> std::ostream &writeln(T &&...t) {
write(std::forward<T>(t)...);
return writeln();
}
template <typename T, typename = std::enable_if_t<std::is_integral_v<T>>>
constexpr std::make_signed_t<T> signum(T value) {
return (std::make_signed_t<T>(0) < std::make_signed_t<T>(value)) -
(std::make_signed_t<T>(value) < std::make_signed_t<T>(0));
}
void answer() {
llong N;
read(N);
std::vector<llong> P(N);
read(P);
std::vector<llong> slopes{0};
for (llong i = 0; i + 1 < N; ++i) {
auto diff = P[i + 1] - P[i];
if (signum(slopes.back()) != signum(diff)) {
slopes.push_back(0);
}
slopes.back() += signum(diff);
}
llong count = 0;
for (llong i = 0; i + 2 < slopes.size(); i++) {
if (slopes[i] > 0) {
count += slopes[i] * slopes[i + 2];
}
}
writeln(count);
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
answer();
return 0;
}
Submission Info
Submission Time
2025-11-22 22:36:24+0900
Task
C - ~
User
k0michi
Language
C++ 20 (gcc 12.2)
Score
350
Code Size
6962 Byte
Status
AC
Exec Time
18 ms
Memory
9652 KiB
Compile Error
Main.cpp: In function ‘void answer()’:
Main.cpp:241:27: warning: comparison of integer expressions of different signedness: ‘llong’ {aka ‘long long int’} and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
241 | for (llong i = 0; i + 2 < slopes.size(); i++) {
| ~~~~~~^~~~~~~~~~~~~~~
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
350 / 350
Status
Set Name
Test Cases
Sample
sample00.txt, sample01.txt, sample02.txt
All
sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt
Case Name
Status
Exec Time
Memory
sample00.txt
AC
1 ms
3476 KiB
sample01.txt
AC
1 ms
3412 KiB
sample02.txt
AC
1 ms
3332 KiB
testcase00.txt
AC
4 ms
3948 KiB
testcase01.txt
AC
18 ms
7492 KiB
testcase02.txt
AC
3 ms
3688 KiB
testcase03.txt
AC
18 ms
7532 KiB
testcase04.txt
AC
15 ms
6120 KiB
testcase05.txt
AC
18 ms
7484 KiB
testcase06.txt
AC
13 ms
5800 KiB
testcase07.txt
AC
18 ms
7620 KiB
testcase08.txt
AC
1 ms
3412 KiB
testcase09.txt
AC
1 ms
3448 KiB
testcase10.txt
AC
6 ms
4880 KiB
testcase11.txt
AC
18 ms
9652 KiB
testcase12.txt
AC
12 ms
6704 KiB
testcase13.txt
AC
18 ms
9592 KiB
testcase14.txt
AC
14 ms
5356 KiB
testcase15.txt
AC
8 ms
4412 KiB
testcase16.txt
AC
14 ms
5468 KiB
testcase17.txt
AC
6 ms
4100 KiB
testcase18.txt
AC
14 ms
5420 KiB
testcase19.txt
AC
4 ms
3536 KiB
testcase20.txt
AC
14 ms
5468 KiB
testcase21.txt
AC
6 ms
4100 KiB
testcase22.txt
AC
14 ms
5468 KiB
testcase23.txt
AC
8 ms
4476 KiB
testcase24.txt
AC
14 ms
5416 KiB
testcase25.txt
AC
7 ms
4340 KiB
testcase26.txt
AC
14 ms
5544 KiB
testcase27.txt
AC
4 ms
3680 KiB
testcase28.txt
AC
14 ms
5380 KiB
testcase29.txt
AC
6 ms
4100 KiB
testcase30.txt
AC
14 ms
5308 KiB
testcase31.txt
AC
3 ms
3576 KiB
testcase32.txt
AC
14 ms
5528 KiB
testcase33.txt
AC
7 ms
3992 KiB
testcase34.txt
AC
14 ms
5360 KiB