ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#213994 | #2739. 阿空的核聚变 | ThySecret | 60 | 326ms | 1416kb | C++11 | 1.7kb | 2024-11-14 21:53:15 | 2024-11-14 23:08:39 |
answer
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);
typedef long long LL;
typedef pair<int, int> PII;
const int N = 200010;
const int INF = 0x3f3f3f3f;
template<typename Type>
inline void read(Type &res)
{
res = 0;
int ch = getchar(), flag = 0;
while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }
char str[N], temp[N];
int n, q;
signed main()
{
scanf("%s", str + 1), n = strlen(str + 1);
memcpy(temp, str, sizeof temp);
read(q);
while (q --)
{
int l, r; read(l, r);
memcpy(temp, str, sizeof temp);
vector<char> vec;
for (int i = l; i <= r; i ++)
{
while (!vec.empty() && vec.back() == temp[i])
{
vec.pop_back();
if (temp[i] == 'z')
{
temp[i] = 'A';
break;
}
else temp[i] ++;
}
if (temp[i] != 'A') vec.push_back(temp[i]);
}
cout << (vec.size() ? "No" : "Yes") << '\n';
}
return 0;
}
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 25ms
memory: 1408kb
input:
wwwwyyyvttttutsrqquuusstttuvutrrsvvwxvvwvvvvwuuvwvvwwuuurrssswywvvwvurrstxwvvxxxxxxyzvvvssrrsttvuuwy...
output:
No No No No No No No No Yes No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 3000 lines
Test #2:
score: 10
Accepted
time: 24ms
memory: 1412kb
input:
wvvvvwwttuvwwyyxxwvvwwzywvttuusstuuwyyywwxyywvuttuuuttwxwwyyyxxzzxxxwvuuyyyyzvvvvwvvvvwwwztssuuuwwwy...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No Y...
result:
ok 3000 lines
Test #3:
score: 10
Accepted
time: 51ms
memory: 1408kb
input:
zywwxyyzyyvuttwvvwxutssvuuvyyzzyxxyxxzzyyxxyxxxxzyxxwuuvwwxwwyxxyvvttuvxyyyxxyyyyyxxyyxwwxxyyyvuuwww...
output:
No No No No No No No No No No No No No No No No Yes No No No No No No No No No No No No No No No No ...
result:
ok 3000 lines
Test #4:
score: 10
Accepted
time: 70ms
memory: 1416kb
input:
zzzyywwxyzxxyzyyzzyyyyzyyzyxxzzzzyyyyyxxyyzzyxxzzyyzzzyyzyyzzzzyyyyzzzxwwwwxzzzzyyzxxyyyzzyyyyyyzzzy...
output:
No No No Yes No Yes No No Yes No Yes No No No No No No Yes No No No No No No No No No No Yes No No N...
result:
ok 3000 lines
Test #5:
score: 10
Accepted
time: 80ms
memory: 1412kb
input:
yxxyxxzzyyxxyyxxxxxxxwvuuxvvwyyxxxxyyyyxxwwxzyxxyxxyyyxwvuttywvvxxxywwxywwxxwuuuuzxxyxwwxvvwwuuvxyww...
output:
No Yes No No No No No No No No No No No No No No No No Yes No No No No No No No No No No No No No No...
result:
ok 3000 lines
Test #6:
score: 10
Accepted
time: 76ms
memory: 1416kb
input:
xxyywvvxyuuuuvvwwxxxttuvvvzvvwwwyyywwsstuuttvvwvttuwvurrrrsqqrxxvvttttvxuuvwvusstvvxwwyxxzzxwwxutsss...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No N...
result:
ok 3000 lines
Test #7:
score: 0
Runtime Error
input:
yyzzzyyzzzyyzzzzyzzyyzyyzzyzzyzzzzyyzyyzzyzyzyyzyzyzzzzzzyzzyzzzyyyzyyzzyyyzzyzyyzzzyyzyyzzzyzyzyzyy...
output:
result:
Test #8:
score: 0
Runtime Error
input:
yzzzzyzzyyzyzzzyyyzyyzyzzzyzyzzzzzzzyyyzyyzyzzzzyzzyyyyyzyyzyzyyzzzyzzyzzyzzzzzyyzyyyyyzyyyzzyzyzzyy...
output:
result:
Test #9:
score: 0
Runtime Error
input:
yyyyxxyzxxxxxxwvuuvvwzxxwwvuuvuuxutssvutssuttxxyxxxvvttuvxxywwxxwwyywwxyyywwxzyxwwxxywwwwyyyywwxyyvv...
output:
result:
Test #10:
score: 0
Runtime Error
input:
ywwxyyxxyzzzyxxyyyyzzzzzzyyzzyxxzzyyyxxzzzywwxzzyyzwwxxwwyyzyyzzzyyzyyyxwwyxxyyzyyyxxyyzyxxyyzzywwxw...