oj.uz

답안 #961947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961947 2024-04-12T19:39:39 Z Mher777 Event Hopping (BOI22_events) C++17
40 / 100
 234 ms 102484 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 = 5005;
int ansx[M][M];
int id[N];
pii ran[N];
pair<pii, int> a[N];
int n, q, m;

void slv() {
    cin >> n >> q;
    for (int i = 1; i <= n; ++i) {
        cin >> ran[i].ff >> ran[i].ss;
        a[i] = { {ran[i].ss,ran[i].ff},i };
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; ++i) {
        id[a[i].ss] = i;
    }
    if (n <= 5000) {
        vector<pii> st;
        for (int l = 1; l <= n; ++l) {
            st.clear();
            st.pub(mpr(a[l].ff.ff, 0));
            int val;
            for (int i = l + 1; i <= n; ++i) {
                int ind = lower_bound(all(st), mpr(a[i].ff.ss, -1)) - st.begin();
                if (ind == st.size()) val = MAX;
                else val = st[ind].ss;
                if (val == MAX) {
                    ansx[a[l].ss][a[i].ss] = -1;
                    continue;
                }
                ++val;
                ansx[a[l].ss][a[i].ss] = val;
                while (!st.empty()) {
                    if (st.back().ss >= val) st.pop_back();
                    else break;
                }
                st.pub(mpr(a[i].ff.ff, val));
            }
        }
        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;
            }
            if (id[r] < id[l]) {
                cout << "impossible\n";
                continue;
            }
            if (ansx[l][r] == -1) {
                cout << "impossible\n";
                continue;
            }
            cout << ansx[l][r] << '\n';
        }
        return;
    }
    if (q <= 100) {
        vector<pii> st;
        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;
            }
            st.clear();
            st.pub(mpr(a[l].ff.ff,0));
            int val;
            for (int i = l + 1; i <= r; ++i) {
                int ind = lower_bound(all(st), mpr(a[i].ff.ss, -1)) - st.begin();
                if (ind == st.size()) val = MAX;
                else val = st[ind].ss;
                if (val == MAX) continue;
                ++val;
                while (!st.empty()) {
                    if (st.back().ss >= val) st.pop_back();
                    else break;
                }
                st.pub(mpr(a[i].ff.ff, val));
            }
            if (val == MAX) cout << "impossible\n";
            else cout << val << '\n';
        }
        return;
    }
}

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:199:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |                 if (ind == st.size()) val = MAX;
      |                     ~~~~^~~~~~~~~~~~
events.cpp:260:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  260 |                 if (ind == st.size()) val = MAX;
      |                     ~~~~^~~~~~~~~~~~
events.cpp:271:33: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
  271 |             else cout << val << '\n';
      |                                 ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 22 ms 4716 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 11 ms 23068 KB Output is correct
4 Correct 10 ms 23056 KB Output is correct
5 Correct 9 ms 23064 KB Output is correct
6 Correct 7 ms 23128 KB Output is correct
7 Correct 8 ms 22876 KB Output is correct
8 Correct 8 ms 23052 KB Output is correct
9 Correct 8 ms 22872 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 11 ms 23068 KB Output is correct
4 Correct 10 ms 23056 KB Output is correct
5 Correct 9 ms 23064 KB Output is correct
6 Correct 7 ms 23128 KB Output is correct
7 Correct 8 ms 22876 KB Output is correct
8 Correct 8 ms 23052 KB Output is correct
9 Correct 8 ms 22872 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 11 ms 22876 KB Output is correct
13 Correct 8 ms 23064 KB Output is correct
14 Correct 9 ms 22876 KB Output is correct
15 Correct 7 ms 22876 KB Output is correct
16 Correct 9 ms 23060 KB Output is correct
17 Correct 8 ms 22872 KB Output is correct
18 Correct 8 ms 22876 KB Output is correct
19 Correct 228 ms 101508 KB Output is correct
20 Correct 234 ms 102188 KB Output is correct
21 Correct 232 ms 102480 KB Output is correct
22 Correct 181 ms 102484 KB Output is correct
23 Correct 187 ms 102228 KB Output is correct
24 Correct 180 ms 102272 KB Output is correct
25 Correct 194 ms 101968 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 11 ms 23068 KB Output is correct
4 Correct 10 ms 23056 KB Output is correct
5 Correct 9 ms 23064 KB Output is correct
6 Correct 7 ms 23128 KB Output is correct
7 Correct 8 ms 22876 KB Output is correct
8 Correct 8 ms 23052 KB Output is correct
9 Correct 8 ms 22872 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 9 ms 23064 KB Output is correct
13 Correct 8 ms 22876 KB Output is correct
14 Correct 9 ms 22876 KB Output is correct
15 Correct 8 ms 22888 KB Output is correct
16 Correct 8 ms 22872 KB Output is correct
17 Correct 8 ms 22876 KB Output is correct
18 Correct 8 ms 22876 KB Output is correct
19 Correct 209 ms 5860 KB Output is correct
20 Correct 46 ms 5840 KB Output is correct
21 Correct 43 ms 4688 KB Output is correct
22 Correct 50 ms 5332 KB Output is correct
23 Correct 43 ms 4692 KB Output is correct
24 Correct 125 ms 4728 KB Output is correct
25 Correct 20 ms 4700 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 4952 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 22 ms 4716 KB Output isn't correct
3 Halted 0 ms 0 KB -