답안 #888807

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
888807	2023-12-18T08:04:02 Z	vjudge1	Passport (JOI23_passport)	C++14	16 / 100	2000 ms	50260 KB

passport

#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T> 
bool chmin(S &a, const T &b) {
    return (a > b ? (a = b) == b : false);
}
template<class S, class T> 
bool chmax(S &a, const T &b) {
    return (a < b ? (a = b) == b : false);
}
const int inf = 1e9;
const ll INF = 1e18;
const int mod = 998244353;
const int N =  2500;

int n, l[N], r[N];
vector<vector<int>> d(N, vector<int> (N, inf));

void bfs(int init) {
    queue<pair<int, int>> q;
    d[l[init]][r[init]] = 1;
    q.push({l[init], r[init]});
    while (!q.empty()) {
        auto [L, R] = q.front(); 
        q.pop();
        for (int i = L; i <= R; ++i) {
            int new_l = min(L, l[i]), new_r = max(R, r[i]);
            if (chmin(d[new_l][new_r], d[L][R] + 1)) {
                q.push({new_l, new_r});
            }
        }
    }
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> l[i] >> r[i];
        l[i]--, r[i]--;
    }
    int q;
    cin >> q;
    while (q--) {
        int x;
        cin >> x;
        bfs(--x);
        cout << (d[0][n - 1] == inf ? -1 : d[0][n - 1]) << '\n';
    }
}

Compilation message

passport.cpp: In function 'void bfs(int)':
passport.cpp:28:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   28 |         auto [L, R] = q.front();
      |              ^

Subtask #1

0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	24924 KB	Output is correct
2	Correct	12 ms	24852 KB	Output is correct
3	Correct	14 ms	24920 KB	Output is correct
4	Runtime error	32 ms	50260 KB	Execution killed with signal 11
5	Halted	0 ms	0 KB	-

Subtask #2

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	24924 KB	Output is correct
2	Correct	12 ms	24924 KB	Output is correct
3	Correct	12 ms	24924 KB	Output is correct
4	Correct	12 ms	24888 KB	Output is correct
5	Correct	13 ms	24924 KB	Output is correct
6	Correct	12 ms	24924 KB	Output is correct
7	Correct	12 ms	24924 KB	Output is correct
8	Correct	12 ms	24924 KB	Output is correct
9	Correct	12 ms	24928 KB	Output is correct
10	Correct	12 ms	24924 KB	Output is correct
11	Correct	16 ms	24924 KB	Output is correct
12	Correct	13 ms	24924 KB	Output is correct
13	Correct	12 ms	24968 KB	Output is correct
14	Correct	12 ms	24924 KB	Output is correct
15	Correct	14 ms	24924 KB	Output is correct

Subtask #3

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	24924 KB	Output is correct
2	Correct	12 ms	24924 KB	Output is correct
3	Correct	12 ms	24924 KB	Output is correct
4	Correct	12 ms	24888 KB	Output is correct
5	Correct	13 ms	24924 KB	Output is correct
6	Correct	12 ms	24924 KB	Output is correct
7	Correct	12 ms	24924 KB	Output is correct
8	Correct	12 ms	24924 KB	Output is correct
9	Correct	12 ms	24928 KB	Output is correct
10	Correct	12 ms	24924 KB	Output is correct
11	Correct	16 ms	24924 KB	Output is correct
12	Correct	13 ms	24924 KB	Output is correct
13	Correct	12 ms	24968 KB	Output is correct
14	Correct	12 ms	24924 KB	Output is correct
15	Correct	14 ms	24924 KB	Output is correct
16	Correct	1296 ms	27044 KB	Output is correct
17	Correct	1068 ms	25032 KB	Output is correct
18	Correct	33 ms	24844 KB	Output is correct
19	Correct	44 ms	24924 KB	Output is correct
20	Execution timed out	2025 ms	25020 KB	Time limit exceeded
21	Halted	0 ms	0 KB	-

Subtask #4

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	24924 KB	Output is correct
2	Correct	12 ms	24924 KB	Output is correct
3	Correct	12 ms	24924 KB	Output is correct
4	Correct	12 ms	24888 KB	Output is correct
5	Correct	13 ms	24924 KB	Output is correct
6	Correct	12 ms	24924 KB	Output is correct
7	Correct	12 ms	24924 KB	Output is correct
8	Correct	12 ms	24924 KB	Output is correct
9	Correct	12 ms	24928 KB	Output is correct
10	Correct	12 ms	24924 KB	Output is correct
11	Correct	16 ms	24924 KB	Output is correct
12	Correct	13 ms	24924 KB	Output is correct
13	Correct	12 ms	24968 KB	Output is correct
14	Correct	12 ms	24924 KB	Output is correct
15	Correct	14 ms	24924 KB	Output is correct
16	Correct	1296 ms	27044 KB	Output is correct
17	Correct	1068 ms	25032 KB	Output is correct
18	Correct	33 ms	24844 KB	Output is correct
19	Correct	44 ms	24924 KB	Output is correct
20	Execution timed out	2025 ms	25020 KB	Time limit exceeded
21	Halted	0 ms	0 KB	-

Subtask #5

0 / 46.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	24924 KB	Output is correct
2	Correct	12 ms	24852 KB	Output is correct
3	Correct	14 ms	24920 KB	Output is correct
4	Runtime error	32 ms	50260 KB	Execution killed with signal 11
5	Halted	0 ms	0 KB	-