oj.uz

답안 #525348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525348 2022-02-11T11:54:57 Z ksu2009en Trampoline (info1cup20_trampoline) C++14
23 / 100
 2000 ms 18372 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll n, m, k, t;

ll d[1007][1007];
char a[1007][1007];

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;

    if(n > 5007 || m > 5007){
        map<ll, set<ll>>mp;
        for(int i = 0; i < k; i++){
            ll o, p;
            cin >> o >> p;

            mp[o].insert(p);
        }

        cin >> t;

        while(t--){
            ll x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;

            if(y2 < y1){
                cout << "No" << endl;
                continue;
            }

            auto u = lower_bound(mp[x1].begin(), mp[x1].end(), y1);

            if(u == mp[x1].end())
                cout << "No" << endl;
            else{
                ll p = *u;

                if(p > y2)
                    cout << "No" << endl;
                else
                    cout << "Yes" << endl;
            }

        }
        return 0;
    }

    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 = 1; i <= n; i++){
            for(int j = 1; j <= m; 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.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 1612 KB 200 token(s): yes count is 21, no count is 179
2 Correct 27 ms 1228 KB 200 token(s): yes count is 70, no count is 130
3 Correct 26 ms 1612 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 93 ms 18372 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2074 ms 9676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 37 ms 436 KB expected NO, found YES [17th token]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 963 ms 18176 KB expected NO, found YES [23rd token]
2 Halted 0 ms 0 KB -