oj.uz

Submission #896358

# Submission time Handle Problem Language Result Execution time Memory
896358 2024-01-01T10:09:39 Z vjudge1 Temperature (POI11_tem) C++17
100 / 100
 572 ms 9612 KB 
    #include <bits/stdc++.h>
    using namespace std;
     
    const int maxN = 1e6 + 10;
    const int inf = 0x3f3f3f3f;
    int a[maxN], b[maxN];
     
    signed main(){
        int n;
        cin >> n;
        for (int i = 1; i <= n; ++i){
            cin >> a[i] >> b[i];
        }
        deque <int> Q;
        int i = 1, j = 0;
        b[n + 1] = -inf;
        int ans = 1;
        while (i <= n){
            while (!Q.empty() && Q.front() < i) Q.pop_front();
            if (j < i){
                j = i;
                Q.push_back(i);
            }
            while (j <= n && a[Q.front()] <= b[j + 1]){              
                ++j;
                while (!Q.empty() && a[Q.back()] <= a[j]) Q.pop_back();
                Q.push_back(j);
     
            }
            ans = max(ans, j - i + 1);
            ++i;
        }
        cout << ans;
    }

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2396 KB Output is correct
2 Correct 4 ms 2520 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 6752 KB Output is correct
2 Correct 151 ms 6744 KB Output is correct
3 Correct 166 ms 6992 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 7004 KB Output is correct
2 Correct 360 ms 7260 KB Output is correct
3 Correct 366 ms 8272 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 456 ms 7564 KB Output is correct
2 Correct 391 ms 7516 KB Output is correct
3 Correct 471 ms 8536 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 7788 KB Output is correct
2 Correct 390 ms 7516 KB Output is correct
3 Correct 572 ms 9612 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 464 ms 7764 KB Output is correct
2 Correct 356 ms 7844 KB Output is correct
3 Correct 368 ms 7504 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 7504 KB Output is correct
2 Correct 231 ms 7512 KB Output is correct
3 Correct 233 ms 7512 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 7252 KB Output is correct
2 Correct 254 ms 7528 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 7016 KB Output is correct
2 Correct 566 ms 9296 KB Output is correct

Subtask #12
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 7004 KB Output is correct
2 Correct 506 ms 9040 KB Output is correct