oj.uz

답안 #426892

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
426892 2021-06-14T10:45:02 Z lyc Trampoline (info1cup20_trampoline) C++14
11 / 100
 858 ms 26552 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef pair<int,int> ii;

const int mxN = 2e5+5;
const int lgN = 18;

int R, C, N, T, A[mxN], B[mxN];
map<int,vector<ii>> rows;
int pa[mxN][lgN];

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin >> R >> C >> N;
    FOR(i,1,N){
        int a, b; cin >> a >> b; 
        A[i] = a, B[i] = b;
        rows[a].push_back(ii(b,i));
    }

    for (auto& [a, v] : rows) {
        sort(ALL(v));
        auto& p = rows[a-1];
        auto it = p.begin();
        for (auto& [b, i] : v) {
            while (it != p.end() && next(it) != p.end() && next(it)->first <= b) ++it;
            pa[i][0] = (it == p.end() ? 0 : it->second);
            FOR(k,1,lgN-1) pa[i][k] = pa[pa[i][k-1]][k-1];
        }
    }

    cin >> T;
    FOR(i,1,T){
        int a, b, c, d; cin >> a >> b >> c >> d;

        bool ok = 1;
        if (a > c || b > d) ok = 0;
        else if (a < c) {
            auto it = lower_bound(ALL(rows[c-1]), ii(d+1,0));
            if (it == rows[c-1].begin()) ok = 0;
            else {
                auto u = (--it)->second;
                RFOR(k,lgN-1,0) if (pa[u][k] && A[pa[u][k]] >= a) {
                    u = pa[u][k];
                }
                if (A[u] != a || B[u] < b) ok = 0;
            }
        }

        cout << (ok ? "Yes" : "No") << '\n';
    }
}

Compilation message

trampoline.cpp: In function 'int main()':
trampoline.cpp:29:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |     for (auto& [a, v] : rows) {
      |                ^
trampoline.cpp:33:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   33 |         for (auto& [b, i] : v) {
      |                    ^

Subtask #1
0 / 23.0

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

Subtask #2
0 / 20.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 314 ms 18828 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 335 ms 18528 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 323 ms 18772 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 428 ms 19412 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 386 ms 19316 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 682 ms 25224 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

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