Submission #1102256

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102256		modwwe	Global Warming (CEOI18_glo)	C++17	100 / 100	97 ms	9268 KiB

glo

#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 (stderr)

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 / 5
• Subtask 2: 10 / 10
• Subtask 3: 13 / 13
• Subtask 4: 10 / 10
• Subtask 5: 20 / 20
• Subtask 6: 17 / 17
• Subtask 7: 25 / 25