oj.uz

Submission #709088

# Submission time Handle Problem Language Result Execution time Memory
709088 2023-03-13T06:09:33 Z swagchicken trapezoid (balkan11_trapezoid) C++14
100 / 100
 92 ms 9576 KB 
#include <iostream>
#include <tuple>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <random>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <vector>
#include <fstream>
#include <iomanip>
#include <ctime>
#include <cctype>
#include <climits>
#include <chrono>
 
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector< vector <int> > vvi;
typedef pair<int, int> pii;
typedef pair < pair < int, int >, int > piii;
typedef pair < pair <int, int > , pair <int, int> > piiii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
 
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define RFOR(i,a,b) for(int i = a-1; i >= b; i --)
#define all(a) a.begin(), a.end()
#define endl '\n';
#define sz(x) (int)(x).size()
 
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
 
template <typename T>
void pr(vector<T> &v) {
    FOR(i, 0, sz(v)) cout << v[i] << " ";
    cout << endl;
}
template <typename T>
void pr(vector<vector<T> > &v) {
    FOR(i, 0, sz(v)) { pr(v[i]); }
}
template <typename T>
void re(T &x) {
    cin >> x;
}
template <typename T>
void re(vector<T> &a) {
    FOR(i, 0, sz(a)) re(a[i]);
}
template <class Arg, class... Args>
void re(Arg &first, Args &... rest) {
    re(first);
    re(rest...);
}
template <typename T>
void pr(T x) {
    cout << x << endl;
}
template <class Arg, class... Args>
void pr(const Arg &first, const Args &... rest) {
    cout << first << " ";
    pr(rest...);
    cout << endl;
}
void ps() { cout << endl; }
template<class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
    cout << t; if (sizeof...(ts)) cout << " "; ps(ts...);
}
 
const ll MOD  = 30013;
#define inf 1e18;
#define INF INT_MAX

long double PI = 4*atan(1);
long double eps = 1e-12;


template<class T>
class FenwickTree {
    private:
        vector<T> ft;
    public:
        FenwickTree(int m) {
            ft.assign(m + 1, {0,0});
        }
        
        int LSOne(int x) {
            return x & (-x);
        }

        T cmb(T a, T b) {
          if(a.ff == b.ff) {
            return {a.ff, (a.ss + b.ss)%MOD};
          }
          else if(a.ff > b.ff) return a;
          return b;
        }

        T RMQ(int j) {
            // this allows array to be 0 indexed while ft is 1 indexed
            j++;
            pii maxv = {0,0};
            for(; j > 0; j -= LSOne(j)) {
                maxv = cmb(maxv, ft[j]);
            }
            return maxv;
        }
        
        
        void update(int i, T v) {
            i++;
            for(; i < ft.size(); i += LSOne(i)) {
                ft[i] = cmb(ft[i], v);
            }
        }
};


struct QS {
  int idx, x, y, add;
};



int main() {
    //auto start = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);cin.tie(0);
    //ofstream cout("output.txt");
    //ifstream cin("input.txt");
    #ifdef DEBUG
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
    #endif  

    int n; cin >> n;
    vector<int> botv;
    vector<QS> allq;
    FOR(i,0,n) {
      int a,b,c,d; cin >> a >> b >> c >> d;
      botv.pb(c);
      botv.pb(d);
      allq.pb({i, a, c, 0});
      allq.pb({i, b, d, 1});
    }

    sort(all(botv));

   // botv.erase(unique(all(botv)), botv.end());
    for(QS &q : allq) {
      q.y = lower_bound(all(botv), q.y) - botv.begin();
    }

    sort(all(allq), [&](const QS &a, const QS &b) {
        return a.x < b.x;
    });
    
    FenwickTree<pii> st(210000);

    vector<pii> ans(n+5);

    for(QS &q : allq) {
   //   cout << q.x << " " << q.y << " " << q.idx << " " << q.add << endl;
      if(q.add == 0) {
        pii val = st.RMQ(q.y);
        if(val.ss == 0) val.ss = 1;
        ans[q.idx] = {val.ff + 1, val.ss};
      } else {
        st.update(q.y, ans[q.idx]);
      }
    }

    pii res = st.RMQ(201000);
    cout << res.ff << " " << res.ss << endl;


    //auto stop = chrono::high_resolution_clock::now();
    //auto duration = chrono::duration_cast<chrono::microseconds>(stop - start);
    //cout << duration.count() << endl;
    //cin.close();
    //cout.close();
}

Compilation message

trapezoid.cpp: In instantiation of 'void FenwickTree<T>::update(int, T) [with T = std::pair<int, int>]':
trapezoid.cpp:184:34:   required from here
trapezoid.cpp:128:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |             for(; i < ft.size(); i += LSOne(i)) {
      |                   ~~^~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1980 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 2 ms 2004 KB Output is correct
5 Correct 3 ms 2132 KB Output is correct
6 Correct 5 ms 2212 KB Output is correct
7 Correct 5 ms 2256 KB Output is correct
8 Correct 5 ms 2388 KB Output is correct
9 Correct 9 ms 2764 KB Output is correct
10 Correct 17 ms 3468 KB Output is correct
11 Correct 21 ms 3772 KB Output is correct
12 Correct 44 ms 5684 KB Output is correct
13 Correct 52 ms 6384 KB Output is correct
14 Correct 65 ms 7880 KB Output is correct
15 Correct 71 ms 7860 KB Output is correct
16 Correct 73 ms 8164 KB Output is correct
17 Correct 77 ms 8524 KB Output is correct
18 Correct 75 ms 8892 KB Output is correct
19 Correct 84 ms 9180 KB Output is correct
20 Correct 92 ms 9576 KB Output is correct