oj.uz

답안 #397572

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
397572 2021-05-02T12:12:38 Z MarcoMeijer Trampoline (info1cup20_trampoline) C++14
100 / 100
 688 ms 47260 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 3e5;
const int N = (1<<20);

int r,c,n,t;
int x[MX], y[MX], nxt[MX][20];
int sx[MX], sy[MX], ex[MX], ey[MX], ans[MX];
map<int,int> mp;

void program() {
    IN(r,c,n);
    RE1(i,n) IN(y[i],x[i]);
    IN(t);
    RE1(i,t) IN(sy[i],sx[i],ey[i],ex[i]);
    
    viii trampolines;
    RE1(i,n) trampolines.pb({x[i],y[i],i});
    sort(all(trampolines),greater<iii>());
    int ct=0;

    vii queries;
    RE1(i,t) queries.pb({sx[i],i});
    sort(all(queries),greater<ii>());

    RE(i,t) {
        int q = queries[i].se;
        if(sx[q] > ex[q] || sy[q] > ey[q]) {
            ans[q] = 0;
            continue;
        }
        if(sy[q] == ey[q]) {
            ans[q] = 1;
            continue;
        }
        while(ct != n) {
            int _, tramp;
            tie(_,_,tramp) = trampolines[ct];
            if(x[tramp] < sx[q]) break;
            mp[y[tramp]] = tramp;
            nxt[tramp][0] = mp[y[tramp]+1];
            REP(i,1,20) nxt[tramp][i] = nxt[nxt[tramp][i-1]][i-1];
            ct++;
        }
        int res = mp[sy[q]];
        int change = ey[q] - sy[q] - 1;
        RE(i,20) if(change&(1<<i)) res = nxt[res][i];
        if(res == 0) {
            ans[q] = 0;
        } else {
            ans[q] = x[res] <= ex[q];
        }
    }

    RE1(i,t) OUTL(ans[i] ? "Yes" : "No");
}

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 189 ms 22032 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 182 ms 21964 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 142 ms 21672 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 175 ms 21948 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 273 ms 39828 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 271 ms 39820 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 308 ms 39848 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 321 ms 39840 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 307 ms 39852 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 425 ms 40824 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

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

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 538 ms 41556 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 382 ms 39900 KB 200000 token(s): yes count is 161254, no count is 38746
3 Correct 297 ms 39792 KB 200000 token(s): yes count is 117455, no count is 82545
4 Correct 688 ms 47260 KB 200000 token(s): yes count is 182118, no count is 17882
5 Correct 396 ms 41028 KB 200000 token(s): yes count is 167565, no count is 32435
6 Correct 280 ms 39880 KB 200000 token(s): yes count is 156797, no count is 43203
7 Correct 279 ms 39988 KB 200000 token(s): yes count is 156797, no count is 43203
8 Correct 279 ms 39848 KB 200000 token(s): yes count is 122100, no count is 77900
9 Correct 504 ms 40880 KB 200000 token(s): yes count is 139670, no count is 60330
10 Correct 517 ms 40980 KB 200000 token(s): yes count is 165806, no count is 34194
11 Correct 606 ms 44124 KB 200000 token(s): yes count is 175646, no count is 24354
12 Correct 266 ms 39828 KB 200000 token(s): yes count is 134695, no count is 65305
13 Correct 270 ms 39836 KB 200000 token(s): yes count is 126733, no count is 73267
14 Correct 329 ms 39936 KB 200000 token(s): yes count is 155290, no count is 44710
15 Correct 267 ms 39928 KB 200000 token(s): yes count is 129674, no count is 70326