oj.uz

Submission #1108387

# Submission time Handle Problem Language Result Execution time Memory
1108387 2024-11-04T03:24:56 Z koukirocks Global Warming (CEOI18_glo) C++17
17 / 100
 38 ms 4808 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("popcnt")
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=2e5+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
const ldb eps=1e-6;
const ldb PI=acos(-1.0);
const int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
template<typename T>
using vvector = vector<vector<T>>;

map<pii,vector<int>> dp;
void f(int n,int mx) {
    if (dp.find({n,mx})!=dp.end()) return;
    vector<int> &now = dp[{n,mx}];
    now={};
    for (int i=2;i<=min(mx,(int)sqrt(n));i++) {
        if (n%i==0) {
            f(n/i,i);
            for (int j:dp[{n/i,i}]) now.push_back(j+i-1);
            if (i*i!=n) {
                int ni=n/i;
                if (ni>mx) continue;
                f(n/ni,ni);
                for (int j:dp[{n/ni,ni}]) now.push_back(j+ni-1);
            }
        }
    }
    if (n<=mx) now.push_back(n-1);
    sort(all(now));
    now.resize(unique(all(now))-now.begin());
    // cout<<n<<" "<<mx<<" n mx\n";
    // for (int i:now) cout<<i<<" ";
    // cout<<"\n";
}

int main() {
    speed;
    int n,x;
    cin>>n>>x;
    vector<int> a(n+1);
    vector<int> dp(n+1);
    for (int i=1;i<=n;i++) {
        cin>>a[i];
    }
    vector<int> curr;
    for (int i=1;i<=n;i++) {
        if (curr.empty() or curr.back()<a[i]) {
            curr.push_back(a[i]);
        } else {
            auto it = lower_bound(all(curr),a[i]);
            *it = a[i];
        }
        dp[i]=curr.size();
        // cout<<dp[i]<<" ";
    }
    // cout<<"dp\n";
    curr.clear();
    vector<int> dp2(n+1);
    for (int i=n;i>=1;i--) {
        if (curr.empty() or curr.back()>a[i]-x) dp2[i]=curr.size()+1;
        else dp2[i]=curr.size();
        if (curr.empty() or curr.back()>a[i]) curr.push_back(a[i]);
        else {
            int l=0,r=curr.size()-1;
            while (l<r) {
                int mid=l+r>>1;
                if (curr[mid]<=a[i]) r=mid;
                else l=mid+1;
            }
            curr[l]=a[i];
        }
        // cout<<dp2[i]<<" ";
    }
    // cout<<"dp2\n";
    int ans=0;
    for (int i=1;i<=n;i++) {
        ans=max(ans,dp[i]+dp2[i]-1);
    }
    cout<<ans<<"\n";
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:81:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   81 |                 int mid=l+r>>1;
      |                         ~^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 4688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2464 KB Output is correct
2 Correct 20 ms 2384 KB Output is correct
3 Correct 37 ms 4732 KB Output is correct
4 Correct 19 ms 4304 KB Output is correct
5 Correct 9 ms 2516 KB Output is correct
6 Correct 14 ms 4304 KB Output is correct
7 Correct 18 ms 4808 KB Output is correct
8 Correct 14 ms 2480 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Halted 0 ms 0 KB -