제출 #1306772

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306772		hssaan_arif	Alternating Heights (CCO22_day1problem1)	C++20	4 / 25	129 ms	4556 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define endl "\n"
#define pb push_back
#define int long long
#define fi first
#define se second

const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;

int n , A[N] , k , q , l , r , lp[N];
map<pair<int,int> , int> mp , ch , pr;

void solve(){
    cin >> n >> k >> q;

    for (int i=1 ; i<=n ; i++){
        cin >> A[i];
    }

    for (int i=1 ; i<n ; i++){
        if (A[i] == A[i+1]){
            lp[i] = lp[i-1] + 1;
        }else{
            lp[i] = lp[i-1];
        }
    }

    while(q--){
        cin >> l >> r;

        if (lp[r-1] - lp[l-1]){
            cout << "NO" << endl;
        }else{
            cout << "YES" << endl;
        }
    }

}

signed main(){
    // freopen("" , "r" , stdin);
    // freopen("" , "w" , stdout);
    // cout << setprecision(30);
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int ts = 1;
    // cin >> ts;
    while(ts--){
        solve();
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 8