# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685908 | 2023-01-25T03:53:25 Z | Alihan_8 | Trampoline (info1cup20_trampoline) | C++17 | 2000 ms | 19444 KB |
#include <bits/stdc++.h> // include <ext/pb_ds/assoc_container.hpp> // include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define all(x) x.begin(), x.end() #define pb push_back // define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> #define mpr make pair #define ln '\n' void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} #define int long long signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int r, c, n; cin >> r >> c >> n; map <int,set<int>> st; for ( int i = 1; i <= n; i++ ){ int x, y; cin >> x >> y; st[--x].insert(--y); } int t; cin >> t; while ( t-- ){ int xs, ys, xe, ye; cin >> xs >> ys >> xe >> ye; if ( xs > xe ){ cout << "No\n"; continue; } xs--, xe--, ys--, ye--; bool flag = true; while ( xs < xe ){ auto it = st[xs].lower_bound(ys); if ( it == st[xs].end() or *it > ye ){ flag = false; break; } ys = *it; xs++; } if ( flag ) cout << "Yes\n"; else cout << "No\n"; } cout << '\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 724 KB | 200 token(s): yes count is 21, no count is 179 |
2 | Correct | 4 ms | 852 KB | 200 token(s): yes count is 70, no count is 130 |
3 | Correct | 3 ms | 596 KB | 197 token(s): yes count is 25, no count is 172 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 156 ms | 11624 KB | 4000 token(s): yes count is 99, no count is 3901 |
2 | Correct | 181 ms | 11220 KB | 4000 token(s): yes count is 91, no count is 3909 |
3 | Correct | 472 ms | 11060 KB | 4000 token(s): yes count is 4000, no count is 0 |
4 | Correct | 455 ms | 11244 KB | 4000 token(s): yes count is 1991, no count is 2009 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 288 ms | 12888 KB | 200000 token(s): yes count is 110486, no count is 89514 |
2 | Correct | 292 ms | 11368 KB | 200000 token(s): yes count is 114664, no count is 85336 |
3 | Correct | 310 ms | 11548 KB | 200000 token(s): yes count is 86232, no count is 113768 |
4 | Correct | 337 ms | 12480 KB | 200000 token(s): yes count is 94603, no count is 105397 |
5 | Correct | 369 ms | 12488 KB | 200000 token(s): yes count is 94148, no count is 105852 |
6 | Correct | 378 ms | 18600 KB | 200000 token(s): yes count is 97163, no count is 102837 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 852 KB | expected NO, found YES [16th token] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2058 ms | 19444 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |