oj.uz

Submission #555013

# Submission time Handle Problem Language Result Execution time Memory
555013 2022-04-30T00:11:58 Z SmolBrain Global Warming (CEOI18_glo) C++17
100 / 100
 48 ms 6488 KB 
// Om Namah Shivaya
// GM in 95 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.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>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    // https://codeforces.com/blog/entry/61181?#comment-451317
    ll n, x; cin >> n >> x;
    vector<ll> a(n + 5);
    rep1(i, n) cin >> a[i];

    // lis1[i] = lis ending at position i if the prefix [1...i] is decreased by x
    vector<ll> lis1(n + 5);
    vector<ll> lis;

    rep1(i, n) {
        ll pos = lower_bound(all(lis), a[i] - x) - lis.begin();
        lis1[i] = pos + 1;

        if (pos == sz(lis)) lis.pb(a[i] - x);
        else lis[pos] = a[i] - x;
    }

    lis.clear();
    ll ans = *max_element(all(lis1));

    // lis from the right = lds from the left
    // lds from the left = lis of all numbers with their signs inverted (positive to negative) from left

    rev(i, n, 1) {
        ll pos = lower_bound(all(lis), -(a[i] - x)) - lis.begin();
        amax(ans, lis1[i] + pos);

        pos = lower_bound(all(lis), -a[i]) - lis.begin();

        if (pos == sz(lis)) lis.pb(-a[i]);
        else lis[pos] = -a[i];
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

glo.cpp: In function 'void solve(int)':
glo.cpp:88:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         if (pos == sz(lis)) lis.pb(a[i] - x);
      |                 ^
glo.cpp:104:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         if (pos == sz(lis)) lis.pb(-a[i]);
      |                 ^
glo.cpp: In function 'void usaco(std::string)':
glo.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3440 KB Output is correct
2 Correct 47 ms 5320 KB Output is correct
3 Correct 48 ms 5324 KB Output is correct
4 Correct 47 ms 5324 KB Output is correct
5 Correct 33 ms 5712 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1108 KB Output is correct
2 Correct 11 ms 1492 KB Output is correct
3 Correct 12 ms 1492 KB Output is correct
4 Correct 7 ms 1748 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1748 KB Output is correct
7 Correct 9 ms 1616 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1884 KB Output is correct
2 Correct 20 ms 1912 KB Output is correct
3 Correct 43 ms 3440 KB Output is correct
4 Correct 28 ms 4564 KB Output is correct
5 Correct 14 ms 2532 KB Output is correct
6 Correct 26 ms 4424 KB Output is correct
7 Correct 26 ms 4372 KB Output is correct
8 Correct 17 ms 1912 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 45 ms 3440 KB Output is correct
28 Correct 47 ms 5320 KB Output is correct
29 Correct 48 ms 5324 KB Output is correct
30 Correct 47 ms 5324 KB Output is correct
31 Correct 33 ms 5712 KB Output is correct
32 Correct 11 ms 1108 KB Output is correct
33 Correct 11 ms 1492 KB Output is correct
34 Correct 12 ms 1492 KB Output is correct
35 Correct 7 ms 1748 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 7 ms 1748 KB Output is correct
38 Correct 9 ms 1616 KB Output is correct
39 Correct 21 ms 1884 KB Output is correct
40 Correct 20 ms 1912 KB Output is correct
41 Correct 43 ms 3440 KB Output is correct
42 Correct 28 ms 4564 KB Output is correct
43 Correct 14 ms 2532 KB Output is correct
44 Correct 26 ms 4424 KB Output is correct
45 Correct 26 ms 4372 KB Output is correct
46 Correct 17 ms 1912 KB Output is correct
47 Correct 23 ms 2880 KB Output is correct
48 Correct 23 ms 2768 KB Output is correct
49 Correct 47 ms 5452 KB Output is correct
50 Correct 29 ms 5716 KB Output is correct
51 Correct 23 ms 4692 KB Output is correct
52 Correct 28 ms 5844 KB Output is correct
53 Correct 24 ms 5836 KB Output is correct
54 Correct 30 ms 6488 KB Output is correct
55 Correct 38 ms 5320 KB Output is correct