oj.uz

답안 #761463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761463 2023-06-19T17:29:30 Z Filya Trampoline (info1cup20_trampoline) C++14
73 / 100
 2000 ms 21552 KB 
//♥God will make a way♥

//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "Yes" << '\n'; else cout << "No" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
pii a[200005];
map<int, vi> ma;
int main() {
    fastio;
    int r, c, n, x, y, x1, y1, t; 
    cin >> r >> c >> n;
    fri(n) cin >> a[i].ff >> a[i].ss;
    sort(alll(a));
    fri(n) ma[a[i].ff].pb(a[i].ss);
    cin >> t;
    while(t--) {
        cin >> x >> y >> x1 >> y1;
        if(x > x1 || y > y1) {
            ci(0);
        } else if(x1 - x > n+1) {
            ci(0);
        }
        else {
            bool f = 1;
            while(x != x1) {
                auto it = lb(all(ma[x]), y);
                if(it == ma[x].end()) {
                    f = 0;
                    break;
                }
                y = *it;
                x++;
            }
            ci(f && y <= y1);
        }
    }
    return 0;
}

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 3292 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 83 ms 5096 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 195 ms 4480 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 423 ms 5212 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 3524 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 139 ms 15304 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 143 ms 15096 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 170 ms 15580 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 163 ms 15516 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 202 ms 21552 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 7 ms 596 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 5 ms 1236 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 4 ms 596 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 296 ms 832 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 4 ms 724 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

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