제출 #1306761

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

Main

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=998244353;
const int inf = 2e14;
const int LOG=18;
const int N=3e3+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
int ans[N][N];
void solve(){
    cin >> n >> k >> q;
    vector<int>a(n+1);
    for (int i=1;i<=n;i++){
        cin >> a[i];
    }
    for (int i=1;i<=n;i++){
        ans[i][i]=1;
        map<pair<int,int>,int>d;
        for (int j=i+1;j<=n;j++){
            if (!ans[i][j-1] or a[j]==a[j-1])break;
            if (!d[{a[j-1],a[j]}]){
                ans[i][j]=1;
                d[{a[j-1],a[j]}]=j%2+1;
                d[{a[j],a[j-1]}]=(j+1)%2+1;
            }
            else if(d[{a[j-1],a[j]}]==j%2+1){
                ans[i][j]=1;
            }
        }
    }
    for (int i=1;i<=q;i++){
        cin >> x >> y;
        cout << (ans[x][y] ? "YES" : "NO") << endl;
    }


}
signed main()    
{   

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
}

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