제출 #772046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
772046		Filya	Financial Report (JOI21_financial)	C++14	100 / 100	399 ms	39184 KiB

Main

//♥God will make a way♥
 
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////de/////////////////////
int dp[300005], a[300005];
vi ids[300005];
struct segtree {
    vector<int> tree;
    int size;
    void init(int n) {
        size = 1;
        while(size < n) size *= 2;
        tree.assign(2 * size - 1, 0);
    }
    void set(int i, int v, int x, int lx, int rx) {
        if(rx - lx == 1) tree[x] = v;
        else {
            int m = (lx + rx) / 2;
            if(i < m) set(i, v, 2 * x + 1, lx, m);
            else set(i, v, 2 * x + 2, m, rx);
            tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
        }
    }
    void set(int i, int v) {
        set(i, v, 0, 0, size);
    }
    int first_above(int k, int l, int x, int lx, int rx) {
        if(rx <= l) return -1;
        if(tree[x] < k) return -1;
        if(rx - lx == 1) return lx;
        int m = (lx + rx) / 2;
        int res = first_above(k, l, 2 * x + 1, lx, m);
        if(res == -1) res = first_above(k, l, 2 * x + 2, m, rx);
        return res;
    }
    int first_above(int k, int l) {
        return first_above(k, l, 0, 0, size);
    }
} blocks; //blokery irar hetevic ekox mer elementic > elemner

struct segtree1 {
    vector <ll> tree;
    int size = 1;
    void init(int n) { //make tree
        while(size < n) size *= 2;
        tree.assign(2 * size - 1, 0);
    }
    void build(vector<ll> &a, int x, int lx, int rx) { //build tree
        if(rx - lx == 1) {
            if(lx < a.size()) tree[x] = a[lx];
        }
        else {
            int m = (lx + rx) / 2;
            build(a, 2 * x + 1, lx, m);
            build(a, 2 * x + 2, m, rx);
            tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
        }
    }
    void build(vector<ll> &a) {
        init(a.size());
        build(a, 0, 0, size);
    }
    void upd(int i, ll v, int x, int lx, int rx) {
        if(rx - lx == 1) {
            tree[x] = v;
            return;
        }
        int m = (lx + rx) / 2;
        if(i < m) upd(i, v, 2 * x + 1, lx, m);
        else upd(i, v, 2 * x + 2, m, rx);
        tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
    }
    void upd(int i, ll v) { //set i-th to v
        upd(i, v, 0, 0, size);
    }
    long long qry(int l, int r, int x, int lx, int rx) {
        if(l >= rx || lx >= r) return 0;
        if(lx >= l && rx <= r) return tree[x];
        int m = (lx + rx) / 2;
        return max(qry(l, r, 2 * x + 1, lx, m), qry(l, r, 2 * x + 2, m, rx));
    }
    long long qry(int l, int r) {
        return qry(l, r, 0, 0, size);
    }
} st;
int p[300005], sz[300005], minid[300005];
void init(int n) {
    fri(n + 1) {
        sz[i] = 1;
        p[i] = i;
        minid[i] = i;
    }
}
int get(int a) {
    if(a != p[a])
        p[a] = get(p[a]);
    return p[a];
}
void join(int a, int b) {
    a = get(a);
    b = get(b);
    if(a == b) return;
    if(sz[a] > sz[b]) swap(a, b);
    p[a] = b;
    sz[b] += sz[a];
    minid[b] = min(minid[b], minid[a]);
}
int main() {
    fastio;
    int n, d; cin >> n >> d; fra(n)
    vi compress; fri(n) compress.pb(a[i]);
    sort(all(compress)); uniq(compress);
    fri(n) a[i] = lb(all(compress), a[i]) - compress.begin();
    fri(n) ids[a[i]].pb(i);
    fri(n) reverse(all(ids[i]));
    int ans = 0, j;
    st.init(n); blocks.init(n); init(n);
    for(int i = n-1; i >= 0; i--) { //nvazman kargov enq avelacnum, vorovhetev poqri dpn menak mecerica kaxvac
        for(int id : ids[i]) {
            int nxt = blocks.first_above(d, id);
            if(nxt == -1) {
                j = n-1;
            } else j = nxt + d - 1;
            dp[id] = st.qry(id+1, j+1) + 1;
        }
        for(int id : ids[i]) {
            bool f1 = 0, f2 = 0;
            if(a[id+1] >= i) {
                join(id, id+1);
                f1 = 1;
            }
            if(id && a[id-1] >= i) {
                join(id, id-1);
                f2 = 1;
            }
            if(f1 || f2) {
                int a = get(id);
                blocks.set(minid[a], sz[a]);
            } else blocks.set(id, 1);
            st.upd(id, dp[id]);
        }
    }
    fri(n) ans = max(ans, dp[i]);
    cout << ans;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In member function 'void segtree1::build(std::vector<long long int>&, int, int, int)':
Main.cpp:134:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |             if(lx < a.size()) tree[x] = a[lx];
      |                ~~~^~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 12 / 12
• Subtask 5: 5 / 5
• Subtask 6: 35 / 35