oj.uz

Submission #525146

# Submission time Handle Problem Language Result Execution time Memory
525146 2022-02-10T21:20:53 Z dron_rp Trampoline (info1cup20_trampoline) C++14
0 / 100
 2000 ms 13900 KB 
#include <bits/stdc++.h>
using namespace std;

int r, c, n;

set<pair<int, int>> green;

bool dfs(int x, int y, int xf, int yf){
    if (x == xf && y == yf){
        return true;
    }
    if (x == r && y == c) return false;
    bool canReach = false;
    if (green.count({x, y})){
        if (x+1 <= r) canReach |= dfs(x+1, y, xf, yf);
        if (y+1 <= c) canReach |= dfs(x, y+1, xf, yf);
    } else{
        if (y+1 <= c) canReach |= dfs(x, y+1, xf, yf);
    }
    return canReach;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> r >> c >> n;
    int x, y;
    for (int i = 0; i<n; i++){
        cin >> x >> y;
        green.insert({x, y});
    }
    int t;
    cin >> t;
    while (t--){
        int xStart, yStart, xEnd, yEnd;
        cin >> xStart >> yStart >> xEnd >> yEnd;
        cout << ((dfs(xStart, yStart, xEnd, yEnd)) ? "Yes\n" : "No\n");
    }
}

Subtask #1
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2063 ms 716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 11580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2083 ms 13636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2057 ms 716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2075 ms 13900 KB Time limit exceeded
2 Halted 0 ms 0 KB -