Ideone.com

fork download

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Samurai ios_base::sync_with_stdio(false), cout.tie(NULL), cin.tie(NULL);
#define pr_g priority_queue<pair<ll,int>, vector<pair<ll,int>>,greater<pair<ll,int>>>
int dx [] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy [] = {-1, 1, 0, 0, -1, 1, 1, -1};
char dir [] = {'>', '<', '^', 'v'};
int Lx[] = {2, 2, -2, -2, 1, 1, -1, -1};
int Ly[] = {1, -1, 1, -1, 2, -2, 2, -2};
const double PI = acos(-1.0);
#define el '\n'
const ll mod = 1e9, N = 2e5 + 5, OO = 0x3f3f3f3f;
 
 
 
void solve() {
    int n, q; cin >> n >> q;
    vector<int>v(n);
    for (auto &i : v) cin >> i;
 
    while (q--) {
        int t; cin >> t;
        int l = lower_bound(v.begin(), v.end(), t) - v.begin();
        if (l == n || v[l] != t) {
            cout << "-1 -1\n";
        } else {
            int r = lower_bound(v.begin(), v.end(), t + 1) - v.begin();
            cout << l + 1 << ' ' << r << el;
        }
    }
}
 
int main() { Samurai
    int _t = 1; //cin >> _t;
    for (int i = 1; i <= _t; i++){
        solve();
    }
    return 0;
}

Success #stdin #stdout 0.01s 5320KB

stdin

Standard input is empty

stdout

Discover > Sphere Engine API

Discover > IDE Widget

Discover > Sphere Engine API

Discover > IDE Widget

Choose your language