oj.uz

Submission #377908

# Submission time Handle Problem Language Result Execution time Memory
377908 2021-03-15T13:45:37 Z Vimmer Specijacija (COCI20_specijacija) C++14
110 / 110
 1582 ms 146552 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")

#define N 200051
#define NN 1005000
#define PB push_back
#define M ll(1e9 + 7)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define pri(x) cout << x << endl
#define endl '\n'
#define _ << " " <<
#define F first
#define S second

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
//typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

typedef long double ld;
typedef unsigned long long ull;
typedef short int si;

struct node
{
    int sum = 0;

    node *l, *r;

    node(): sum(1), l(nullptr), r(nullptr) {}
    node(int sm): sum(sm), l(nullptr), r(nullptr) {}

    node(node *lt, node *rt): l(lt), r(rt), sum(lt->sum + rt->sum) {}
};

vector <node*> vr;

int tt[N * 4];

node* bld(int tl, int tr)
{
    if (tl == tr) return new node();
    else
    {
        int md = (tl + tr) >> 1;

        return new node(bld(tl, md), bld(md + 1, tr));
    }
}

node* upd(node *v, int tl, int tr, int ps)
{
    if (tl == tr)
    {
        return new node(0);
    }

    int md = (tl + tr) >> 1;

    if (v ->l->sum >= ps)
    {
        return new node(upd(v->l, tl, md, ps), v->r);
    }
    else
    {
        return new node(v->l, upd(v->r, md + 1, tr, ps - v->l->sum));
    }
}

int opr(node *v, int tl, int tr, int ps)
{
    if (tl == tr)
        return tl;

    int md = (tl + tr) >> 1;

    if (v->l->sum >= ps)
        return opr(v->l, tl, md, ps);

    return opr(v->r, md + 1, tr, ps - v->l->sum);
}

int n, q, t;
ll a[N];

ll lft(int i) {return 1ll * i * (i - 1) / 2;}

vector <ll> vt;


void updr(int v, int tl, int tr, int ps, int val)
{
    if (tl == tr)
    {
        tt[v] = val;

        return;
    }

    int md = (tl + tr) >> 1;

    if (ps <= md)
        updr(v + v, tl, md, ps, val);
            else updr(v + v + 1, md + 1, tr, ps, val);

    tt[v] = min(tt[v + v], tt[v + v + 1]);
}

int get(int v, int tl, int tr, int l, int r)
{
    if (tr < l || r < tl || tl > tr || l > r) return 1e9;

    if (l <= tl && tr <= r)
        return tt[v];

    int md = (tl + tr) >> 1;

    return min(get(v + v, tl, md, l, r), get(v + v + 1, md + 1, tr, l, r));
}


ll ans(ll x, ll y)
{
    if (x == y)
        return x;

    int l = upper_bound(all(vt), x) - 1 - vt.begin();
    int r = upper_bound(all(vt), y) - 1 - vt.begin();

    l++; r++;

    ll xr = x, yr = y;

    x -= lft(l);

    y -= lft(r);

    x = opr(vr[n + 1 - l], 1, n + 1, x);

    y = opr(vr[n + 1 - r], 1, n + 1, y);

    if (x > y)
        swap(x, y);

    int lt;

    lt = min(get(1, 1, n + 1, x, y - 1), min(l, r));

    if (lt == l)
        return xr;
    if (lt == r)
        return yr;

    return a[lt];
}

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    freopen("1.in", "r", stdin);

    for (int i = 0; i < N * 4; i++)
        tt[i] = 1e9;

    cin >> n >> q >> t;

    ll m = (1ll * (n + 1) * (n + 2)) / 2;

    vr.PB(bld(1, n + 1));

    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];

        vt.PB(lft(i) + 1);
    }

    for (int i = n; i >= 1; i--)
    {
        int l = a[i] - lft(i);

        int p = opr(vr.back(), 1, n + 1, l);

        vr.PB(upd(vr.back(), 1, n + 1, l));

        updr(1, 1, n + 1, p, i);
    }

    vt.PB(lft(n + 1) + 1);

    ll lst = 0;

    for (; q > 0; q--)
    {
        ll x, y;

        cin >> x >> y;

        x = (x - 1 + t * lst) % m + 1;

        y = (y - 1 + t * lst) % m + 1;

        lst = ans(x, y);

        pri(lst);
    }
}

Compilation message

Main.cpp: In constructor 'node::node(node*, node*)':
Main.cpp:35:15: warning: 'node::r' will be initialized after [-Wreorder]
   35 |     node *l, *r;
      |               ^
Main.cpp:33:9: warning:   'int node::sum' [-Wreorder]
   33 |     int sum = 0;
      |         ^~~
Main.cpp:40:5: warning:   when initialized here [-Wreorder]
   40 |     node(node *lt, node *rt): l(lt), r(rt), sum(lt->sum + rt->sum) {}
      |     ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 137820 KB Output is correct
2 Correct 29 ms 13416 KB Output is correct
3 Correct 482 ms 137712 KB Output is correct
4 Correct 238 ms 73696 KB Output is correct
5 Correct 482 ms 137692 KB Output is correct
6 Correct 131 ms 43108 KB Output is correct
7 Correct 302 ms 137820 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 137820 KB Output is correct
2 Correct 29 ms 13416 KB Output is correct
3 Correct 482 ms 137712 KB Output is correct
4 Correct 238 ms 73696 KB Output is correct
5 Correct 482 ms 137692 KB Output is correct
6 Correct 131 ms 43108 KB Output is correct
7 Correct 302 ms 137820 KB Output is correct
8 Correct 189 ms 4588 KB Output is correct
9 Correct 163 ms 4332 KB Output is correct
10 Correct 191 ms 4612 KB Output is correct
11 Correct 150 ms 4076 KB Output is correct
12 Correct 190 ms 4584 KB Output is correct
13 Correct 144 ms 4204 KB Output is correct
14 Correct 184 ms 5100 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 137820 KB Output is correct
2 Correct 29 ms 13416 KB Output is correct
3 Correct 482 ms 137712 KB Output is correct
4 Correct 238 ms 73696 KB Output is correct
5 Correct 482 ms 137692 KB Output is correct
6 Correct 131 ms 43108 KB Output is correct
7 Correct 302 ms 137820 KB Output is correct
8 Correct 189 ms 4588 KB Output is correct
9 Correct 163 ms 4332 KB Output is correct
10 Correct 191 ms 4612 KB Output is correct
11 Correct 150 ms 4076 KB Output is correct
12 Correct 190 ms 4584 KB Output is correct
13 Correct 144 ms 4204 KB Output is correct
14 Correct 184 ms 5100 KB Output is correct
15 Correct 1530 ms 138480 KB Output is correct
16 Correct 810 ms 33900 KB Output is correct
17 Correct 1532 ms 144880 KB Output is correct
18 Correct 833 ms 34592 KB Output is correct
19 Correct 1582 ms 145244 KB Output is correct
20 Correct 782 ms 31212 KB Output is correct
21 Correct 1312 ms 146552 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1523 ms 138732 KB Output is correct
2 Correct 1173 ms 72056 KB Output is correct
3 Correct 1550 ms 144988 KB Output is correct
4 Correct 1149 ms 69860 KB Output is correct
5 Correct 1539 ms 145012 KB Output is correct
6 Correct 1154 ms 78052 KB Output is correct
7 Correct 1320 ms 146552 KB Output is correct