fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define endl '\n'
  4. #define int long long
  5. const int MOD = pow(10,9)+7;
  6. const int MOD2 = 998244353;
  7. const int INF = LLONG_MAX/2;
  8.  
  9. int primes[1000000];
  10.  
  11. void seive(){
  12.     fill(primes, primes + 1000000, 1);
  13.     primes[0] = primes[1] = 0;
  14.     for(int i = 2 ; i*i < 1000000 ; i++){
  15.         if(primes[i]){
  16.             for(int j = i*i ; j < 1000000 ; j += i){
  17.                 primes[j] = 0;
  18.             }
  19.         }
  20.     }
  21.     for(int i = 1 ; i < 1000000 ; i++){
  22.         primes[i] += primes[i-1];
  23.     }
  24. }
  25. int factorial(int n){
  26.     if(n==0){
  27.         return 1;
  28.     }
  29.     return (n*(factorial(n-1)))%MOD;
  30. }
  31. bool isPrime(int n){
  32.     if(n <= 1) return false;
  33.     for(int i = 2 ; i*i <= n ; i++){
  34.         if(n % i == 0) return false;
  35.     }
  36.     return true;
  37. }
  38.  
  39. int power(int a, int b){
  40.     if(b == 0) return 1;
  41.     a %= MOD;
  42.     int value = power(a, b / 2);
  43.     if(b % 2 == 0){
  44.         return (value * value) % MOD;
  45.     } else {
  46.         return ((value * value) % MOD * (a % MOD)) % MOD;
  47.     }
  48. }
  49.  
  50. int gcd(int a, int b){
  51.     if(a == 0) return b;
  52.     return gcd(b % a, a);
  53. }
  54. void solve() {
  55.         int n,target;
  56. 	    cin>>n>>target;
  57. 	    int nums[n];
  58. 	    for(int i = 0 ; i<n ; i++){
  59. 	    	cin>>nums[i];
  60. 	    }
  61. 	    int p = -1,q=-1;
  62.         if(n==0){
  63.             cout<<p<<" "<<q<<endl;
  64.         }
  65.         else{
  66.         int l = 0 , r = n-1;
  67.         while(l<=r){
  68.             int mid = l+((r-l)/2);
  69.             if(nums[mid]<target){
  70.                 l = mid+1;
  71.             }
  72.             else{
  73.                 r = mid-1;
  74.             }
  75.         }
  76.         if(l<n && nums[l]==target){
  77.            p = l;
  78.         }
  79.         l = 0,r=n-1;
  80.         while(l<=r){
  81.             int mid = l+((r-l)/2);
  82.             if(nums[mid]<=target){
  83.                 l = mid+1;
  84.             }
  85.             else{
  86.                 r = mid-1;
  87.             }
  88.         }
  89.          if(r>=0 && r<n && nums[r]==target){
  90.            q = r;
  91.          }
  92.         cout<<p<<" "<<q<<endl;
  93.         }
  94. }
  95.  
  96. signed main(){
  97.     ios::sync_with_stdio(false); cin.tie(NULL);
  98.     int t;
  99.     cin >> t;
  100.     while(t--){
  101.         solve();
  102.     }
  103.     return 0;
  104. }
  105.  
  106.  
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
3
6 8
5 7 7 8 8 10
6 6
5 7 7 8 8 10
0 0
stdout
copy 
3 4
-1 -1
-1 -1
https://ideone.com/qDaODg
language:
C++14 (gcc 8.3)
created:
1 day 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!