| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1299670 | dgi | Obstacles for a Llama (IOI25_obstacles) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
int t[200001], h[200001];
void initialize(std::vector<int> T, std::vector<int> H) {
return;
}
bool can_reach(int L, int R, int S, int D) {
return false;
}
int main(){
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> t[i];
for (int i = 0; i < m; i++)
cin >> h[i];
cin >> q;
while (q--){
int l, r, s, d;
cin >> l >> r >> s >> d;
cout << 0 << endl;
}
}
