oj.uz

답안 #884983

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884983 2023-12-08T18:46:57 Z Nelt Matryoshka (JOI16_matryoshka) C++17
0 / 100
 0 ms 348 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 S second
#define F first
#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 ANDROID                   \
    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 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, q;
    cin >> n >> q;
    pp(ll, ll) a[n];
    for (ll i = 0; i < n; i++)
        cin >> a[i].F >> a[i].S;
    sort(all(a), [](pp(ll, ll) a, pp(ll, ll) b)
    {
        return a.S == b.S ? a.F > b.F : a.S < b.S;
    });
    pp(pp(ll, ll), ll) qs[q];
    ll ans[q];
    for (ll i = 0; i < q; i++)
        cin >> qs[i].F.F >> qs[i].F.S, qs[i].S = i;
    sort(all(qs), [](pp(pp(ll, ll), ll) a, pp(pp(ll, ll), ll) b)
    {
        return a.F.S < b.F.S;
    });
    ll ptr = 0;
    vv(ll) v;
    for (ll i = 0, pos; i < q; i++)
    {
        while (ptr < n and a[ptr].S <= qs[i].F.S)
        {
            pos = lower_bound(allc(v), a[ptr].S, greater()) - v.begin();
            if (pos == v.size())
                v.pb(0);
            v[pos] = a[ptr++].F;
        }
        ans[qs[i].S] = lower_bound(allc(v), qs[i].F.F, greater()) - v.begin();
    }
    for (ll i : ans)
        cout << i << endl;
}
/*

*/
int main()
{
    ANDROID
    // 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";
}

Compilation message

matryoshka.cpp: In function 'void solve()':
matryoshka.cpp:71:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             if (pos == v.size())
      |                 ~~~~^~~~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -