fork download 
  1.     #include <bits/stdc++.h>
  2.     #include <chrono>
  3.     using namespace std;
  4.     using namespace chrono;
  5.     // "AJEET JAIN"----"JAI JINENDRA"  
  6.     /* "णमो अरिहंताणं",
  7.         "णमो सिद्धाणं",
  8.         "णमो आयरियाणं",
  9.         "णमो उवज्झायाणं",
  10.         "णमो लोए सव्वसाहूणं",
  11.         "",
  12.         "एसो पंच नमोक्कारो, सव्व पावप्पणासणो",
  13.         "मंगलाणं च सव्वेसिं, पडमं हवै मंगलं",   */
  14.  
  15.  
  16.     // Aliases to op
  17.     using ll = long long;
  18.     using ull = unsigned long long;
  19.     using ld = double;
  20.     using vll = vector<ll>;
  21.  
  22.  
  23.     // Constants
  24.     constexpr ll INF = 4e18;
  25.     constexpr ld EPS = 1e-9;
  26.     constexpr ll MOD = 1e9 + 7;
  27.  
  28.  
  29.  
  30.     // Macros
  31.     #define F first
  32.     #define S second
  33.     #define all(x) begin(x), end(x)
  34.     #define allr(x) rbegin(x), rend(x)
  35.     #define py cout<<"YES\n";
  36.     #define pn cout<<"NO\n";
  37.     #define forn(i,n) for(int i=0;i<n;i++)
  38.     #define for1(i,n) for(int i=1;i<=n;i++)
  39.  
  40.     // #define insert push_back
  41.     #define pb push_back
  42.     #define MP make_pair
  43.     #define endl '\n'
  44.  
  45.     /*
  46.       remove substring or subarray ---> try to think about sliding w
  47.     
  48.     */                  
  49.  
  50.      /*
  51.       
  52.      Golden Rule
  53.  
  54.      1) problem is easy
  55.      2) proofs is easy
  56.      3) implementation is easy
  57.      
  58.      /*
  59.          ROUGH --
  60.  
  61.          // 1 2 3 4 2 3
  62.          1->1
  63.          2->2 , 5
  64.          3->3 , 6
  65.          4->4
  66.  
  67.          input(b[i]);
  68.          vector<vector<int>>v;
  69.          for1(i , n){ 
  70.             v[b[i]].push_back(i);
  71.          }
  72.  
  73.          for1(i , n){
  74.             
  75.             if(v[b[i]].size() >= 2){
  76.               for(int j = 1 ; j < v[b[i]].size() ; j++){
  77.                   if(v[b[i]][j - 1] - v[b[i]][j - 1] <= k){
  78.                       py;
  79.                   }
  80.               }
  81.             }
  82.  
  83.          }
  84.                  
  85.      */
  86.  
  87.     void AJNJ(){
  88.        ll n,k;
  89.        cin>>n>>k;
  90.  
  91.        ll b[n + 1];
  92.        for1(i , n){
  93.           cin >> b[i];
  94.        }
  95.        vector<vector<int>>v(n + 1);
  96.          for1(i , n){ 
  97.             v[b[i]].push_back(i);
  98.          }
  99.  
  100.          for1(i , n){
  101.  
  102.             if(v[b[i]].size() >= 2){
  103.               for(int j = 1 ; j < v[b[i]].size() ; j++){
  104.                   if((v[b[i]][j - 1] - v[b[i]][j - 1]) <= k){
  105.                       py
  106.                       return;
  107.                   }
  108.               }
  109.             }
  110.         }
  111.  
  112.         pn
  113.  
  114.  
  115.     }
  116.  
  117.  
  118.     int main(){
  119.         ios::sync_with_stdio(0);
  120.         cin.tie(0);
  121.         cout.tie(0);
  122.         int T = 1;
  123.         cin>>T;
  124.         auto start1 = high_resolution_clock::now();
  125.         while(T--){
  126.             AJNJ();
  127.         }
  128.         auto stop1 = high_resolution_clock::now();
  129.         auto duration = duration_cast<microseconds>(stop1 - start1);
  130.         cerr << "Time: " << duration . count() / 1000 << " ms" << endl;
  131.  
  132.         return 0;
  133.     }
Success #stdin #stdout #stderr 0.01s 5288KB
comments (?)
stdin 
Standard input is empty
stdout 
NO
stderr 
Time: 0 ms
https://ideone.com/R25CQE
language:
C++14 (clang 8.0)
created:
4 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!