QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#29889 | #2910. Rise and Fall | George_Plover# | WA | 1ms | 3648kb | C++20 | 836b | 2022-04-23 12:48:42 | 2022-04-28 15:58:01 |
Judging History
answer
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 110000
using namespace std;
int n;
char s[MAXN];
int main()
{
scanf("%d",&n);
while(n--)
{
scanf("%s",s);
bool flag=0;
for(int i=0,lst='9';s[i];i++)
{
if(i==0)
{
putchar(s[i]);
continue;
}
if(flag)
{
putchar(lst = min(lst,(int)s[i]));
continue;
}
if(s[i] >= s[i-1])
{
putchar(s[i]);
continue;
}
else
{
flag=1;
putchar(lst=s[i]);
}
}
putchar('\n');
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3648kb
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'