oj.uz

답안 #768943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768943 2023-06-29T00:08:25 Z aykhn Trampoline (info1cup20_trampoline) C++14
43 / 100
 489 ms 49972 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

// author: aykhn

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;

#define TC int t; cin >> t; while (t--) _();
#define OPT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_setp tree<pii, null_type,less<pii>, rb_tree_tag,tree_order_statistics_node_update>
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define mpr make_pair
#define eb emplace_back
#define new int32_t
#define pb push_back
#define ts to_string
#define int ll
#define fi first
#define se second
#define ins insert
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount

int n, R, C;
vector<int> adj[200001];
pii a[200001];
int used[200001];
int par[20][200001];

void dfs(int a)
{
    used[a] = 1;
    for (int i = 0; i < adj[a].size(); i++)
    {
        if (!used[adj[a][i]])
        {
            par[0][adj[a][i]] = a;
            dfs(adj[a][i]);
        }
    }
}


new main()
{
    OPT;
    cin >> R >> C >> n;

    for (int i = 0; i < n; i++)
    {
        cin >> a[i].fi >> a[i].se;
    }

    int cnt = 0;

    sort(a, a + n);

    for (int i = 0; i < n; i++)
    {
        int x = lower_bound(a, a + n, mpr(a[i].fi + 1, a[i].se)) - a;

        if (x == n || a[x].fi != a[i].fi + 1) continue;

        adj[x].pb(i);
    }

    for (int i = n - 1; i >= 0; i--)
    {
        if (!used[i]) dfs(i);
    }

    for (int i = 1; i < 20; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            par[i][j] = par[i - 1][par[i - 1][j]];
        }
    }

    int t;
    cin >> t;

    while (t--)
    {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;

        if (x1 == x2 && y1 <= y2)
        {
            cout << "Yes" << endl;
            continue;
        }
        if (x1 > x2 || y1 > y2)
        {
            cout << "No" << endl;
            continue;
        }

        int node = lower_bound(a, a + n, mpr(x1, y1)) - a;

        if (node == n || a[node].fi != x1)
        {
            cout << "No" << endl;
            continue;
        }

        y1 = a[node].se;

        if (y1 > y2)
        {
            cout << "No" << endl;
            continue;
        }

        int dif = x2 - x1 - 1;

        for (int i = 19; i >= 0; i--)
        {
            if ((1 << i) <= dif)
            {
                node = par[i][node];
                dif -= (1 << i);
            }
        }

        if (!node || a[node].fi + 1 != x2 || a[node].se > y2) cout << "No" << endl;
        else cout << "Yes" << endl;
    }
}

/*
a + b = s
a - b = x

a = (s + x)/2;
*/
/*
s1 - s2 maxing
s2 - s1 maxing = s1 - s2 minimizing
*/
/*




1

1 | 2, 1 + 2 | 0

1 + 3 | 2, 1 | 2 + 3, 1 + 2 + 3 | 0, 1 + 2|

















prime factorise n: p1 * .. * p1 * p2 * .. * p2 * p3 * .. * p3;
need only one standing
to decrease need to - n/x from n
so if sum of ps is equal to s


2 * 7
2 * 2 * 3
*/

Compilation message

trampoline.cpp: In function 'void dfs(ll)':
trampoline.cpp:40:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for (int i = 0; i < adj[a].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
trampoline.cpp: In function 'int32_t main()':
trampoline.cpp:61:9: warning: unused variable 'cnt' [-Wunused-variable]
   61 |     int cnt = 0;
      |         ^~~

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 44652 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 83 ms 44648 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 85 ms 46412 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 87 ms 44872 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
0 / 11.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 489 ms 49972 KB 200000 token(s): yes count is 171404, no count is 28596
2 Incorrect 470 ms 46916 KB expected YES, found NO [17204th token]
3 Halted 0 ms 0 KB -