답안 #784771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
784771	2023-07-16T13:49:10 Z	bachhoangxuan	Matryoshka (JOI16_matryoshka)	C++17	100 / 100	180 ms	20032 KB

matryoshka

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
bool cmp(tuple<int,int,int> a,tuple<int,int,int> b){
    if(get<0>(a)!=get<0>(b)) return get<0>(a)<get<0>(b);
    else return get<1>(a)>get<1>(b);
}
void solve(){
    int n,q;cin >> n >> q;
    vector<tuple<int,int,int>> que;
    for(int i=0;i<n;i++){
        int r,h;cin >> r >> h;
        que.emplace_back(h,r,-1);
    }
    vector<int> ans(q);
    for(int i=0;i<q;i++){
        int a,b;cin >> a >> b;
        que.emplace_back(b,-i,a);
    }
    sort(que.begin(),que.end(),cmp);
    deque<int> v;
    for(auto &[x,val,y]:que){
        if(val<=0) ans[-val]=(int)v.size()-(lower_bound(v.begin(),v.end(),y)-v.begin());
        else{
            int pos=lower_bound(v.begin(),v.end(),val)-v.begin();
            if(pos) v[pos-1]=val;
            else v.push_front(val);
        }
    }
    for(int i=0;i<q;i++) cout << ans[i] << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	320 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	324 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	320 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	324 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	320 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	324 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	552 KB	Output is correct
24	Correct	2 ms	596 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 ms	468 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	2 ms	436 KB	Output is correct
31	Correct	2 ms	596 KB	Output is correct
32	Correct	2 ms	596 KB	Output is correct
33	Correct	2 ms	592 KB	Output is correct
34	Correct	2 ms	600 KB	Output is correct
35	Correct	2 ms	596 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	320 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	324 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	552 KB	Output is correct
24	Correct	2 ms	596 KB	Output is correct
25	Correct	2 ms	596 KB	Output is correct
26	Correct	2 ms	468 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	2 ms	436 KB	Output is correct
31	Correct	2 ms	596 KB	Output is correct
32	Correct	2 ms	596 KB	Output is correct
33	Correct	2 ms	592 KB	Output is correct
34	Correct	2 ms	600 KB	Output is correct
35	Correct	2 ms	596 KB	Output is correct
36	Correct	163 ms	17764 KB	Output is correct
37	Correct	156 ms	17276 KB	Output is correct
38	Correct	51 ms	9144 KB	Output is correct
39	Correct	131 ms	16308 KB	Output is correct
40	Correct	180 ms	16308 KB	Output is correct
41	Correct	153 ms	17200 KB	Output is correct
42	Correct	141 ms	15468 KB	Output is correct
43	Correct	86 ms	15796 KB	Output is correct
44	Correct	162 ms	19676 KB	Output is correct
45	Correct	167 ms	19776 KB	Output is correct
46	Correct	167 ms	19656 KB	Output is correct
47	Correct	170 ms	19376 KB	Output is correct
48	Correct	162 ms	20032 KB	Output is correct
49	Correct	156 ms	19416 KB	Output is correct
50	Correct	173 ms	19988 KB	Output is correct

답안 #784771

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 15.0 / 15.0

Subtask #3 25.0 / 25.0

Subtask #4 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
15.0 / 15.0

Subtask #3
25.0 / 25.0

Subtask #4
49.0 / 49.0