QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#799772 | #8248. Is Y a Vowel? | LaVuna47# | AC ✓ | 0ms | 3868kb | C++20 | 1.7kb | 2024-12-05 17:54:48 | 2024-12-05 17:54:49 |
Judging History
answer
/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
int solve()
{
string s;
if(!(cin>>s))return 1;
string v1="aeiou";
string v2="aeiouy";
int ctr1=0;
for(auto ch:s)
{
bool ok=false;
for(auto vw: v1)if(ch==vw)ok=true;
if(ok)++ctr1;
}
int ctr2=0;
for(auto ch:s)
{
bool ok=false;
for(auto vw: v2)if(ch==vw)ok=true;
if(ok)++ctr2;
}
cout<<ctr1<<' ' << ctr2 << "\n";
return 0;
}
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int TET = 1e9;
//cin >> TET;
for (int i = 1; i <= TET; i++)
{
if (solve())
{
break;
}
#ifdef ONPC
cout << "__________________________" << endl;
#endif
}
#ifdef ONPC
cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
input:
asdfiy
output:
2 3
result:
ok single line: '2 3'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
asdeyy
output:
2 4
result:
ok single line: '2 4'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
y
output:
0 1
result:
ok single line: '0 1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3864kb
input:
masiwbtuqcbhfebhiehrfynodgmdujstvivcamakuqsulxjfni
output:
14 15
result:
ok single line: '14 15'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
hbbfiriglpvpzhqgloaezhbbduyeppuydieusencegnaoxigus
output:
17 19
result:
ok single line: '17 19'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
qwerty
output:
1 2
result:
ok single line: '1 2'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
yyyyy
output:
0 5
result:
ok single line: '0 5'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
asde
output:
2 2
result:
ok single line: '2 2'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
qwqwplkjhgfdsxncmnbvzxc
output:
0 0
result:
ok single line: '0 0'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
aiuoefgh
output:
5 5
result:
ok single line: '5 5'