oj.uz

답안 #79802

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
79802 2018-10-16T13:29:05 Z aquablitz11 사다리꼴 (balkan11_trapezoid) C++14
85 / 100
 500 ms 46556 KB 
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
using piipii = pair<pii, pii>;
using pipii = pair<int, pii>;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define F first
#define S second

inline pii comb(pii a, pii b) {
    if (a.F == b.F)
        return pii(a.F, (a.S+b.S)%30013);
    else
        return max(a, b);
}

const int N = 1<<17;
int n;
piipii A[N];

struct data {
    vector<int> key;
    vector<pii> val;
    data() {
    }
    data(int x) {
        key.push_back(x);
        val.resize(2);
    }
    data operator+(data b) {
        data ret;
        merge(all(key), all(b.key), back_inserter(ret.key));
        ret.val.resize(val.size()+b.val.size()-1);
        return ret;
    }
} seg[N<<1];

void build(int p=1, int b=0, int e=n-1) {
    if (b == e) {
        seg[p] = data(A[b].F.S);
        return;
    }
    int m = (b+e)/2;
    build(p<<1, b, m);
    build(p<<1|1, m+1, e);
    seg[p] = seg[p<<1]+seg[p<<1|1];
}

pii query(int x, int y, int p=1, int b=0, int e=n-1) {
    int l = x, r = n-1;
    if (b > r || e < l)
        return pii(0, 0);
    if (b >= l && e <= r) {
        int i = lower_bound(all(seg[p].key), y)-seg[p].key.begin()+1;
        pii ans(0, 0);
        for (; i <= seg[p].key.size(); i += i&-i)
            ans = comb(ans, seg[p].val[i]);
        return ans;
    }
    int m = (b+e)/2;
    pii q1 = query(x, y, p<<1, b, m);
    pii q2 = query(x, y, p<<1|1, m+1, e);
    return comb(q1, q2);
}

inline void updateft(int p, int i, pii v) {
    for (; i > 0; i -= i&-i)
        seg[p].val[i] = comb(seg[p].val[i], v);
}

void update(int x, int y, pii v, int p=1, int b=0, int e=n-1) {
    if (b > x || e < x)
        return;
    updateft(p, lower_bound(all(seg[p].key), y)-seg[p].key.begin()+1, v);
    if (b == e)
        return;
    int m = (b+e)/2;
    if (x <= m)
        update(x, y, v, p<<1, b, m);
    else
        update(x, y, v, p<<1|1, m+1, e);
}

inline int pos(int x) {
    return lower_bound(A, A+n, mp(mp(x, 0), mp(0, 0)))-A;
}

int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; ++i)
        scanf("%d%d%d%d", &A[i].F.F, &A[i].S.F, &A[i].F.S, &A[i].S.S);
    sort(A, A+n);
    build();

    pii ans(0, 0);
    for (int i = n-1; i >= 0; --i) {
        int ul = A[i].F.F, dl = A[i].F.S;
        int ur = A[i].S.F, dr = A[i].S.S;
        pii best = query(pos(ur), dr);
        ++best.F;
        if (best == pii(1, 0))
            best.S = 1;
        ans = comb(ans, best);
        update(pos(ul), dl, best);
        //printf("ul=%d, dl=%d, update to %d %d\n", ul, dl, best.F, best.S);
    }
    printf("%d %d\n", ans.F, ans.S);

    return 0;
}

Compilation message

trapezoid.cpp: In function 'pii query(int, int, int, int, int)':
trapezoid.cpp:58:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (; i <= seg[p].key.size(); i += i&-i)
                ~~^~~~~~~~~~~~~~~~~~~~
trapezoid.cpp: In function 'int main()':
trapezoid.cpp:92:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
trapezoid.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d", &A[i].F.F, &A[i].S.F, &A[i].F.S, &A[i].S.S);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12664 KB Output is correct
2 Correct 14 ms 12668 KB Output is correct
3 Correct 13 ms 12836 KB Output is correct
4 Correct 15 ms 13092 KB Output is correct
5 Correct 18 ms 13352 KB Output is correct
6 Correct 21 ms 13588 KB Output is correct
7 Correct 24 ms 13844 KB Output is correct
8 Correct 30 ms 14356 KB Output is correct
9 Correct 57 ms 15952 KB Output is correct
10 Correct 87 ms 19408 KB Output is correct
11 Correct 118 ms 20736 KB Output is correct
12 Correct 277 ms 29124 KB Output is correct
13 Correct 328 ms 31928 KB Output is correct
14 Correct 390 ms 37064 KB Output is correct
15 Correct 451 ms 38980 KB Output is correct
16 Execution timed out 502 ms 40628 KB Time limit exceeded
17 Execution timed out 504 ms 42268 KB Time limit exceeded
18 Correct 413 ms 43536 KB Output is correct
19 Correct 497 ms 45056 KB Output is correct
20 Execution timed out 575 ms 46556 KB Time limit exceeded