Submission #1432776
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <utility> #include <cmath> #include <numeric> #include <fstream> #include <queue> #include <cstdio> #include <deque> #define fol(i,n) for(int i=0;i<n;i++) #define db(a) cout << a<< endl; using namespace std; int main(){ string a,b = "yahoo"; int ope = 0; cin >>a; priority_queue<int>N,M; fol(i,5) { M.push(b[i]-'a'); N.push(a[i]-'a'); } fol(i,5) { if(M.top()!=N.top()){ ope =1; break; } } if (ope)cout << "NO" <<endl; else cout << "YES" <<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Yahoo |
User | ravie403 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 676 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 | WA | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | WA | 1 ms | 256 KB |
in5.txt | AC | 1 ms | 256 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 1 ms | 256 KB |
in8.txt | WA | 1 ms | 256 KB |
in9.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | WA | 1 ms | 256 KB |