oj.uz

답안 #807597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807597 2023-08-04T20:03:20 Z SorahISA Trampoline (info1cup20_trampoline) C++17
73 / 100
 2000 ms 28212 KB 
#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

void solve() {
    int R, C, N; cin >> R >> C >> N;
    
    map<int, set<int>> green;
    for (int i = 0, r, c; i < N; ++i) cin >> r >> c, green[r].ee(c);
    
    int T; cin >> T;
    for (int q = 1; q <= T; ++q) {
        int sx, sy, ex, ey; cin >> sx >> sy >> ex >> ey;
        if (sx > ex or (sx == ex and sy > ey)) {cout << "No" << "\n"; goto meow;}
        if (sx == ex) {cout << "Yes" << "\n"; goto meow;}
        
        for (int r = sx, c = sy; r < ex; ++r) {
            if (!green.count(r)) {cout << "No" << "\n"; goto meow;}
            auto it = green[r].lower_bound(c);
            if (it == end(green[r])) {cout << "No" << "\n"; goto meow;}
            c = *it;
            if (c > ey) {cout << "No" << "\n"; goto meow;}
        }
        cout << "Yes" << "\n";
        
        meow:;
    }
}

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        solve();
    }
    
    return 0;
}

#else

#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #define int int64_t
// #define double __float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "%sAt [%s], line %d: (%s) = ", "\u001b[33m", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), fprintf(stderr, "%s", "\u001b[0m")
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}

#endif

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 11792 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 150 ms 11820 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 437 ms 11288 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 471 ms 11804 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 22024 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 226 ms 22220 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 228 ms 21952 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 238 ms 22340 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 246 ms 22340 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 300 ms 28212 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 9 ms 852 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 5 ms 1348 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 5 ms 852 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 264 ms 1000 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 4 ms 852 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

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