# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313867 | 2020-10-17T07:44:02 Z | BeanZ | Temperature (POI11_tem) | C++14 | 268 ms | 39288 KB |
// I_Love_LPL #include <bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' const int N = 1e6 + 5; ll x[N], y[N]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); if (fopen("A.inp", "r")){ freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout); } ll n; cin >> n; for (int i = 1; i <= n; i++){ cin >> y[i] >> x[i]; } deque<ll> dq; ll ans = 1, pos = 0; for (int i = 1; i <= n; i++){ while (dq.size()){ if (y[i] >= y[dq.back()]) dq.pop_back(); else break; } dq.push_back(i); while (dq.size()){ if (y[dq.front()] > x[i]){ pos = dq.front(); dq.pop_front(); } else break; } ans = max(ans, i - pos); } cout << ans; } /* */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 512 KB | Output is correct |
2 | Correct | 3 ms | 640 KB | Output is correct |
3 | Correct | 3 ms | 640 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 78 ms | 10488 KB | Output is correct |
2 | Correct | 96 ms | 12204 KB | Output is correct |
3 | Correct | 101 ms | 13560 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 161 ms | 22264 KB | Output is correct |
2 | Correct | 173 ms | 24056 KB | Output is correct |
3 | Correct | 186 ms | 26232 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 208 ms | 28024 KB | Output is correct |
2 | Correct | 181 ms | 24824 KB | Output is correct |
3 | Correct | 219 ms | 31864 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 234 ms | 32504 KB | Output is correct |
2 | Correct | 183 ms | 25464 KB | Output is correct |
3 | Runtime error | 262 ms | 39288 KB | Memory limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 214 ms | 30200 KB | Output is correct |
2 | Correct | 174 ms | 24312 KB | Output is correct |
3 | Correct | 180 ms | 24824 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 132 ms | 18528 KB | Output is correct |
2 | Correct | 131 ms | 18680 KB | Output is correct |
3 | Correct | 135 ms | 18588 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 137 ms | 17272 KB | Output is correct |
2 | Correct | 136 ms | 19192 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 193 ms | 26752 KB | Output is correct |
2 | Runtime error | 268 ms | 38392 KB | Memory limit exceeded |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 190 ms | 25720 KB | Output is correct |
2 | Runtime error | 230 ms | 34296 KB | Memory limit exceeded |