oj.uz

Submission #715184

# Submission time Handle Problem Language Result Execution time Memory
715184 2023-03-26T07:32:02 Z Nelt Examination (JOI19_examination) C++17
2 / 100
 37 ms 17356 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll MAX = 1e5 + 5;
vv(ll) st[MAX << 1];
void build()
{
    for (ll i = MAX; i < (MAX << 1); i++)
        sort(allc(st[i]));
    for (ll i = MAX - 1; i >= 1; i--)
        merge(allc(st[i << 1]), allc(st[i << 1 | 1]), st[i].begin());
}
ll query(ll l, ll r, ll v)
{
    ll ans = 0;
    for (l += MAX, r += MAX + 1; l < r; l >>= 1, r >>= 1)
    {
        if (l & 1)
            ans += st[l].size() - (lower_bound(allc(st[l]), v) - st[l].begin()), l++;
        if (r & 1)
            r--, ans += st[r].size() - (lower_bound(allc(st[r]), v) - st[r].begin());
    }
    return ans;
}
void solve()
{
    ll n, q;
    cin >> n >> q;
    pp(ll, ll) x[n];
    for (auto &i : x)
        cin >> i.F >> i.S;
    sort(all(x));
    if (n <= 3000 and q <= 3000)
    {
        while (q--)
        {
            ll a, b, c;
            cin >> a >> b >> c;
            ll ans = 0;
            for (ll i = 0; i < n; i++)
                ans += x[i].F >= a and x[i].S >= b and x[i].F + x[i].S >= c;
            cout << ans << endl;
        }
    }
    else
    {
        for (auto i : x)
            st[i.F + MAX].pb(i.S);
        build();
        while (q--)
        {
            ll a, b, c;
            cin >> a >> b >> c;
            cout << query(a, MAX - 1, b) << endl;
        }
    }
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case " << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 12 ms 5076 KB Output is correct
8 Correct 13 ms 5072 KB Output is correct
9 Correct 17 ms 5072 KB Output is correct
10 Correct 12 ms 5076 KB Output is correct
11 Correct 13 ms 5072 KB Output is correct
12 Correct 12 ms 5068 KB Output is correct
13 Correct 12 ms 5084 KB Output is correct
14 Correct 16 ms 5076 KB Output is correct
15 Correct 14 ms 5076 KB Output is correct
16 Correct 13 ms 5076 KB Output is correct
17 Correct 13 ms 5068 KB Output is correct
18 Correct 12 ms 5068 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 37 ms 17356 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 37 ms 17356 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 12 ms 5076 KB Output is correct
8 Correct 13 ms 5072 KB Output is correct
9 Correct 17 ms 5072 KB Output is correct
10 Correct 12 ms 5076 KB Output is correct
11 Correct 13 ms 5072 KB Output is correct
12 Correct 12 ms 5068 KB Output is correct
13 Correct 12 ms 5084 KB Output is correct
14 Correct 16 ms 5076 KB Output is correct
15 Correct 14 ms 5076 KB Output is correct
16 Correct 13 ms 5076 KB Output is correct
17 Correct 13 ms 5068 KB Output is correct
18 Correct 12 ms 5068 KB Output is correct
19 Runtime error 37 ms 17356 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -