oj.uz

Submission #1112925

# Submission time Handle Problem Language Result Execution time Memory
1112925 2024-11-15T09:21:13 Z Aviansh Curtains (NOI23_curtains) C++17
0 / 100
 1500 ms 932 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});
        events[b].push_back({a,b});
    }
    while(q--){
        int a,b;
        cin >> a >> b;
        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()==0){
                work=false;
                break;
            }
            minima=max(minima,mins.top());
            while(mins.size()&&mins.top()==i){
                mins.pop();
            }
        }
        if(minima==b&&work){
            cout << "YES\n";
        }
        else{
            cout << "NO\n";
        }
    }
    return 0;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 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 336 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 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 122 ms 592 KB Output is correct
6 Correct 5 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Execution timed out 1552 ms 932 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 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 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -