Submission #3666059
Source Code Expand
#include <bits/stdc++.h> #define FOR(i, a, b) for(int i=(a); i<(b); i++) #define REP(i, n) FOR(i, 0, n) #define all(x) (x).begin(), (x).end() using ll = long long; using namespace std; int main(){ string s; cin >> s; char t = s[0]; if(s.size() == 1){ cout << 1 << endl; return 0; } int cnt = 1; FOR(i, 1, s.size()){ if(s[i] <= t){ t = s[i]; cnt++; } } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Concatenation |
User | kobajin |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 464 Byte |
Status | AC |
Exec Time | 5 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 | 5 ms | 512 KB |
04.txt | AC | 5 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 | 5 ms | 512 KB |
14.txt | AC | 5 ms | 512 KB |
15.txt | AC | 4 ms | 512 KB |
16.txt | AC | 5 ms | 512 KB |
17.txt | AC | 5 ms | 512 KB |
18.txt | AC | 4 ms | 512 KB |
19.txt | AC | 5 ms | 512 KB |
20.txt | AC | 5 ms | 512 KB |
21.txt | AC | 5 ms | 512 KB |
22.txt | AC | 5 ms | 512 KB |
23.txt | AC | 5 ms | 512 KB |
24.txt | AC | 4 ms | 512 KB |
25.txt | AC | 4 ms | 512 KB |
26.txt | AC | 4 ms | 384 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 |