oj.uz

Submission #940881

# Submission time Handle Problem Language Result Execution time Memory
940881 2024-03-07T22:05:42 Z vjudge1 Global Warming (CEOI18_glo) C++17
10 / 100
 27 ms 4580 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll ;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define pb push_back
#define FOR(i,a,b) for(int i = (a); i <= (b) ; i++)
#define FORD(i,a,b) for(int i = (a) ; i>= (b) ; i--)
#define TASK "test"
#define TASK1 "gues"
#define eb emplace_back
#define ed "\n"
#define ALL(v) v.begin(),v.end()
#define fi first
#define se second
#define BIT(i,x) (((x) >> (i))&1)
const int maxn = 4e5 + 5 , mod = 1e9+7;
const int d4x[4] = {-1, 0, 1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int d8x[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int d8y[8] = {0, 1, 1, 1, 0, -1, -1, -1};

int n,x,a[maxn],dp[maxn];

void read(){
    cin>>n>>x;
    FOR(i,1,n) cin>>a[i];
}

void solve(){
    dp[1]=1;
    int res=1,l,r,m,ans;
    for(int i=2;i<=n;i++){
        l=1, r=res, ans=0;
        while(l<=r){
            m = (l+r)>>1;
            if(a[i]>a[dp[m]]){
                l = m+1;
                ans=m;
            }
            else r= m-1;
        }
        if(ans==res) dp[++res] = i;
        if(a[i]<a[dp[ans+1]]) dp[ans+1] = i;
    }
    cout<<res;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    while(t--){
        read();
        solve();
    }
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4580 KB Output is correct
2 Correct 27 ms 4444 KB Output is correct
3 Correct 27 ms 4416 KB Output is correct
4 Correct 26 ms 4444 KB Output is correct
5 Correct 15 ms 3932 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2908 KB Output is correct
2 Correct 7 ms 2996 KB Output is correct
3 Correct 7 ms 2904 KB Output is correct
4 Incorrect 4 ms 2652 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

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

Subtask #7
0 / 25.0

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