oj.uz

답안 #894377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894377 2023-12-28T07:37:06 Z vjudge1 Index (COCI21_index) C++17
20 / 110
 2500 ms 1100 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define russian setlocale(LC_ALL,"Russian_Russia.20866");
#define file freopen("condense2.in", "r", stdin), freopen("condense2.out", "w", stdout);
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pli pair<ll, int>
#define all(s) s.begin(), s.end()
#define pb push_back
#define ins insert
#define mp make_pair
#define sz(x) x.size()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define mem(x) memset(x, 0, sizeof(x))

const ll N = 200010;
const ll M = 1e9 + 7;
const ll block = 316;
const ll mod = 1e9 + 7;
const ll P = 263;
const ld pi = acos(-1);
const ll inf = 9e18;

ll add(ll a, ll b) {
    if(a + b < 0) return a + b + mod;
    if(a + b >= mod) return a + b - mod;
    return a + b;
}

ll sub(ll a, ll b) {
    return (a - b + mod) % mod;
}

ll mul(ll a, ll b) {
    return a * b % mod;
}

ll binpow(ll a, ll n) {
    ll res = 1;
    while(n) {
        if(n & 1) res = mul(res, a);
        a = mul(a, a);
        n >>= 1;
    }
    return res;
}

ll inv(ll x) {
    return binpow(x, mod - 2);
}
ll n, q;
ll p[N];
void solve() {
    cin >> n >> q;
    for(ll i = 1; i <= n; i++) cin >> p[i];
    while(q--) {
        ll l, r;
        cin >> l >> r;
        ll lo = 0, hi = N + 10;
        while(hi > lo + 1) {
            ll mid = (lo + hi) / 2;
            ll cnt = 0;
            for(ll i = l; i <= r; i++) {
                if(p[i] >= mid) cnt++;
            }
            if(cnt >= mid) lo = mid;
            else hi = mid;
        }
        cout << lo << '\n';
    }
}
signed main() {
    speed;
    //file;
    int test = 1;
    //cin >> test;
    while(test--) {
        solve();
    }
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 348 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 348 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 480 KB Output is correct
6 Correct 10 ms 348 KB Output is correct
7 Correct 10 ms 348 KB Output is correct
8 Correct 10 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 11 ms 344 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 348 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 348 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 480 KB Output is correct
6 Correct 10 ms 348 KB Output is correct
7 Correct 10 ms 348 KB Output is correct
8 Correct 10 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 11 ms 344 KB Output is correct
11 Execution timed out 2543 ms 1100 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 348 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 348 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 480 KB Output is correct
6 Correct 10 ms 348 KB Output is correct
7 Correct 10 ms 348 KB Output is correct
8 Correct 10 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 11 ms 344 KB Output is correct
11 Execution timed out 2543 ms 1100 KB Time limit exceeded
12 Halted 0 ms 0 KB -