QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#437361 | #2910. Rise and Fall | JustJie# | WA | 2ms | 3828kb | C++20 | 1.0kb | 2024-06-09 08:39:18 | 2024-06-09 08:39:18 |
Judging History
answer
/***************************************************************************************************
* author : Jie Chen (4th Year CS)
* school : Rochester Institute of Technology
* created: 06.08.2024 20:34:17
****************************************************************************************************/
#include "bits/stdc++.h"
using namespace std;
using i64 = long long;
void work(int tc) {
string s;
cin >> s;
int n = s.size();
string t;
t += s[0];
bool good = true;
for (int i = 1; i < n; i++) {
if (good) {
if (s[i] >= t.back()) {
t += s[i];
} else {
good = false;
t += s[i];
}
} else {
t += min(t.back(), s[i]);
}
}
cout << t << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
for (int t = 1; T--; t++) {
work(t);
}
}
// ~ Just Jie
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3828kb
input:
22221 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 10...
output:
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 100 100 ...
result:
wrong answer 2120th lines differ - expected: '2111', found: '2110'