oj.uz

Submission #898407

# Submission time Handle Problem Language Result Execution time Memory
898407 2024-01-04T15:51:18 Z vjudge1 Passport (JOI23_passport) C++17
0 / 100
 2000 ms 8128 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
 
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define str string
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define F first
#define S second
#define all(x) x.begin() , x.end()
#define setpr(x) cout << fixed << setprecision(x) 
#define endl '\n'
 
const int inf = INT_MAX;
const ld eps = 1e-9 , pi = acos(-1.0);
const ll mod = 1e9 + 7; // 998244353;
const int dx[4]{1 , 0 , -1 , 0} , dy[4]{0 , 1 , 0 , -1};

vector<pair<int , int>> bu;
int n;

int bfs(int x){
    vector<int> dist(n + 1 , -1) , qat(n + 1 , -1);
    queue<int> q;
    auto add = [&](int j , int i , int p){
        if(dist[i] == -1){
            dist[i] = p;
            q.push(i);
            qat[i] = j;
        }
    };
    add(x , x , 0);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        for(int i = bu[u - 1].F ; i <= bu[u - 1].S ; i ++) if(u != i) add(u , i , dist[u] + 1);
    }
    if(dist[1] == -1 || dist[n] == -1) return -1;
    unordered_set<int> st1;
    int h1 = 1 , h2 = n , h = 0;
    while(h1 != x){
        h1 = qat[h1];
        st1.insert(h1);
        h ++;
        if(h > 100) break;
    }
    h = 0;
    while(h2 != x){
        h2 = qat[h2];
        st1.insert(h2);
        h ++;
        if(h > 100) break;
    }
    return st1.size();
}

void solution(){
    cin >> n;
    bu.resize(n);
    for(int i = 0 ; i < n ; i ++) cin >> bu[i].F >> bu[i].S;
    int q; cin >> q;
    while(q --){
        int x; cin >> x;
        cout << bfs(x) << endl; 
    }
}  
 
signed main(){
    IOS;
    int t = 1; // cin >> t;
    while(t --) solution();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Execution timed out 2049 ms 8128 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Execution timed out 2049 ms 8128 KB Time limit exceeded
5 Halted 0 ms 0 KB -