답안 #826938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826938 2023-08-16T07:11:21 Z t6twotwo Passport (JOI23_passport) C++17
0 / 100
25 ms 4308 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<int> L(N), R(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;
        X--;
        int ans = 0;
        for (int f = R[0]; X < N - 1;) {
            ans++;
            if (X == f) {
                ans = -1;
                break;
            }
            for (int i = f - X; i; i--, X++) {
                f = max(f, R[X]);
            }
        }
        cout << ans << "\n";
    }
    return 6/22;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 252 KB Output is correct
4 Correct 25 ms 4308 KB Output is correct
5 Incorrect 24 ms 4308 KB Output isn't correct
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 252 KB Output is correct
4 Correct 25 ms 4308 KB Output is correct
5 Incorrect 24 ms 4308 KB Output isn't correct
6 Halted 0 ms 0 KB -