oj.uz

Submission #1102256

# Submission time Handle Problem Language Result Execution time Memory
1102256 2024-10-18T01:08:55 Z modwwe Global Warming (CEOI18_glo) C++17
100 / 100
 97 ms 9268 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
};
void phongbeo();
const int inf = 1e9;
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};

int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
int a[200001];
int cost[200001];
vector<int> v;
struct BIT
{
    int bit[200001];
    void reset()
    {
        for(int i=1; i<=n; i++)
            bit[i]=0;
    }
    void upd(int x,int y)
    {
        for(x; x<=n; x+=x&-x)
            bit[x]=max(bit[x],y);
    }
    int get(int x)
    {
        int s=0;
        for(x; x; x-=x&-x)
            s=max(s,bit[x]);
        return s;
    }
} fen;
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>a[i],v.pb(a[i]);
    sort(v.begin(),v.end());
    for(int i=1; i<=n; i++)
        a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin()+1;
    for(int i=n; i>=1; --i)
    {
        s3=v[a[i]-1]-m;
        s3=upper_bound(v.begin(),v.end(),s3)-v.begin()+1;
        s4=fen.get(n-s3+1);
        cost[i]=s4;
        s2=fen.get(n-a[i]);
        fen.upd(n-a[i]+1,s2+1);
    }
    fen. reset();
    for(int i=1; i<=n; i++)
    {
        s2=fen.get(a[i]-1);
        fen.upd(a[i],s2+1);
        s4=max(s4,s2+1+cost[i]);
    }
    cout<<s4;
}

Compilation message

glo.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
glo.cpp: In member function 'void BIT::upd(long long int, long long int)':
glo.cpp:96:13: warning: statement has no effect [-Wunused-value]
   96 |         for(x; x<=n; x+=x&-x)
      |             ^
glo.cpp: In member function 'long long int BIT::get(long long int)':
glo.cpp:102:13: warning: statement has no effect [-Wunused-value]
  102 |         for(x; x; x-=x&-x)
      |             ^
glo.cpp: In function 'int main()':
glo.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
glo.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
glo.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
glo.cpp:75:9: note: in expansion of macro 'fou'
   75 |         fou(task);
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4436 KB Output is correct
2 Correct 1 ms 4436 KB Output is correct
3 Correct 1 ms 4436 KB Output is correct
4 Correct 1 ms 4692 KB Output is correct
5 Correct 1 ms 4436 KB Output is correct
6 Correct 1 ms 4536 KB Output is correct
7 Correct 1 ms 4436 KB Output is correct
8 Correct 1 ms 4436 KB Output is correct
9 Correct 1 ms 4436 KB Output is correct
10 Correct 1 ms 4436 KB Output is correct
11 Correct 1 ms 4600 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4436 KB Output is correct
2 Correct 1 ms 4436 KB Output is correct
3 Correct 1 ms 4436 KB Output is correct
4 Correct 1 ms 4692 KB Output is correct
5 Correct 1 ms 4436 KB Output is correct
6 Correct 1 ms 4536 KB Output is correct
7 Correct 1 ms 4436 KB Output is correct
8 Correct 1 ms 4436 KB Output is correct
9 Correct 1 ms 4436 KB Output is correct
10 Correct 1 ms 4436 KB Output is correct
11 Correct 1 ms 4600 KB Output is correct
12 Correct 1 ms 4436 KB Output is correct
13 Correct 1 ms 4436 KB Output is correct
14 Correct 1 ms 4564 KB Output is correct
15 Correct 1 ms 4436 KB Output is correct
16 Correct 1 ms 4436 KB Output is correct
17 Correct 1 ms 4436 KB Output is correct
18 Correct 1 ms 4600 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4436 KB Output is correct
2 Correct 1 ms 4436 KB Output is correct
3 Correct 1 ms 4436 KB Output is correct
4 Correct 1 ms 4692 KB Output is correct
5 Correct 1 ms 4436 KB Output is correct
6 Correct 1 ms 4536 KB Output is correct
7 Correct 1 ms 4436 KB Output is correct
8 Correct 1 ms 4436 KB Output is correct
9 Correct 1 ms 4436 KB Output is correct
10 Correct 1 ms 4436 KB Output is correct
11 Correct 1 ms 4600 KB Output is correct
12 Correct 1 ms 4436 KB Output is correct
13 Correct 1 ms 4436 KB Output is correct
14 Correct 1 ms 4564 KB Output is correct
15 Correct 1 ms 4436 KB Output is correct
16 Correct 1 ms 4436 KB Output is correct
17 Correct 1 ms 4436 KB Output is correct
18 Correct 1 ms 4600 KB Output is correct
19 Correct 1 ms 4604 KB Output is correct
20 Correct 1 ms 4436 KB Output is correct
21 Correct 1 ms 4436 KB Output is correct
22 Correct 1 ms 4436 KB Output is correct
23 Correct 1 ms 4436 KB Output is correct
24 Correct 1 ms 4436 KB Output is correct
25 Correct 1 ms 4436 KB Output is correct
26 Correct 1 ms 4436 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 9180 KB Output is correct
2 Correct 91 ms 9228 KB Output is correct
3 Correct 94 ms 9168 KB Output is correct
4 Correct 92 ms 9168 KB Output is correct
5 Correct 49 ms 8656 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5592 KB Output is correct
2 Correct 20 ms 5636 KB Output is correct
3 Correct 20 ms 5592 KB Output is correct
4 Correct 11 ms 5500 KB Output is correct
5 Correct 2 ms 4452 KB Output is correct
6 Correct 11 ms 5356 KB Output is correct
7 Correct 17 ms 5592 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 6612 KB Output is correct
2 Correct 36 ms 6612 KB Output is correct
3 Correct 83 ms 9144 KB Output is correct
4 Correct 54 ms 8656 KB Output is correct
5 Correct 21 ms 6100 KB Output is correct
6 Correct 43 ms 8656 KB Output is correct
7 Correct 40 ms 9128 KB Output is correct
8 Correct 27 ms 6612 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4436 KB Output is correct
2 Correct 1 ms 4436 KB Output is correct
3 Correct 1 ms 4436 KB Output is correct
4 Correct 1 ms 4692 KB Output is correct
5 Correct 1 ms 4436 KB Output is correct
6 Correct 1 ms 4536 KB Output is correct
7 Correct 1 ms 4436 KB Output is correct
8 Correct 1 ms 4436 KB Output is correct
9 Correct 1 ms 4436 KB Output is correct
10 Correct 1 ms 4436 KB Output is correct
11 Correct 1 ms 4600 KB Output is correct
12 Correct 1 ms 4436 KB Output is correct
13 Correct 1 ms 4436 KB Output is correct
14 Correct 1 ms 4564 KB Output is correct
15 Correct 1 ms 4436 KB Output is correct
16 Correct 1 ms 4436 KB Output is correct
17 Correct 1 ms 4436 KB Output is correct
18 Correct 1 ms 4600 KB Output is correct
19 Correct 1 ms 4604 KB Output is correct
20 Correct 1 ms 4436 KB Output is correct
21 Correct 1 ms 4436 KB Output is correct
22 Correct 1 ms 4436 KB Output is correct
23 Correct 1 ms 4436 KB Output is correct
24 Correct 1 ms 4436 KB Output is correct
25 Correct 1 ms 4436 KB Output is correct
26 Correct 1 ms 4436 KB Output is correct
27 Correct 91 ms 9180 KB Output is correct
28 Correct 91 ms 9228 KB Output is correct
29 Correct 94 ms 9168 KB Output is correct
30 Correct 92 ms 9168 KB Output is correct
31 Correct 49 ms 8656 KB Output is correct
32 Correct 21 ms 5592 KB Output is correct
33 Correct 20 ms 5636 KB Output is correct
34 Correct 20 ms 5592 KB Output is correct
35 Correct 11 ms 5500 KB Output is correct
36 Correct 2 ms 4452 KB Output is correct
37 Correct 11 ms 5356 KB Output is correct
38 Correct 17 ms 5592 KB Output is correct
39 Correct 39 ms 6612 KB Output is correct
40 Correct 36 ms 6612 KB Output is correct
41 Correct 83 ms 9144 KB Output is correct
42 Correct 54 ms 8656 KB Output is correct
43 Correct 21 ms 6100 KB Output is correct
44 Correct 43 ms 8656 KB Output is correct
45 Correct 40 ms 9128 KB Output is correct
46 Correct 27 ms 6612 KB Output is correct
47 Correct 45 ms 6612 KB Output is correct
48 Correct 45 ms 6612 KB Output is correct
49 Correct 97 ms 9168 KB Output is correct
50 Correct 51 ms 8820 KB Output is correct
51 Correct 35 ms 8400 KB Output is correct
52 Correct 54 ms 8656 KB Output is correct
53 Correct 41 ms 8656 KB Output is correct
54 Correct 42 ms 9168 KB Output is correct
55 Correct 76 ms 9268 KB Output is correct