Submission #3664618
Source Code Expand
/* ---------- STL Libraries ---------- */ // IO library #include <cstdio> #include <fstream> #include <iomanip> #include <ios> #include <iostream> // algorithm library #include <algorithm> #include <cmath> #include <numeric> #include <random> // container library #include <array> #include <bitset> #include <deque> #include <map> #include <unordered_map> #include <queue> #include <set> #include <string> #include <tuple> #include <vector> /* ---------- Namespace ---------- */ using namespace std; /* ---------- Type Abbreviation ---------- */ using ll = long long; /* ---------- Constants */ const ll MOD = 1e9 + 7; // const int INF = 1 << 25; // const ll INF = 1LL << 50; // const double PI = acos(-1); // const double EPS = 1e-10; // mt19937 mert(LL(time(0))); /* ---------- Short Functions ---------- */ template <typename T> T gcd(T a, T b) { if (a > b) return gcd(b, a); return a == 0 ? b : gcd(b % a, a); } template <typename T, typename U> T mypow(T b, U n) { if (n == 0) return 1; if (n == 1) return b /* % MOD */; if (n % 2 == 0) { return mypow(b * b /* % MOD */, n / 2); } else { return mypow(b, n - 1) * b /* % MOD */; } } /* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */ int main() { string S; cin >> S; int ret = 1; int min_char = S[0]; for (int i = 1; i < S.size(); i++) { if (S[i] > min_char) { } else { min_char = S[i]; ret++; } } cout << ret << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Concatenation |
User | sykwer |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1601 Byte |
Status | AC |
Exec Time | 4 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 | 4 ms | 512 KB |
04.txt | AC | 4 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 | 4 ms | 512 KB |
12.txt | AC | 4 ms | 512 KB |
13.txt | AC | 4 ms | 512 KB |
14.txt | AC | 4 ms | 512 KB |
15.txt | AC | 4 ms | 512 KB |
16.txt | AC | 4 ms | 512 KB |
17.txt | AC | 4 ms | 512 KB |
18.txt | AC | 4 ms | 512 KB |
19.txt | AC | 4 ms | 512 KB |
20.txt | AC | 4 ms | 512 KB |
21.txt | AC | 4 ms | 512 KB |
22.txt | AC | 4 ms | 512 KB |
23.txt | AC | 4 ms | 512 KB |
24.txt | AC | 4 ms | 512 KB |
25.txt | AC | 4 ms | 512 KB |
26.txt | AC | 4 ms | 512 KB |
27.txt | AC | 4 ms | 512 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |