# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313869 | 2020-10-17T07:45:19 Z | BeanZ | Temperature (POI11_tem) | C++14 | 271 ms | 18808 KB |
// I_Love_LPL #include <bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' const int N = 2e6 + 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 | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 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 | 4 ms | 640 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 75 ms | 7992 KB | Output is correct |
2 | Correct | 87 ms | 9080 KB | Output is correct |
3 | Correct | 94 ms | 10104 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 160 ms | 12152 KB | Output is correct |
2 | Correct | 172 ms | 13180 KB | Output is correct |
3 | Correct | 175 ms | 15096 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 221 ms | 12792 KB | Output is correct |
2 | Correct | 173 ms | 13560 KB | Output is correct |
3 | Correct | 209 ms | 15352 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 225 ms | 14332 KB | Output is correct |
2 | Correct | 187 ms | 13816 KB | Output is correct |
3 | Correct | 259 ms | 18808 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 205 ms | 13848 KB | Output is correct |
2 | Correct | 165 ms | 14328 KB | Output is correct |
3 | Correct | 177 ms | 13816 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 131 ms | 13600 KB | Output is correct |
2 | Correct | 131 ms | 13816 KB | Output is correct |
3 | Correct | 136 ms | 13692 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 125 ms | 12888 KB | Output is correct |
2 | Correct | 134 ms | 14120 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 185 ms | 11964 KB | Output is correct |
2 | Correct | 271 ms | 17976 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 179 ms | 11640 KB | Output is correct |
2 | Correct | 231 ms | 16248 KB | Output is correct |