Submission #935229

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
935229	2024-02-28 22:19:52	asdasdqwer	Matryoshka (JOI16_matryoshka)	C++14	100 / 100	436 ms	27520 KiB

matryoshka

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define pii array<int,2>
signed main() {
    int n,q;cin>>n>>q;
    vector<pii> dolls(n);
    for (auto &x:dolls) {
        cin>>x[0]>>x[1];
    }
    sort(dolls.begin(), dolls.end(), [](const pii &x, const pii &y) {
        if (x[0] != y[0]) return x[0] > y[0];
        return x[1] < y[1];
    });
    vector<pii> quer(q);
    for (auto &x:quer)cin>>x[0]>>x[1];
    vector<pii> srtQuer = quer;
    sort(srtQuer.begin(), srtQuer.end(), [](const pii &x, const pii &y) {
        if (x[0] != y[0]) return x[0] < y[0];
        return x[1] < y[1];
    });
    map<pii,int> ans;
    while (srtQuer.size() && srtQuer.back()[0] > dolls[0][0]) {
        ans[srtQuer.back()] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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