oj.uz

Submission #1112942

# Submission time Handle Problem Language Result Execution time Memory
1112942 2024-11-15T09:46:26 Z Aviansh Curtains (NOI23_curtains) C++17
0 / 100
 1500 ms 6324 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[n+5][n+5];
    for(int a = 1;a<=n;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;
                break;
            }
            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 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 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 78 ms 4472 KB Output is correct
6 Correct 11 ms 4432 KB Output is correct
7 Correct 10 ms 4432 KB Output is correct
8 Correct 299 ms 6324 KB Output is correct
9 Execution timed out 1545 ms 5368 KB Time limit exceeded
10 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 -