Submission #51051

#	Time	Username	Problem	Language	Result	Execution time	Memory
51051		SpaimaCarpatilor	Matryoshka (JOI16_matryoshka)	C++17	51 / 100	2054 ms	1948 KiB

matryoshka

#include<bits/stdc++.h>

using namespace std;

int nr, N, Q, h[100009];
pair < int, int > v[100009];

int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d %d", &N, &Q);
for (int i=1; i<=N; i++)
    scanf ("%d %d", &v[i].first, &v[i].second), v[i].second = -v[i].second;
sort (v + 1, v + N + 1);
for (int i=1; i<=N; i++)
    v[i].second = -v[i].second;
while (Q --)
{
    int X, Y;
    scanf ("%d %d", &X, &Y), nr = 0;
    for (int i=1; i<=N; i++)
        if (v[i].first >= X && v[i].second <= Y)
            h[++nr] = v[i].second;
    multiset < int > S;
    for (int i=1; i<=nr; i++)
    {
        auto it = S.lower_bound (h[i]);
        if (it == S.begin ()) S.insert (h[i]);
        else
        {
            it --;
            S.erase (it), S.insert (h[i]);
        }
    }
    printf ("%d\n", S.size ());
}
return 0;
}

Compilation message (stderr)

matryoshka.cpp: In function 'int main()':
matryoshka.cpp:37:30: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::multiset<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf ("%d\n", S.size ());
                     ~~~~~~~~~^
matryoshka.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 scanf ("%d %d", &N, &Q);
 ~~~~~~^~~~~~~~~~~~~~~~~
matryoshka.cpp:15:47: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d", &v[i].first, &v[i].second), v[i].second = -v[i].second;
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
matryoshka.cpp:22:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d", &X, &Y), nr = 0;
     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

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