QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#311487 | #2910. Rise and Fall | Lionel_ZQY | WA | 2ms | 3564kb | C++20 | 493b | 2024-01-22 14:12:59 | 2024-01-22 14:13:00 |
Judging History
answer
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using i64=long long;
void solve(){
bool flag = 0;
string s;
cin>>s;
for (int i = 2; i < s.length();i++)
{
if (s[i - 1] < s[i - 2])
flag = 1;
if (flag)
s[i] = min(s[i], s[i - 1]);
}
cout << s << endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3564kb
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'