oj.uz

Submission #1112939

# Submission time Handle Problem Language Result Execution time Memory
1112939 2024-11-15T09:44:08 Z Aviansh Curtains (NOI23_curtains) C++17
20 / 100
 300 ms 36176 KB 
#include <bits/stdc++.h>

using namespace std;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,q;
    cin >> n >> m >> q;
    vector<array<int,2>>events[n+1];
    for(int i = 0;i<m;i++){
        int a,b;
        cin >> a >> b;
        events[a].push_back({a,b});
    }
    bool ans[2][n+5];
    for(int a = 1;a<=1;a++){
        int b=n;
        int minima = a;
        priority_queue<int,vector<int>,greater<int>>mins;
        bool work = 1;
        for(int i = a;i<=b;i++){
            for(array<int,2>a:events[i]){
                mins.push(a[1]);
            }
            if(mins.size())
                minima=max(minima,mins.top());
            if(mins.size()==0){
                work=0;
            }
            if(minima==i&&work){
                ans[a][i]=1;
            }
            else{
                ans[a][i]=0;
            }
            while(mins.size()&&mins.top()==i){
                mins.pop();
            }
        }
    }
    while(q--){
        int a,b;
        cin >> a >> b;
        cout << (ans[a][b] ? "YES\n" : "NO\n");
    }
    return 0;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 760 KB Output is correct
8 Correct 56 ms 5704 KB Output is correct
9 Correct 64 ms 6896 KB Output is correct
10 Correct 175 ms 16104 KB Output is correct
11 Correct 63 ms 5960 KB Output is correct
12 Correct 45 ms 7172 KB Output is correct
13 Correct 43 ms 7172 KB Output is correct
14 Correct 37 ms 7248 KB Output is correct
15 Correct 37 ms 7260 KB Output is correct
16 Correct 36 ms 7248 KB Output is correct
17 Correct 35 ms 7248 KB Output is correct
18 Correct 279 ms 35568 KB Output is correct
19 Correct 300 ms 35824 KB Output is correct
20 Correct 289 ms 36176 KB Output is correct
21 Correct 255 ms 35912 KB Output is correct
22 Correct 283 ms 35956 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -