Submission #5726860


Source Code Expand

Copy
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>

#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pf pop_front()
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define loopl(i,a,b) for(lli i=a;i<b;i++) 
#define loop(i,a,b) for(int i=a;i<b;i++)
#define mod 1000000007
#define mo 998244353
#define inf 1000000000000000
#define lld long double
#define pll pair<long long int,long long int>
#define vll vector<lli>
#define eps 0.000001
#define ms 16
#define endl '\n'

 
using namespace std ;
 
#define N 400005

typedef tree<lli,null_type,less<lli>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;

int main()
{
    
///////////////////////////////////////////
    fastio;


    string s;
    cin>>s;

    lli k=s.size();

    lli sum=0;
    loopl(i,0,k)
    {
        if(s[i] == 'o') sum++;
    }

    if(sum>=8 || (8-sum)<=(15-k))
        cout<<"YES";
    else cout<<"NO";

}

Submission Info

Submission Time
Task B - Sumo
User ahskd
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1345 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example0.txt, example1.txt
All 200 / 200 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt 1 ms 256 KB
001.txt 1 ms 256 KB
002.txt 1 ms 256 KB
003.txt 1 ms 256 KB
004.txt 1 ms 256 KB
005.txt 1 ms 256 KB
006.txt 1 ms 256 KB
007.txt 1 ms 256 KB
008.txt 1 ms 256 KB
009.txt 1 ms 256 KB
010.txt 1 ms 256 KB
example0.txt 1 ms 256 KB
example1.txt 1 ms 256 KB