# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523871 | 2022-02-08T10:21:59 Z | iskhakkutbilim | Trampoline (info1cup20_trampoline) | C++14 | 435 ms | 1048580 KB |
// Author: Tazhibaev Iskhak #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; typedef tree<pair<int, int> ,null_type,less< pair<int, int> >,rb_tree_tag, tree_order_statistics_node_update> ordered_set; const long double pi = acos((long double) - 1.0); const double eps = (double)1e-9; const int INF = 1e9 + 7; #define ff first #define ss second #define ll long long #define ld long double #define pb push_back void usaco( string filename){ freopen((filename+".in").c_str(), "r", stdin); freopen((filename+".out").c_str(), "w", stdout); } int r, c, n; int in(int i, int j){ if(i >= 1 and i <= r and j >= 1 and j <= c) return 1; return 0; } main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> r >> c >> n; set< pair<int, int> > st; vector<int> g[r + 1]; for(int i = 0;i < n; i++){ int x, y; cin >> x >> y; st.insert({x, y}); } for(auto it : st){ g[it.ff].push_back(it.ss); } int T; cin >> T; while(T--){ pair<int, int> start; cin >> start.ff >> start.ss; pair<int, int> end; cin >> end.ff >> end.ss; int x, y; if(end.ff == start.ff and end.ss >= end.ff){ cout << "Yes" << "\n"; continue; }else if(end.ff < start.ff ){ cout << "No" << "\n"; continue; }else if(end.ss < start.ss){ cout << "No" << "\n"; continue; } x = start.ff; y = start.ss; while(x != end.ff and x <= r and y <= c){ int L = lower_bound(g[x].begin(), g[x].end(), y) - g[x].begin(); if(L >= g[x].size()) break; y = g[x][L]; x++; if(y >= end.ss) break; } if(x == end.ff and y <= end.ss) cout << "Yes"; else cout << "No"; cout << "\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 720 KB | 200 token(s): yes count is 21, no count is 179 |
2 | Correct | 4 ms | 840 KB | 200 token(s): yes count is 70, no count is 130 |
3 | Correct | 3 ms | 708 KB | 197 token(s): yes count is 25, no count is 172 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 173 ms | 11148 KB | 4000 token(s): yes count is 99, no count is 3901 |
2 | Correct | 173 ms | 12868 KB | 4000 token(s): yes count is 91, no count is 3909 |
3 | Correct | 164 ms | 12164 KB | 4000 token(s): yes count is 4000, no count is 0 |
4 | Incorrect | 236 ms | 12916 KB | expected YES, found NO [544th token] |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 429 ms | 1048580 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 435 ms | 1048580 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 371 ms | 1048580 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |