Submission #9909591
Source Code Expand
#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, n) for (intmax_t i = 0, i##_limit = (n); 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>
using MaxHeap = priority_queue<T, vector<T>, less<T>>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
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 void input(vector<T> &vec) {
for (auto &e: vec) {
cin >> e;
}
}
template <class T>
inline void input(vector<vector<T>> &mat) {
for (auto &vec: mat) {
input(vec);
}
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) {
cout << ' ';
}
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream& operator<<(ostream &strm, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
strm << e << delim[&e == &vec.back()];
}
return strm;
}
template <class T>
inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(sz, make_v<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 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;
}
// }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
var(string, S);
const size_t N = S.size();
size_t res = 1;
char minchar = S[0];
reps(i, 1, N - 1) {
if (chmin(minchar, S[i]) || minchar == S[i]) {
res++;
}
}
print(res);
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Concatenation |
User |
r1933 |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
3346 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt, s3.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, s1.txt, s2.txt, s3.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
1 ms |
256 KB |
02.txt |
AC |
1 ms |
256 KB |
03.txt |
AC |
2 ms |
512 KB |
04.txt |
AC |
2 ms |
512 KB |
05.txt |
AC |
1 ms |
256 KB |
06.txt |
AC |
1 ms |
256 KB |
07.txt |
AC |
1 ms |
256 KB |
08.txt |
AC |
1 ms |
256 KB |
09.txt |
AC |
1 ms |
256 KB |
10.txt |
AC |
1 ms |
256 KB |
11.txt |
AC |
2 ms |
384 KB |
12.txt |
AC |
2 ms |
384 KB |
13.txt |
AC |
2 ms |
512 KB |
14.txt |
AC |
2 ms |
512 KB |
15.txt |
AC |
2 ms |
384 KB |
16.txt |
AC |
2 ms |
384 KB |
17.txt |
AC |
2 ms |
512 KB |
18.txt |
AC |
2 ms |
384 KB |
19.txt |
AC |
2 ms |
384 KB |
20.txt |
AC |
2 ms |
384 KB |
21.txt |
AC |
2 ms |
384 KB |
22.txt |
AC |
2 ms |
384 KB |
23.txt |
AC |
2 ms |
384 KB |
24.txt |
AC |
2 ms |
384 KB |
25.txt |
AC |
2 ms |
384 KB |
26.txt |
AC |
2 ms |
384 KB |
27.txt |
AC |
2 ms |
384 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |
s3.txt |
AC |
1 ms |
256 KB |