oj.uz

Submission #708224

# Submission time Handle Problem Language Result Execution time Memory
708224 2023-03-11T10:40:19 Z swagchicken trapezoid (balkan11_trapezoid) C++14
40 / 100
 83 ms 8352 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  = 998244353;
#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);
        }
        
        int LSOne(int x) {
            return x & (-x);
        }

        T RMQ(int j) {
            // this allows array to be 0 indexed while ft is 1 indexed
            j++;
            int maxv = 0;
            for(; j > 0; j -= LSOne(j)) {
                maxv = max(maxv, ft[j]);
            }
            return maxv;
        }
        
        void update(int i, T v) {
            i++;
            for(; i < ft.size(); i += LSOne(i)) {
                ft[i] = max(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<int> st(210000);

    vector<int> ans(n+5);

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

    int res = st.RMQ(201000);
    cout << res << " " << -1 << 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 = int]':
trapezoid.cpp:174:34:   required from here
trapezoid.cpp:119:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |             for(; i < ft.size(); i += LSOne(i)) {
      |                   ~~^~~~~~~~~~~

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1108 KB Partially correct
2 Partially correct 1 ms 1088 KB Partially correct
3 Partially correct 1 ms 1108 KB Partially correct
4 Partially correct 1 ms 1236 KB Partially correct
5 Partially correct 2 ms 1232 KB Partially correct
6 Partially correct 3 ms 1364 KB Partially correct
7 Partially correct 4 ms 1488 KB Partially correct
8 Partially correct 5 ms 1620 KB Partially correct
9 Partially correct 9 ms 1856 KB Partially correct
10 Partially correct 18 ms 2656 KB Partially correct
11 Partially correct 19 ms 3012 KB Partially correct
12 Partially correct 43 ms 4920 KB Partially correct
13 Partially correct 47 ms 5540 KB Partially correct
14 Partially correct 57 ms 7872 KB Partially correct
15 Partially correct 62 ms 7800 KB Partially correct
16 Partially correct 69 ms 7780 KB Partially correct
17 Partially correct 70 ms 7908 KB Partially correct
18 Partially correct 70 ms 7816 KB Partially correct
19 Partially correct 75 ms 7896 KB Partially correct
20 Partially correct 83 ms 8352 KB Partially correct