Submission #1269788
Source Code Expand
#include <bits/stdc++.h> #define ll long long #define INF 999999999 #define MOD 1000000007 #define rep(i,n) for(int i=0;i<n;++i) using namespace std; typedef pair<int,int>P; const int MAX_N = 100005; int main() { string s; bool used[5]; bool flag = true; cin >> s; string r = "yahoo"; for(int i=0;i<s.length();i++){ bool hoge = false; for(int j=0;j<r.length();j++){ if(s[i] == r[j] && used[j] == false){ used[j] = true; hoge = true; break; } } if(!hoge){ flag = false; break; } } if(flag){ cout << "YES\n"; }else{ cout << "NO\n"; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Yahoo |
User | kopricky |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 635 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
in5.txt | WA | 1 ms | 256 KB |
in6.txt | WA | 1 ms | 256 KB |
in7.txt | WA | 1 ms | 256 KB |
in8.txt | AC | 1 ms | 256 KB |
in9.txt | AC | 1 ms | 256 KB |
sample1.txt | WA | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | WA | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |