제출 #883022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883022		vjudge1	Exhibition (JOI19_ho_t2)	C++17	0 / 100	0 ms	348 KiB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e16;
const int N = 1e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<array<int,2> > a;
vector<int> c;
vector<int> res;

struct SegTree {
    vector<int> data;
    int sz;
    SegTree(int sz) {
        data.assign(4*(sz + 3), 0);
        this->sz = sz;
    }
    void update(int tl, int tr, int v, int ind, int val) {
        if(tl == tr) {
            data[v] = max(val, data[v]);
            return;
        }
        int tm = (tl + tr) >> 1;
        if(ind <= tm) {
            update(tl, tm, v*2, ind, val);
        }
        else {
            update(tm + 1, tr, v*2+1, ind, val);
        }
        data[v] = max(data[v*2], data[v*2+1]);
    }
    void update(int ind, int val) {
        update(0, sz, 1, ind ,val);
    }
    int query(int tl, int tr, int v, int l, int r) {
        if(tl >= l && tr <= r) {
            return data[v];
        }
        if(tl > r || tr < l) {
            return 0;
        }
        int tm = (tl + tr) >> 1;
        return max(query(tl, tm, v*2, l, r), query(tm + 1, tr , v*2+1, l, r));
    }
    int query(int l, int r) {
        return query(0, sz, 1, l, r);
    }
};


void compress(vector<int> &beg, vector<int> &fin, int &mx) {
    vector<array<int,2> > srt(beg.size());
    for(int i = 0; i<beg.size(); i++) {
        srt[i] = {beg[i], i};
    }    
    sort(srt.begin(), srt.end());
    int cur = 1;
    int last = -1;
    fin.resize(beg.size());
    for(int i = 0; i<srt.size(); i++) {
        if(srt[i][0] != last) {
          cur++;
          last = srt[i][0];  
        } 
        fin[srt[i][1]] = cur;
    }
    cur++;
    mx = cur;
}

inline void solve() {
    cin>>n>>m;
    a.resize(n);
    c.resize(m);
    res.assign(m, -1);

    for(int i = 0; i<n; i++) {
        cin>>a[i][0]>>a[i][1];
    }
    for(int i = 0; i<m; i++) {
        cin>>c[i];
    }

    sort(a.begin(), a.end());
    sort(c.begin(), c.end());
    int ind = 0;
    set<array<int,2> > st;
    
    for(int i = 0; i<m; i++) {
        while(ind < n && a[ind][0] <= c[i]) {
            st.insert({a[ind][1], ind});
            ind++;
        }
        if(st.size()) {
            res[i] = (*st.begin())[0];
            st.erase(st.begin());
        }
        
    }
    vector<int> tmp(0);
    for(int i = 0; i<m; i++) {
        if(res[i] != -1) {
            tmp.pb(res[i]);
        }
    }
    swap(tmp, res);
    m = res.size();
    if(m == 0) {
        cout<<"0\n";
        return;
    }
    vector<int> dp(m+3, 0);
    int mx = 0;
    vector<int> nw;
    compress(res, nw, mx);
    SegTree seg(mx);
    
    dp[0] = 1;
    seg.update(nw[0], 1ll);
    for(int i = 1; i<m; i++) {
        dp[i] = max(0ll, seg.query(0, nw[i])) + 1ll;
        seg.update(nw[i], dp[i]);
    }
    int ans = 0ll;
    for(int i = 0; i<m; i++) {
        ans = max(ans , dp[i]);
    }
    cout<<ans<<"\n";

}
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

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

joi2019_ho_t2.cpp: In function 'std::string to_string(std::string, int, int)':
joi2019_ho_t2.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
joi2019_ho_t2.cpp: In function 'void compress(std::vector<long long int>&, std::vector<long long int>&, long long int&)':
joi2019_ho_t2.cpp:75:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i = 0; i<beg.size(); i++) {
      |                    ~^~~~~~~~~~~
joi2019_ho_t2.cpp:82:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for(int i = 0; i<srt.size(); i++) {
      |                    ~^~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 50