제출 #1145199

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1145199		arafatenok	Trampoline (info1cup20_trampoline)	C++17	0 / 100	1454 ms	1114112 KiB

trampoline

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second
using namespace std;

const int mod = 1e9 + 7;
const int N = 2e3 + 507;
const int MAX = 1e9;
const int inf = 1e18;

int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

char x[N][N];

int r, c, n;

set < pair < int, int > > ans[N][N];

void solve() {
    cin >> r >> c >> n;
    for(int i = 1; i <= r; i++){
        for(int j = 1; j <= c; j++){
            x[i][j] = 'b';
        }
    }
    for(int i = 1; i <= n; i++){
        int x1, y1;
        cin >> x1 >> y1;
        x[x1][y1] = 'g';
    }
    for(int i = 1; i <= r; i++){
        for(int j = 1; j <= c; j++){
            if(i != 1 && x[i - 1][j] == 'g'){
                for(auto st : ans[i - 1][j]){
                    ans[i][j].insert(st);
                }
            }
            if(j != 1){
                for(auto st : ans[i][j - 1]){
                    ans[i][j].insert(st);
                }
            }
            ans[i][j].insert({i, j});
        }
    }
    int q;
    cin >> q;
    while(q--){
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if(ans[x2][y2].find({x1, y1}) != ans[x2][y2].end()){
            cout << "Yes" << xa;
        }
        else cout << "No" << xa;
    }
}

signed main() {
    gold;
    //freopen("sum2.in", "r", stdin);
    //freopen("sum2.out", "w", stdout);
    int t = 1;
    int ti = 1;
    //cin >> t;
    while (t--) {
        //cout << "Case " << ti << ": ";
        solve();
        ti++;
    }
}

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