oj.uz

Submission #941236

# Submission time Handle Problem Language Result Execution time Memory
941236 2024-03-08T10:51:49 Z vjudge1 Global Warming (CEOI18_glo) C++17
100 / 100
 46 ms 9172 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define FOR(i,l,r) for (int i = l; i <= r; i++)
#define FORD(i,l,r) for (int i = l; i >= r; i--)
#define el cout <<"\n"
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define Debug(a,n) for (int i = 1; i <= n; i++) cout << a[i] << " "; cout << endl
using namespace std;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> vii;
typedef unsigned long long ull;
typedef vector<vector<int>> vvi;
int fastMax(int x, int y)
{
    return (((y-x)>>(32-1))&(x^y))^y;
}

const long long N=1e6+5;
const long long base=311;
const long long mod=1e9+7;
const long long INF=1e9+7;
const int d4x[4] = {-1, 0, 1, 0}, d4y[4] = {0, 1, 0, -1};
const int d8x[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, d8y[8] = {0, 1, 1, 1, 0, -1, -1, -1};

///KhengmepfromLTVHSFTGgoldmedal&&letter<3
long long n,a[N],x;
int res=0,suf[N];
vector<int>lis;
void cal()
{
    for(int i=1; i<=n; i++)
    {
        a[i]=-a[i];
    }
    for(int i=n; i>=1; i--)
    {
        auto it=lower_bound(ALL(lis),a[i])-lis.begin();
        suf[i]=it+1;
        if(it==lis.size())
        {
            lis.emplace_back(a[i]);
        }
        else lis[it]=a[i];
    }
    for(int i=1; i<=n; i++)
    {
        a[i]=-a[i];
    }
    res=lis.size();
}
void khengmep()
{
    cal();
    lis.clear();
    for(int i=1; i<=n; i++)
    {
        int l=lower_bound(ALL(lis),a[i]+x)-lis.begin()+1;
        res=max(res,l+suf[i]-1);
        auto it=lower_bound(ALL(lis),a[i])-lis.begin();
        if(it==lis.size())
        {
            lis.emplace_back(a[i]);
        }
        else lis[it]=a[i];
    }
    cout<<res;
    el;
}
void ip()
{
    cin>>n>>x;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i];
    }
}
int main()
{
//    freopen("test.inp","r",stdin);
//    freopen("test.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--)
    {
        ip();
        khengmep();
    }
    return 0;
}

Compilation message

glo.cpp: In function 'void cal()':
glo.cpp:46:14: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         if(it==lis.size())
      |            ~~^~~~~~~~~~~~
glo.cpp: In function 'void khengmep()':
glo.cpp:67:14: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         if(it==lis.size())
      |            ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2512 KB Output is correct
14 Correct 1 ms 2520 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2512 KB Output is correct
14 Correct 1 ms 2520 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2648 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8548 KB Output is correct
2 Correct 46 ms 8540 KB Output is correct
3 Correct 46 ms 8528 KB Output is correct
4 Correct 45 ms 8708 KB Output is correct
5 Correct 22 ms 8412 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 7256 KB Output is correct
2 Correct 11 ms 7260 KB Output is correct
3 Correct 12 ms 7280 KB Output is correct
4 Correct 6 ms 7260 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 6 ms 7128 KB Output is correct
7 Correct 9 ms 7260 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 7768 KB Output is correct
2 Correct 19 ms 7516 KB Output is correct
3 Correct 38 ms 8648 KB Output is correct
4 Correct 22 ms 8416 KB Output is correct
5 Correct 11 ms 7648 KB Output is correct
6 Correct 24 ms 8416 KB Output is correct
7 Correct 22 ms 9032 KB Output is correct
8 Correct 16 ms 7768 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2512 KB Output is correct
14 Correct 1 ms 2520 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2648 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 45 ms 8548 KB Output is correct
28 Correct 46 ms 8540 KB Output is correct
29 Correct 46 ms 8528 KB Output is correct
30 Correct 45 ms 8708 KB Output is correct
31 Correct 22 ms 8412 KB Output is correct
32 Correct 15 ms 7256 KB Output is correct
33 Correct 11 ms 7260 KB Output is correct
34 Correct 12 ms 7280 KB Output is correct
35 Correct 6 ms 7260 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 6 ms 7128 KB Output is correct
38 Correct 9 ms 7260 KB Output is correct
39 Correct 22 ms 7768 KB Output is correct
40 Correct 19 ms 7516 KB Output is correct
41 Correct 38 ms 8648 KB Output is correct
42 Correct 22 ms 8416 KB Output is correct
43 Correct 11 ms 7648 KB Output is correct
44 Correct 24 ms 8416 KB Output is correct
45 Correct 22 ms 9032 KB Output is correct
46 Correct 16 ms 7768 KB Output is correct
47 Correct 22 ms 7516 KB Output is correct
48 Correct 22 ms 7768 KB Output is correct
49 Correct 45 ms 8540 KB Output is correct
50 Correct 25 ms 8416 KB Output is correct
51 Correct 22 ms 8156 KB Output is correct
52 Correct 22 ms 8412 KB Output is correct
53 Correct 22 ms 8408 KB Output is correct
54 Correct 25 ms 9172 KB Output is correct
55 Correct 36 ms 8536 KB Output is correct