제출 #753706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
753706		epicci23	Alternating Heights (CCO22_day1problem1)	C++17	25 / 25	337 ms	13896 KiB

Main

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


vector<int> v[3003];
int col[3003];
bool ok=0;
int ar[3003];

void dfs(int c)
{
  if(ok) return;
  if(col[c]==1) {ok=1;return;}
  if(col[c]==2) return;
  col[c]=1;
  for(int x:v[c]) dfs(x);
  col[c]=2;
}

bool check(int l,int r)
{
  ok=0;
  for(int i=0;i<=3000;i++)
  {
    v[i].clear();
    col[i]=0;
  }

  for(int i=l;i<r;i++)
  {
    if((i-l)&1) v[ar[i+1]].pb(ar[i]);
    else v[ar[i]].pb(ar[i+1]);
  }
  
  for(int i=1;i<=3000;i++) dfs(i);
  return ok;
}


void solve()
{
  int n=in(),k=in(),q=in();
  
  for(int i=1;i<=n;i++) ar[i]=in();
  ar[n+1]=0;
  int xd[n+2];
  
  int p=1;

  for(int i=1;i<=n;i++)
  {
    while(p<=n && !check(i,p)) p++;
    xd[i]=p;
  }

  for(int i=1;i<=q;i++)
  {
    int u=in(),r=in();
    if(xd[u]<=r) cout << "NO\n";
    else cout << "YES\n";
  }
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      | 
Main.cpp: In function 'void solve()':
Main.cpp:95:14: warning: unused variable 'k' [-Wunused-variable]
   95 |   int n=in(),k=in(),q=in();
      |              ^

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