# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
951684 |
2024-03-22T10:25:49 Z |
vjudge1 |
Temperature (POI11_tem) |
C++17 |
|
175 ms |
38632 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxN = 1e6 + 5;
int n;
int a[maxN], b[maxN];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("A.INP", "r", stdin);
//freopen("A.OUT", "w", stdout);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
}
deque<int> dq;
int res = 1;
int ind = 0;
for (int i = 1; i <= n; i++) {
while (!dq.empty() && a[dq.front()] > b[i]) {
ind++;
if (dq.front() == ind) {
dq.pop_front();
}
}
while (!dq.empty() && a[dq.back()] < a[i]) {
dq.pop_back();
}
dq.push_back(i);
res = max(res, i - ind);
}
cout << res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2516 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2904 KB |
Output is correct |
2 |
Correct |
2 ms |
2652 KB |
Output is correct |
3 |
Correct |
3 ms |
2652 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
49 ms |
13652 KB |
Output is correct |
2 |
Correct |
52 ms |
14616 KB |
Output is correct |
3 |
Correct |
69 ms |
18292 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
105 ms |
25288 KB |
Output is correct |
2 |
Correct |
110 ms |
26324 KB |
Output is correct |
3 |
Correct |
109 ms |
28532 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
127 ms |
30548 KB |
Output is correct |
2 |
Correct |
119 ms |
26728 KB |
Output is correct |
3 |
Runtime error |
136 ms |
33792 KB |
Memory limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
149 ms |
33392 KB |
Memory limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
155 ms |
31892 KB |
Output is correct |
2 |
Correct |
118 ms |
27472 KB |
Output is correct |
3 |
Correct |
114 ms |
26608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
79 ms |
20728 KB |
Output is correct |
2 |
Correct |
89 ms |
22644 KB |
Output is correct |
3 |
Correct |
82 ms |
20808 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
92 ms |
19968 KB |
Output is correct |
2 |
Correct |
86 ms |
22768 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
125 ms |
30104 KB |
Output is correct |
2 |
Runtime error |
175 ms |
38632 KB |
Memory limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
127 ms |
29524 KB |
Output is correct |
2 |
Runtime error |
155 ms |
35312 KB |
Memory limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |