Submission #56002552

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// !JOY
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
        
#define ll long long
#define ld long double
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define coutyes cout<<"YES\n"
#define coutno cout<<"NO\n"
#define endl "\n"
#define hell 1000000007
using namespace std;
int M = 1000000;
int sieve[1000001];
 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

// !JOY
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
        
#define ll long long
#define ld long double
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define coutyes cout<<"YES\n"
#define coutno cout<<"NO\n"
#define endl "\n"
#define hell 1000000007

using namespace std;

int M = 1000000;
int sieve[1000001];
 
 
void createSieve() {
    for (int i = 2; i <= M; i++) {
        sieve[i] = 1;
    }
    for (int i = 2; i * i <= M; i++) {
        if (sieve[i] == 1) {
            if (i == 2) {
                for (int j = i * i; j <= M; j += i) {
                    sieve[j] = 2;
                }
            }
            else {
                for (int j = i * i; j <= M; j += 2 * i) {
                    if (sieve[j] == 1) {
                        sieve[j] = i;
                    }
                }
            }
        }
    }
}

bool isPrime(ll n)
{
    if (n <= 1)
        return false;
    for (ll i = 2; i * i <= n; i++) 
    {
        if (n % i == 0)
            return false;
    }
    return true;
}

ll gcd(ll a, ll b)
{
    if (a == 0)
        return b;
    return gcd(b % a, a);
}

vector<ll> factors(ll n) {
    vector<ll> f;
    for (ll x = 2; x*x <= n; x++) {
        while (n%x == 0) {
            f.push_back(x);
            n /= x;
        }
    }
    if (n > 1) f.push_back(n);
    return f;
}

ll powe(ll a, ll n) {

    ll r = 1;
    while (n) {
        if (n % 2) {
            r = ((r % hell) * (a % hell)) % hell;
            n--;
        }
        else {
            a = ((a % hell) * (a % hell)) % hell;
            n = n / 2;
        }
    }
    return r;
}

ll dx[] = {0, 0, 1, -1};
ll dy[] = {1, -1, 0, 0};

ll dfs(ll i, ll j, vector<vector<ll>> &vi, ll n, ll m, vector<vector<ll>> & v) {
    ll ans = 0;
    if (!vi[i][j]) {
        vi[i][j] = 1;
        ans = v[i][j];
        for (int k = 0; k < 4; k++) {
            if (i + dx[k] >= 0 && i + dx[k] < n && j + dy[k] >= 0 && j + dy[k] < m && v[i + dx[k]][j + dy[k]] != 0 && vi[i + dx[k]][j + dy[k]] == 0) {
                ans += dfs(i + dx[k], j + dy[k], vi, n, m, v);
            }
        }
    }
    return ans;
}

const int N = 1e5+10;
vector<int>g[N];
bool vis[N];

void _dfs(int vertex){
    if(!vis[vertex]){
        vis[vertex]=true;
        for (int child: g[vertex])
        {
            if(!vis[child]) _dfs(child);
        }
    }
}

void solve()
{
    ll n;
    cin>>n;
    vector<string>v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    for(int i=1;i<n;i++){
        if(v[i]==v[i-1] && v[i]=="sweet"&& i!=n-1){
            cout<<"No\n";
            return;
        }
    }
    cout<<"Yes\n";
    return;
}

int main()
{
    fast_io;
    ll t;
    t=1;
    // cin>>t;
    while(t--)
        solve();
    return 0;
}

Submission Info

Judge Result