oj.uz

Submission #1091368

# Submission time Handle Problem Language Result Execution time Memory
1091368 2024-09-20T18:00:43 Z guymmk Bouquet (EGOI24_bouquet) C++14
8 / 100
 24 ms 8028 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("popcnt")

//#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define pii pair<int,int>
#define debug(...) printf(__VA_ARGS__)
//#define debug(...)
#define trace(x) cout<<#x<<"="<<x<<endl;
//#define trace(x)
#define vi vector<int>
#define popcnt(x) (int)__builtin_popcount(x)
#define vpii vector<pii >
#define vvi vector<vector<int> >
#define umap unordered_map
#define uset unordered_set
#define mk make_pair
#define pb push_back
#define pob pop_back
#define _ <<' '<<
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define read(x) for (auto& zu: (x)) cin >> zu;
#define write(x) for (auto& zu: (x))cout << zu<<' '; cout<<endl;
static inline void print(const int &x) {
    if (x > 9)print(x / 10);
    putchar('0' + x % 10);
}

#define F first
#define S second
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define mustawa ios::sync_with_stdio(false);cin.tie(nullptr);
#define mishari main
const int inf=1e9+7;
void fa(bool ok){ cout << (ok ? "YES": "NO") << endl;}
int pw(ll a, ll b, ll mod= 1e9 + 7){
    ll result = 1;
    while(b) {
        if(b&1) {
            result = (result*a)%mod;
        }
        a = (a * a) % mod;
        b>>=1;
    }
    return result;
}
inline void usaco(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}int gcd(int a,int b){
    if (b == 0)return a;
    return gcd(b, a % b);
}

int lcm(int a, int b){
    return (a / gcd(a, b)) * b;
}
//long double log(int base,int x){
//    return log2(x)/log(base);
//}
int log(int base,int x){
    return (int)(log2(x)/log(base));
}
void vod(){}
int sum(int l,int r){
    if(l>r)swap(l,r);
    int a=((l-1)*(l))/2;
    int b=(r*(r+1))/2;
    return b-a;
}
int L[(int)2e5+5],R[(int)(2e5+5)],dp[(int)2e5+5],n;
int r0(int i){
    if(i<0)return 0;
    if(dp[i]!=-1)return dp[i];
    return dp[i]=max(r0(i-1),r0(i-L[i]-1)+1);
}int f(int i){
    if(i<0)return 0;
    if(dp[i]!=-1)return dp[i];
    dp[i]=1;
    for(int j=0;j<i-L[i];j++){
        if(j+R[j]<i)dp[i]=max(dp[i],f(j)+1);
    }return dp[i];
}
void solve(){memset(dp,-1,sizeof dp);
    cin>>n;
    bool b=0;
    for(int i=0;i<n;i++){
        cin>>L[i]>>R[i];
        if(L[i]!=R[i])b=1;
        if(i&&L[i]!=L[i-1])b=1;
    }if(n<=1000){
        return cout<<f(n-1)<<endl,vod();
    }
    if(!b)return cout<<(n-1)/(L[0]+1)+1<<endl,vod();
    else {

        cout<<r0(n-1)<<endl;
    }
}
signed mishari() {
    mustawa;
    //usaco("nocross");
    int tescases = 1;
    //cin>>tescases;
    for (int i = 1; i <= tescases; i++) {
        //cout<<"Case "<<i<<":"<<endl;
        solve();
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 13 ms 2700 KB Output is correct
3 Correct 17 ms 2636 KB Output is correct
4 Correct 13 ms 2560 KB Output is correct
5 Correct 15 ms 2600 KB Output is correct
6 Correct 17 ms 2624 KB Output is correct
7 Correct 18 ms 2652 KB Output is correct
8 Correct 21 ms 2652 KB Output is correct
9 Correct 20 ms 2624 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 0 ms 1116 KB Output is correct

Subtask #2
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2652 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 18 ms 7772 KB Output is correct
5 Correct 18 ms 6492 KB Output is correct
6 Correct 17 ms 5724 KB Output is correct
7 Correct 17 ms 5208 KB Output is correct
8 Correct 18 ms 4956 KB Output is correct
9 Correct 18 ms 4188 KB Output is correct
10 Correct 16 ms 3928 KB Output is correct
11 Correct 16 ms 3164 KB Output is correct
12 Correct 15 ms 3164 KB Output is correct
13 Correct 16 ms 2904 KB Output is correct
14 Correct 15 ms 2908 KB Output is correct
15 Correct 17 ms 2800 KB Output is correct
16 Correct 16 ms 2744 KB Output is correct
17 Correct 16 ms 2648 KB Output is correct
18 Correct 20 ms 2644 KB Output is correct
19 Correct 17 ms 2652 KB Output is correct
20 Correct 16 ms 2748 KB Output is correct
21 Correct 16 ms 2652 KB Output is correct
22 Correct 18 ms 2864 KB Output is correct
23 Correct 22 ms 2652 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Incorrect 1 ms 1116 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Incorrect 1 ms 1116 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2756 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 18 ms 7884 KB Output is correct
4 Correct 24 ms 6548 KB Output is correct
5 Correct 18 ms 6624 KB Output is correct
6 Correct 19 ms 8028 KB Output is correct
7 Incorrect 18 ms 6460 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 13 ms 2700 KB Output is correct
3 Correct 17 ms 2636 KB Output is correct
4 Correct 13 ms 2560 KB Output is correct
5 Correct 15 ms 2600 KB Output is correct
6 Correct 17 ms 2624 KB Output is correct
7 Correct 18 ms 2652 KB Output is correct
8 Correct 21 ms 2652 KB Output is correct
9 Correct 20 ms 2624 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 0 ms 1116 KB Output is correct
16 Correct 13 ms 2652 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 18 ms 7772 KB Output is correct
20 Correct 18 ms 6492 KB Output is correct
21 Correct 17 ms 5724 KB Output is correct
22 Correct 17 ms 5208 KB Output is correct
23 Correct 18 ms 4956 KB Output is correct
24 Correct 18 ms 4188 KB Output is correct
25 Correct 16 ms 3928 KB Output is correct
26 Correct 16 ms 3164 KB Output is correct
27 Correct 15 ms 3164 KB Output is correct
28 Correct 16 ms 2904 KB Output is correct
29 Correct 15 ms 2908 KB Output is correct
30 Correct 17 ms 2800 KB Output is correct
31 Correct 16 ms 2744 KB Output is correct
32 Correct 16 ms 2648 KB Output is correct
33 Correct 20 ms 2644 KB Output is correct
34 Correct 17 ms 2652 KB Output is correct
35 Correct 16 ms 2748 KB Output is correct
36 Correct 16 ms 2652 KB Output is correct
37 Correct 18 ms 2864 KB Output is correct
38 Correct 22 ms 2652 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 1 ms 1116 KB Output is correct
43 Incorrect 1 ms 1116 KB Output isn't correct
44 Halted 0 ms 0 KB -