oj.uz

Submission #936213

# Submission time Handle Problem Language Result Execution time Memory
936213 2024-03-01T12:13:28 Z Kutan Global Warming (CEOI18_glo) C++14
100 / 100
 51 ms 4680 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;
const int N = 2e5 + 5;

int n, x;
int a[N];
int suf[N];
int res = 0;

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

void cal_suf() {
    REP(i, 1, n) a[i] = -a[i];
    vector<int> lis;
    REPD(i, n, 1) {
        auto it = lower_bound(ALL(lis), a[i]) - lis.begin();
        suf[i] = it + 1;
        if (it == lis.size()) lis.eb(a[i]);
        else lis[it] = a[i];
    }
    REP(i, 1, n) a[i] = -a[i];
    res = lis.size();
}

void solve(){   
    cal_suf();
    vector<int> lis;
    REP(i, 1, n) {
        int l = lower_bound(ALL(lis), a[i] + x) - lis.begin() + 1;
        maximize(res, l + suf[i] - 1);

        auto it = lower_bound(ALL(lis), a[i]) - lis.begin();
        if (it == lis.size()) lis.eb(a[i]);
        else lis[it] = a[i];
    }   
    cout << res << ln;
}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

glo.cpp: In function 'void readip()':
glo.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
glo.cpp:146:5: note: in expansion of macro 'REP'
  146 |     REP(i, 1, n) cin >> a[i];
      |     ^~~
glo.cpp: In function 'void cal_suf()':
glo.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
glo.cpp:150:5: note: in expansion of macro 'REP'
  150 |     REP(i, 1, n) a[i] = -a[i];
      |     ^~~
glo.cpp:93:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
glo.cpp:152:5: note: in expansion of macro 'REPD'
  152 |     REPD(i, n, 1) {
      |     ^~~~
glo.cpp:155:16: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |         if (it == lis.size()) lis.eb(a[i]);
      |             ~~~^~~~~~~~~~~~~
glo.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
glo.cpp:158:5: note: in expansion of macro 'REP'
  158 |     REP(i, 1, n) a[i] = -a[i];
      |     ^~~
glo.cpp: In function 'void solve()':
glo.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
glo.cpp:165:5: note: in expansion of macro 'REP'
  165 |     REP(i, 1, n) {
      |     ^~~
glo.cpp:170:16: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |         if (it == lis.size()) lis.eb(a[i]);
      |             ~~~^~~~~~~~~~~~~
glo.cpp: In function 'void file()':
glo.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
glo.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 600 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3592 KB Output is correct
2 Correct 51 ms 3156 KB Output is correct
3 Correct 46 ms 3264 KB Output is correct
4 Correct 45 ms 3164 KB Output is correct
5 Correct 24 ms 3656 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1112 KB Output is correct
2 Correct 12 ms 1372 KB Output is correct
3 Correct 10 ms 1116 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 5 ms 1272 KB Output is correct
7 Correct 8 ms 1116 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2004 KB Output is correct
2 Correct 19 ms 2136 KB Output is correct
3 Correct 37 ms 3932 KB Output is correct
4 Correct 22 ms 3924 KB Output is correct
5 Correct 11 ms 2072 KB Output is correct
6 Correct 22 ms 3936 KB Output is correct
7 Correct 29 ms 4568 KB Output is correct
8 Correct 15 ms 2140 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 464 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 45 ms 3592 KB Output is correct
28 Correct 51 ms 3156 KB Output is correct
29 Correct 46 ms 3264 KB Output is correct
30 Correct 45 ms 3164 KB Output is correct
31 Correct 24 ms 3656 KB Output is correct
32 Correct 11 ms 1112 KB Output is correct
33 Correct 12 ms 1372 KB Output is correct
34 Correct 10 ms 1116 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct
36 Correct 0 ms 600 KB Output is correct
37 Correct 5 ms 1272 KB Output is correct
38 Correct 8 ms 1116 KB Output is correct
39 Correct 18 ms 2004 KB Output is correct
40 Correct 19 ms 2136 KB Output is correct
41 Correct 37 ms 3932 KB Output is correct
42 Correct 22 ms 3924 KB Output is correct
43 Correct 11 ms 2072 KB Output is correct
44 Correct 22 ms 3936 KB Output is correct
45 Correct 29 ms 4568 KB Output is correct
46 Correct 15 ms 2140 KB Output is correct
47 Correct 22 ms 2140 KB Output is correct
48 Correct 22 ms 2136 KB Output is correct
49 Correct 45 ms 3920 KB Output is correct
50 Correct 21 ms 3924 KB Output is correct
51 Correct 20 ms 3372 KB Output is correct
52 Correct 21 ms 4168 KB Output is correct
53 Correct 20 ms 4176 KB Output is correct
54 Correct 22 ms 4680 KB Output is correct
55 Correct 35 ms 3932 KB Output is correct