Submission #1207858

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207858		dksnfjkfnwkfw	Event Hopping (BOI22_events)	C++20	0 / 100	1597 ms	48336 KiB

events

#include <bits/stdc++.h>
using namespace std;

#define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);}
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define ins insert
#define pb push_back
#define el cout << endl
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++)
#define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--)


using ll = long long;
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;

const int N = 1e6 + 9;
const int mod = 1e9 + 7;
const ll INF = 1e18 + 7;
const int base = 31;
const int LOG = 20;
const ll MOD = 1e9 + 7;

int mul(int x, int y) {return 1LL * x * y % mod;}
int calPw(int x, int y)
{
    int ans = 1;
    while(y)
    {
        if (y&1) ans = 1LL * ans * x % mod;
        x = 1LL * x * x % mod;
        y >>= 1;
    }
    return ans;
}
int d4x[4] = {1, 0, -1, 0};
int d4y[4] = {0, 1, 0, -1};
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
///Author: Le Chi Thien Luong The Vinh high school 2008
///code
template<class X, class Y>
bool minimize(X &x , Y y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x , Y y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool add(X &x , Y y){
    if((x + y ) >= mod){
        ll tmp  = x + y;
        x = tmp - mod;
        return true;
    }
    return false;
}
void Solve(){

}
int n, dp[5005][5005], q;
int ans[N];
pii a[N];
vector<pii>p[N];
vector<int>adj[N];
void bfs(int x){
    FOR(i, 1, n)dp[x][i] = mod;
        dp[x][x] = 0;
        queue<int>q;
        q.push(x);
        while(q.size()){
            int u = q.front();
            q.pop();
            for(int v : adj[u]){
                if(dp[x][v] == mod){
                    dp[x][v] = dp[x][u] + 1;
                    q.push(v);
                }
            }
        }
}
void Read(){
    cin >> n >> q;
    FOR(i, 1, n)cin >> a[i].fi >> a[i].se;
    FOR(i, 1, n){
        FOR(j, 1, n){
            if(i != j){
                if(a[j].fi <= a[i].se && a[i].se <= a[j].se){
                    adj[i].push_back(j);
                }
            }
        }
    }
    FOR(i, 1, q){
        int u, v;
        cin >> u >> v;
        if(dp[u][v] == mod){
            bfs(u);
        }
        if(dp[u][v] == mod){
            cout << "impossible" << endl;
        }
        else cout << dp[u][v] << endl;
    }
}



int main()
{
    sonic;

    int TEST = 1;
   // cin >> TEST;
    while(TEST--)
    {

        Read();
        Solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30