oj.uz

답안 #675303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675303 2022-12-27T03:53:41 Z vjudge1 Trampoline (info1cup20_trampoline) C++17
100 / 100
 676 ms 40932 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#define taskname "bai3"
#define all(x) x.begin(), x.end()
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
using namespace std;

const int mxN = 2e5 + 5;
const int base = 1e9 + 1;
const int mod = 1e9 + 7;
const ll oo = 1e18;

int r, c, t, q, lg[mxN], pw[25];
int sparse_table[25][mxN];
vector<pii> v;
map<int, vector<pii>> mp;

bool sortbysec(const pii &a, const pii &b) {
    if(a.ss != b.ss) return (a.ss < b.ss);
    return (a.ff < b.ff);
}

void solve() {
    cin >> r >> c >> t;

    lg[1] = 0; pw[0] = 1;
    for(int i = 2; i < mxN; ++i) lg[i] = lg[i >> 1] + 1;
    for(int i = 1; i < 20; ++i) pw[i] = pw[i - 1] * 2;

    for(int i = 1; i <= t; ++i) {
        int u, v1; cin >> u >> v1;
        v.pb({u, v1});
    }
    sort(all(v));
    
    for(int i = 0; i < t; ++i)
        mp[v[i].ff].pb({v[i].ss, i});
    
    sparse_table[0][t] = t;
    for(int i = 0; i < t; ++i) {
        if(mp.find(v[i].ff + 1) == mp.end()) {
            sparse_table[0][i] = t;
            continue;
        }
        auto it = lower_bound(all(mp[v[i].ff + 1]), make_pair(v[i].ss, 0));
        if(it == mp[v[i].ff + 1].end()) sparse_table[0][i] = t;
        else sparse_table[0][i] = (*it).ss;
    }
    for(int i = 1; i < 20; ++i) {
        sparse_table[i][t] = t;
        for(int j = 0; j < t; ++j) {
            sparse_table[i][j] = sparse_table[i - 1][sparse_table[i - 1][j]];
        }
    }

    cin >> q;
    while(q--) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if(x1 > x2) {
            cout << "No\n";
            continue;
        }
        if(x1 == x2) {
            if(y1 <= y2) {
                cout << "Yes\n";
            }
            else cout << "No\n";
            continue;
        }
        int dis = x2 - x1;
        if(dis > (int)mp.size()) {
            cout << "No\n";
            continue;
        }
        if(mp.find(x1) == mp.end()) {
            cout << "No\n";
            continue;
        }
        
        auto it = lower_bound(all(mp[x1]), make_pair(y1, 0));
        if(it == mp[x1].end()) {
            cout << "No\n";
            continue;
        }
        int st = (*it).ss;  --dis;
        while(dis) {
            int tmp = lg[dis];
            st = sparse_table[tmp][st];
            dis -= pw[tmp];
        }
        
        if(st == t) {
            cout << "No\n";
            continue;
        }
        pii tmp1 = v[st];
        if(tmp1.ss <= y2) {
            cout << "Yes\n";
        }
        else cout << "No\n";
    }
}

signed main() {
#ifdef CDuongg
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
    auto end = chrono::high_resolution_clock::now();
    cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
    cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 20972 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 89 ms 21004 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 86 ms 20320 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 118 ms 20944 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 21576 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 252 ms 21124 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 228 ms 20724 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 287 ms 21368 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 281 ms 21296 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 344 ms 27256 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

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

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 492 ms 28492 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 473 ms 23112 KB 200000 token(s): yes count is 161254, no count is 38746
3 Correct 289 ms 20748 KB 200000 token(s): yes count is 117455, no count is 82545
4 Correct 676 ms 40932 KB 200000 token(s): yes count is 182118, no count is 17882
5 Correct 387 ms 28896 KB 200000 token(s): yes count is 167565, no count is 32435
6 Correct 224 ms 21332 KB 200000 token(s): yes count is 156797, no count is 43203
7 Correct 218 ms 21428 KB 200000 token(s): yes count is 156797, no count is 43203
8 Correct 242 ms 20664 KB 200000 token(s): yes count is 122100, no count is 77900
9 Correct 457 ms 27252 KB 200000 token(s): yes count is 139670, no count is 60330
10 Correct 418 ms 27252 KB 200000 token(s): yes count is 165806, no count is 34194
11 Correct 599 ms 33732 KB 200000 token(s): yes count is 175646, no count is 24354
12 Correct 223 ms 22132 KB 200000 token(s): yes count is 134695, no count is 65305
13 Correct 203 ms 21508 KB 200000 token(s): yes count is 126733, no count is 73267
14 Correct 286 ms 21280 KB 200000 token(s): yes count is 155290, no count is 44710
15 Correct 214 ms 21184 KB 200000 token(s): yes count is 129674, no count is 70326