oj.uz

Submission #100538

# Submission time Handle Problem Language Result Execution time Memory
100538 2019-03-12T06:22:34 Z TAISA_ None (JOI16_matryoshka) C++14
51 / 100
 71 ms 632 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define all(vec) vec.begin(),vec.end()
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
const ll INF=1LL<<30;
const ll LINF=1LL<<60;
const double eps=1e-9;
const ll MOD=1000000007LL;
template<typename T>void chmin(T &a,T b){a=min(a,b);};
template<typename T>void chmax(T &a,T b){a=max(a,b);};
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V>typename enable_if<is_class<T>::value==0>::type fill_v(T& t,const V& v){t=v;}
template<typename T,typename V>typename enable_if<is_class<T>::value!=0>::type fill_v(T& t,const V& v){for(auto &e:t)fill_v(e,v);};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
    int n,q;cin>>n>>q;if(q>2000||n>2000)return 0;
    vector<P> v(n);
    for(int i=0;i<n;i++){
        cin>>v[i].first>>v[i].second;
        v[i].second*=-1LL;
    }
    sort(all(v));
    reverse(all(v));
    for(int i=0;i<n;i++)v[i].second*=-1LL;
    while(q--){
        ll a,b;cin>>a>>b;
        vector<ll> dp(n+10,LINF);
        for(int i=0;i<n;i++){
            if(v[i].first<a||v[i].second>b)continue;
            *(upper_bound(all(dp),v[i].second))=v[i].second;
        }
        int ans=lower_bound(all(dp),LINF)-dp.begin();
        cout<<ans<<endl;
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 404 KB Output is correct
22 Correct 15 ms 384 KB Output is correct
23 Correct 53 ms 512 KB Output is correct
24 Correct 26 ms 384 KB Output is correct
25 Correct 59 ms 512 KB Output is correct
26 Correct 27 ms 384 KB Output is correct
27 Correct 26 ms 512 KB Output is correct
28 Correct 61 ms 632 KB Output is correct
29 Correct 52 ms 384 KB Output is correct
30 Correct 42 ms 384 KB Output is correct
31 Correct 54 ms 504 KB Output is correct
32 Correct 71 ms 488 KB Output is correct
33 Correct 50 ms 504 KB Output is correct
34 Correct 50 ms 512 KB Output is correct
35 Correct 58 ms 512 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 404 KB Output is correct
22 Correct 15 ms 384 KB Output is correct
23 Correct 53 ms 512 KB Output is correct
24 Correct 26 ms 384 KB Output is correct
25 Correct 59 ms 512 KB Output is correct
26 Correct 27 ms 384 KB Output is correct
27 Correct 26 ms 512 KB Output is correct
28 Correct 61 ms 632 KB Output is correct
29 Correct 52 ms 384 KB Output is correct
30 Correct 42 ms 384 KB Output is correct
31 Correct 54 ms 504 KB Output is correct
32 Correct 71 ms 488 KB Output is correct
33 Correct 50 ms 504 KB Output is correct
34 Correct 50 ms 512 KB Output is correct
35 Correct 58 ms 512 KB Output is correct
36 Incorrect 2 ms 384 KB Output isn't correct
37 Halted 0 ms 0 KB -