Submission #798480

#	Time	Username	Problem	Language	Result	Execution time	Memory
798480		PanosPask	Matryoshka (JOI16_matryoshka)	C++14	0 / 100	0 ms	212 KiB

matryoshka

#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9 + 1;

typedef pair<int, int> pi;

struct Doll {
    int diameter;
    int height;
};
bool operator < (const Doll& a, const Doll& b)
{
    if (a.height == b.height)
        return a.diameter > b.diameter;
    return a.height < b.height;
}

int N, Q;
vector<Doll> dolls;
vector<pair<pi, int>> queries;
// dp[i]: Maximum diameter of matryoshka doll at each time step
vector<int> dp;
vector<int> ans;

bool gcomp(const int& a, const int& b)
{
    return a > b;
}

int main(void)
{
    scanf("%d %d", &N, &Q);

    dolls.resize(N);
    queries.resize(Q);
    ans.resize(Q);
    dp.resize(N + 1, 0);
    for (int i = 0; i < N; i++) {
        scanf("%d %d", &dolls[i].diameter, &dolls[i].height);
    }
    for (int i = 0; i < Q; i++) {
        scanf("%d %d", &queries[i].first.first, &queries[i].first.second);
        queries[i].second = i;
    }

    sort(dolls.begin(), dolls.end());
    sort(queries.begin(), queries.end(), [] (pair<pi, int> a, pair<pi, int> b) {return a.first.second < b.first.second;});

    int reached = 0;
    dp[0] = INF;
    int cur_query = 0;
    for (int i = 0; i < N; i++) {
        while (cur_query < Q && queries[cur_query].first.second < dolls[i].height) {
            // Process the queries
            // Only take dolls with diameter as required
            int res = upper_bound(dp.begin(), dp.end(), queries[cur_query].first.first, gcomp) - dp.begin();

            // All dolls at position res and above have diameter smaller than required            queries[cur_]

            ans[queries[cur_query].second] = res - 1;

            cur_query++;
        }


        /* A pair of dolls (i, j) after sorting do NOT fit inside one another iff
         * i < j => diameter(i) >= diameter(j)
         */

        int pos = upper_bound(dp.begin(), dp.end(), dolls[i].diameter, gcomp) - dp.begin();
        dp[pos] = dolls[i].diameter;
        reached = max(reached, pos);
    }

    for (int i = 0; i < Q; i++)
        printf("%d\n", ans[i]);

    return 0;
}

Compilation message (stderr)

matryoshka.cpp: In function 'int main()':
matryoshka.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     scanf("%d %d", &N, &Q);
      |     ~~~~~^~~~~~~~~~~~~~~~~
matryoshka.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         scanf("%d %d", &dolls[i].diameter, &dolls[i].height);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
matryoshka.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf("%d %d", &queries[i].first.first, &queries[i].first.second);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 15
• Subtask 3: 0 / 25
• Subtask 4: 0 / 49