제출 #525305

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525305		ksu2009en	Trampoline (info1cup20_trampoline)	C++14	23 / 100	2085 ms	71560 KiB

trampoline

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll n, m, k, t;

ll d[5007][5007];
char a[5007][5007];

void clear_me(){
    for(int i = 0; i <= n; i++)
        for(int j = 0; j <= m;j ++)
            d[i][j] = 0;
}

int main(){
    cin >> n >> m >> k;

    for(int i = 0; i <= n; i++)
        for(int j = 0; j <= m; j++)
            a[i][j] = 'B';

    for(int i = 0; i < k; i++){
        ll aa, bb;
        cin >> aa >> bb;

        a[aa][bb] = 'G';
    }

    cin >> t;

    while(t--){
        clear_me();

        ll x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;

        d[x1][y1] = 1;

        for(int i = min(x1, x2); i <= max(x1, x2); i++){
            for(int j = min(y1, y2); j <= max(y1, y2); j++){
                if(d[i][j - 1] == 1 || (a[i - 1][j] == 'G' && d[i - 1][j] == 1))
                    d[i][j] = 1;
            }
        }

        if(d[x2][y2] == 1)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }


    return 0;
}

• Subtask 1: 23 / 23
• Subtask 2: 0 / 20
• Subtask 3: 0 / 11
• Subtask 4: 0 / 19
• Subtask 5: 0 / 27