oj.uz

Submission #961937

# Submission time Handle Problem Language Result Execution time Memory
961937 2024-04-12T18:59:03 Z Mher777 Event Hopping (BOI22_events) C++17
10 / 100
 1500 ms 25060 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(998244353);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

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

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 100005, M = 200005;
int id[N], t[M * 4], p[M];
pii ran[N];
mii pox;
pair<pii, int> a[N];
int n, q, m;

void bld(int l = 1, int r = m, int pos = 1) {
    t[pos] = MAX;
    if (l == r) {
        p[l] = pos;
        return;
    }
    int mid = (l + r) / 2;
    bld(l, mid, 2 * pos);
    bld(mid + 1, r, 2 * pos + 1);
}

int qry(int l, int r, int tl = 1, int tr = m, int pos = 1) {
    if (l == tl && r == tr) {
        return t[pos];
    }
    int mid = (tl + tr) / 2;
    if (mid >= r) {
        return qry(l, r, tl, mid, 2 * pos);
    }
    if (mid < l) {
        return qry(l, r, mid + 1, tr, 2 * pos + 1);
    }
    return min(qry(l, mid, tl, mid, 2 * pos), qry(mid + 1, r, mid + 1, tr, 2 * pos + 1));
}

void upd(int pos, int val) {
    pos = p[pos];
    t[pos] = min(t[pos], val);
    pos /= 2;
    while (pos) {
        t[pos] = min(t[2 * pos], t[2 * pos + 1]);
        pos /= 2;
    }
}

void upd1(int pos) {
    pos = p[pos];
    while (pos) {
        t[pos] = MAX;
        pos /= 2;
    }
}

void slv() {
    cin >> n >> q;
    set<int> st;
    for (int i = 1; i <= n; ++i) {
        cin >> ran[i].ff >> ran[i].ss;
        st.insert(ran[i].ff);
        st.insert(ran[i].ss);
    }
    for (auto elem : st) {
        pox[elem] = ++m;
    }
    for (int i = 1; i <= n; ++i) {
        a[i] = { {pox[ran[i].ss],pox[ran[i].ff]},i };
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; ++i) {
        id[a[i].ss] = i;
    }
    vector<int> vec;
    bld();
    if (true && q <= 100) {
        while (q--) {
            int l, r;
            cin >> l >> r;
            if (l == r) {
                cout << 0 << '\n';
                continue;
            }
            if (ran[l].ss == ran[r].ss) {
                cout << 1 << '\n';
                continue;
            }
            l = id[l], r = id[r];
            if (r < l) {
                cout << "impossible\n";
                continue;
            }
            for (auto elem : vec) upd1(elem);
            vec = { a[l].ff.ff };
            upd(a[l].ff.ff, 0);
            int val;
            for (int i = l + 1; i <= r; ++i) {
                val = qry(a[i].ff.ss, a[i].ff.ff);
                if (val == MAX) continue;
                ++val;
                upd(a[i].ff.ff, val);
                vec.pub(a[i].ff.ff);
            }
            if (val == MAX) cout << "impossible\n";
            else cout << val << '\n';
        }
    }
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

events.cpp: In function 'll range_sum(ll, ll)':
events.cpp:95:21: warning: unused variable 'cnt' [-Wunused-variable]
   95 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
events.cpp: In function 'll bin_to_dec(std::string)':
events.cpp:118:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
events.cpp: In function 'void slv()':
events.cpp:273:33: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
  273 |             else cout << val << '\n';
      |                                 ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 100 ms 14420 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 9 ms 4700 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 5 ms 4700 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 1 ms 4596 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 9 ms 4700 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 5 ms 4700 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 1 ms 4596 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 8 ms 4700 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 5 ms 4952 KB Output is correct
17 Correct 4 ms 4952 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Incorrect 4 ms 5208 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 9 ms 4700 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 5 ms 4700 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 1 ms 4596 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 8 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 5 ms 4700 KB Output is correct
17 Correct 4 ms 4700 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1270 ms 15132 KB Output is correct
20 Correct 306 ms 15152 KB Output is correct
21 Correct 376 ms 14932 KB Output is correct
22 Correct 254 ms 18832 KB Output is correct
23 Correct 611 ms 25060 KB Output is correct
24 Execution timed out 1559 ms 24992 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 103 ms 14372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 100 ms 14420 KB Output isn't correct
3 Halted 0 ms 0 KB -