oj.uz

Submission #714294

# Submission time Handle Problem Language Result Execution time Memory
714294 2023-03-24T08:06:17 Z vjudge1 Event Hopping (BOI22_events) C++17
10 / 100
 1178 ms 16908 KB 
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>

using namespace std;

#define ll          long long 
#define ull         unsigned long long 
#define ld          long double 
#define ui          unsigned int 
#define f           first
#define s           second
#define ins         insert
#define pb          push_back
#define mp          make_pair
#define ln          '\n'
#define int         ll
#define pii         pair<int , int> 
#define INF         LLONG_MAX
#define vv(a)       vector<a>
#define pp(a, b)    pair<a, b>
#define pq(a)       priority_queue<a>
#define qq(a)       queue<a>
#define ss(a)       set<a>
#define mss(a)      multiset<a>
#define mm(a, b)    map<a, b>
#define mmm(a , b)  multimap<a , b>
#define sz(x)       (x).size()
#define all(x)      (x).begin() , (x).end()
#define fastio                    \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

const int MAX = 1005;
vv(pii) a(MAX);
vv(vv(int)) g(MAX);
vv(vv(int)) dist(MAX , vv(int) (MAX , -1));

void BFS(int node){
    dist[node][node] = 0;
    queue<int> Q;   
    Q.push(node);
    while(!Q.empty()){
        int from = Q.front();
        Q.pop();
        for(auto to : g[from]){
            if(dist[node][to] == -1){
                dist[node][to] = dist[node][from] + 1;
                Q.push(to);
            }
        }
    }
}

void solve(){
    int n , q;
    cin >> n >> q;
    for(int i=0 ; i<n ; i++){
        cin >> a[i].f >> a[i].s;
    }   
    for(int i=0 ; i<n ; i++){
        for(int j=0 ; j<n ; j++){
            if(i != j){
                if(a[j].f <= a[i].s && a[j].s >= a[i].s){
                    g[i].pb(j);
                }
            }
        }
    }
    for(int i=0 ; i<n ; i++){
        BFS(i);
    }
    //cout << dist[0][3] << ln;
    for(int i=0 ; i<q ; i++){
        int u , v;
        cin >> u >> v;
        u--; v--;
        if(dist[u][v] == -1){
            cout << "impossible" << ln;
        }
        else{
            cout << dist[u][v] << ln;
        }
    }
}


signed main(){
    fastio

    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8276 KB Output is correct
2 Runtime error 29 ms 16620 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 19 ms 8276 KB Output is correct
4 Correct 14 ms 8276 KB Output is correct
5 Correct 21 ms 8432 KB Output is correct
6 Correct 59 ms 9812 KB Output is correct
7 Correct 168 ms 11548 KB Output is correct
8 Correct 208 ms 13632 KB Output is correct
9 Correct 1178 ms 16332 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 19 ms 8276 KB Output is correct
4 Correct 14 ms 8276 KB Output is correct
5 Correct 21 ms 8432 KB Output is correct
6 Correct 59 ms 9812 KB Output is correct
7 Correct 168 ms 11548 KB Output is correct
8 Correct 208 ms 13632 KB Output is correct
9 Correct 1178 ms 16332 KB Output is correct
10 Correct 4 ms 8276 KB Output is correct
11 Correct 4 ms 8276 KB Output is correct
12 Correct 17 ms 8312 KB Output is correct
13 Correct 14 ms 8228 KB Output is correct
14 Correct 19 ms 8276 KB Output is correct
15 Correct 60 ms 9904 KB Output is correct
16 Correct 191 ms 11552 KB Output is correct
17 Correct 210 ms 13592 KB Output is correct
18 Correct 1166 ms 16328 KB Output is correct
19 Runtime error 13 ms 16596 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 19 ms 8276 KB Output is correct
4 Correct 14 ms 8276 KB Output is correct
5 Correct 21 ms 8432 KB Output is correct
6 Correct 59 ms 9812 KB Output is correct
7 Correct 168 ms 11548 KB Output is correct
8 Correct 208 ms 13632 KB Output is correct
9 Correct 1178 ms 16332 KB Output is correct
10 Correct 4 ms 8308 KB Output is correct
11 Correct 4 ms 8276 KB Output is correct
12 Correct 19 ms 8344 KB Output is correct
13 Correct 14 ms 8348 KB Output is correct
14 Correct 21 ms 8336 KB Output is correct
15 Correct 59 ms 9812 KB Output is correct
16 Correct 167 ms 11540 KB Output is correct
17 Correct 224 ms 13652 KB Output is correct
18 Correct 1134 ms 16332 KB Output is correct
19 Runtime error 37 ms 16908 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 16628 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8276 KB Output is correct
2 Runtime error 29 ms 16620 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -