Submission #118694

#	Time	Username	Problem	Language	Result	Execution time	Memory
118694		evpipis	Fortune Telling 2 (JOI14_fortune_telling2)	C++14	100 / 100	1189 ms	204016 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
typedef pair<int, int> ii;
typedef long long ll;

const int len = 2e5+5, mx = 1e9;
ii arr[len];
int num[len], n, m;

struct node{
    int sum, rig;
    node *left, *right;

    node(int s = 0, int p = 0, node *l = NULL, node *r = NULL){
        sum = s;
        rig = p;
        left = l;
        right = r;
    }
};

typedef node* pnode;

pnode suf[len], null = new node();

pnode add(pnode t, int l, int r, int i, int p){
    if (l == r)
        return new node(t->sum+1, max(t->rig, p), null, null);

    int mid = (l+r)/2;
    if (i <= mid)
        return new node(t->sum+1, max(t->rig, p), add(t->left, l, mid, i, p), t->right);
    return new node(t->sum+1, max(t->rig, p), t->left, add(t->right, mid+1, r, i, p));
}

node join(node a, node b){
    node c;
    c.rig = max(a.rig, b.rig);
    c.sum = a.sum+b.sum;

    return c;
}

node ask(pnode t, int l, int r, int i, int j){
    if (r < i || j < l)
        return node();
    if (i <= l && r <= j)
        return *t;

    int mid = (l+r)/2;
    return join(ask(t->left, l, mid, i, j), ask(t->right, mid+1, r, i, j));
}

int main(){
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%d %d", &arr[i].fi, &arr[i].se);

    for (int i = 1; i <= m; i++)
        scanf("%d", &num[i]);

    suf[m+1] = null->left = null->right = null;
    for (int i = m; i >= 1; i--)
        suf[i] = add(suf[i+1], 1, mx, num[i], i);

    ll ans = 0;
    for (int i = 1; i <= n; i++){
        int l = arr[i].fi, r = arr[i].se;
        int pos = 0;
        if (min(l, r) < max(l, r))
            pos = ask(suf[1], 1, mx, min(l, r), max(l, r)-1).rig;
        int cnt = ask(suf[pos+1], 1, mx, max(l, r), mx).sum;

        if (pos == 0){
            if (cnt%2 == 0)
                ans += l;
            else
                ans += r;
        }
        else{
            if (cnt%2 == 0)
                ans += max(l, r);
            else
                ans += min(l, r);
        }
    }

    printf("%lld\n", ans);
    return 0;
}

Compilation message (stderr)

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
fortune_telling2.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &arr[i].fi, &arr[i].se);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &num[i]);
         ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 31 / 31
• Subtask 3: 65 / 65