oj.uz

Submission #708127

# Submission time Handle Problem Language Result Execution time Memory
708127 2023-03-11T06:05:54 Z swagchicken trapezoid (balkan11_trapezoid) C++14
18 / 100
 73 ms 10804 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;
};

bool cmp(const QS &a, const QS &b) {
  return a.x < b.x;
}

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();
   //   cout << q.y << endl;
    }

    sort(all(allq), cmp);
    
    FenwickTree<int> st(210000);

    vector<int> ans(n);

    for(QS q : allq) {
      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(210000);
    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:175:34:   required from here
trapezoid.cpp:120:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |             for(; i < ft.size(); i += LSOne(i)) {
      |                   ~~^~~~~~~~~~~

Subtask #1
18.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1108 KB Partially correct
2 Partially correct 1 ms 1108 KB Partially correct
3 Partially correct 2 ms 1092 KB Partially correct
4 Partially correct 2 ms 1108 KB Partially correct
5 Partially correct 2 ms 1236 KB Partially correct
6 Partially correct 3 ms 1364 KB Partially correct
7 Partially correct 3 ms 1364 KB Partially correct
8 Partially correct 4 ms 1492 KB Partially correct
9 Partially correct 7 ms 1616 KB Partially correct
10 Incorrect 13 ms 2124 KB Output isn't correct
11 Incorrect 16 ms 2380 KB Output isn't correct
12 Runtime error 36 ms 7144 KB Execution killed with signal 11
13 Runtime error 53 ms 7808 KB Execution killed with signal 11
14 Runtime error 62 ms 8564 KB Execution killed with signal 11
15 Incorrect 53 ms 5904 KB Output isn't correct
16 Incorrect 56 ms 5940 KB Output isn't correct
17 Runtime error 61 ms 9948 KB Execution killed with signal 11
18 Incorrect 59 ms 5920 KB Output isn't correct
19 Runtime error 72 ms 10804 KB Execution killed with signal 11
20 Incorrect 73 ms 5936 KB Output isn't correct