oj.uz

답안 #675281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675281 2022-12-27T03:48:09 Z jahsdwaijsd Trampoline (info1cup20_trampoline) C++14
0 / 100
 315 ms 28524 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) {
            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;
        }
        assert(dis < mxN);
        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";
        */
        cout << "Yes\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
0 / 23.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

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