oj.uz

Submission #144511

# Submission time Handle Problem Language Result Execution time Memory
144511 2019-08-17T01:30:41 Z 12tqian Global Warming (CEOI18_glo) C++14
10 / 100
 1184 ms 24284 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}

const int MAX = 2e5+5;
vi t;
int inc[MAX];
int de[MAX];
unordered_map<int, int> um;

template<class T, int SZ> struct Seg { // SZ should be power of 2
    T ID = 0; // comb(ID,b) must equal b
    T comb(T a, T b) { return max(a, b); } // easily change this to min or max

    T seg[2*SZ];
    void reset(){
        f0r(i, 2*SZ) seg[i] = 0;
    }
    void upd(int p, T value) {  // set value at position p
        seg[p += SZ] = value;
        for (p /= 2; p; p /= 2) seg[p] = comb(seg[2*p],seg[2*p+1]);
    }

    T query(int l, int r) {  // sum on interval [l, r]
        r ++; T lres = ID, rres = ID; // make sure non-commutative operations work
        for (l += SZ, r += SZ; l < r; l /= 2, r /= 2) {
            if (l&1) lres = comb(lres,seg[l++]);
            if (r&1) rres = comb(seg[--r],rres);
        }
        return comb(lres,rres);
    }
};
Seg<int, (1<<18)> s;
Tree<int> vals;
int main(){
    fast_io();
    int n, x;
    cin >> n >> x;
    f0r(i, n){
        int ti;
        cin >> ti;
        t.eb(ti);
        vals.insert(ti);
    }
    int tmp = 0;
    for(auto x: vals){
        um[x] = tmp;
        tmp++;
    }
    f0r(i, n){
        int idx = um[t[i]];
        if(idx>0) inc[i] = 1 + s.query(0, idx-1);
        else inc[i] = 1;
        s.upd(idx, max(s.query(idx, idx), inc[i]));
    }
    s.reset();
    for(int i = n-1; i>= 0; i--){
        int idx = um[t[i]];
        if(idx>0) de[i] = 1+s.query(idx+1, MAX);
        else de[i] = 1;
        s.upd(idx, max(s.query(idx, idx), de[i]));
    }
    s.reset();
    int ans = 0;
    f0r(i, n){
        int mx = t[i] + x;
        int it = vals.order_of_key(mx);
        if(it>0) ans = max(ans, de[i] + s.query(0, it-1));
        int idx = um[t[i]];
        s.upd(idx, max(s.query(idx, idx), inc[i]));
    }
    s.reset();
    for(int i = n-1; i>=0; i--){
        int mn = t[i] -x+1;
        int it = vals.order_of_key(mn);
        ans = max(ans, inc[i] + s.query(it, MAX));
        int idx = um[t[i]];
        s.upd(idx, max(s.query(idx, idx), de[i]));
    }
    cout << ans << endl;
    return 0;
}

Compilation message

glo.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
glo.cpp: In function 'void io(std::__cxx11::string)':
glo.cpp:52:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
glo.cpp:53:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2424 KB Output is correct
2 Correct 5 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2424 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Incorrect 4 ms 2424 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2424 KB Output is correct
2 Correct 5 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2424 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Incorrect 4 ms 2424 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2424 KB Output is correct
2 Correct 5 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2424 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Incorrect 4 ms 2424 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1040 ms 24096 KB Output is correct
2 Correct 1035 ms 24184 KB Output is correct
3 Correct 1184 ms 24284 KB Output is correct
4 Correct 1124 ms 24192 KB Output is correct
5 Correct 362 ms 14568 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 7844 KB Output is correct
2 Correct 198 ms 7968 KB Output is correct
3 Correct 144 ms 7856 KB Output is correct
4 Correct 73 ms 5464 KB Output is correct
5 Incorrect 4 ms 2424 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 13244 KB Output is correct
2 Correct 298 ms 13260 KB Output is correct
3 Correct 756 ms 24160 KB Output is correct
4 Correct 347 ms 14664 KB Output is correct
5 Correct 169 ms 12808 KB Output is correct
6 Correct 375 ms 22564 KB Output is correct
7 Incorrect 339 ms 23164 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2424 KB Output is correct
2 Correct 5 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2424 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Incorrect 4 ms 2424 KB Output isn't correct
10 Halted 0 ms 0 KB -