oj.uz

Submission #39931

# Submission time Handle Problem Language Result Execution time Memory
39931 2018-01-24T12:34:52 Z krauch OGLEDALA (COI15_ogledala) C++14
41 / 100
 4000 ms 220404 KB 
/*
 _    _    _______   _    _
| |  / /  |  _____| | |  / /
| | / /   | |       | | / /
| |/ /    | |_____  | |/ /
| |\ \    |  _____| | |\ \
| | \ \   | |       | | \ \
| |  \ \  | |_____  | |  \ \
|_|   \_\ |_______| |_|   \_\

*/
#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef pair <int, int> PII;
typedef pair <ll, ll> PLL;
typedef pair < ll, int > PLI;


#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define right(x) x << 1 | 1
#define left(x) x << 1
#define forn(x, a, b) for (int x = a; x <= b; ++x)
#define for1(x, a, b) for (int x = a; x >= b; --x)
#define mkp make_pair
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define y1 kekekek

#define fname ""

const ll ool = 1e18 + 9;
const int oo = 1e9 + 9, base = 1e9 + 7;
const ld eps = 1e-7;
const int N = 4e5 + 6;

int n, m;
ll L, ans[N];
PLL a[N];
PLI b[N];
map < PLL, ll > d;
set < PLI > st;

ll get(ll len, ll x) {
    if (d.count(PLL(len, x))) return d[PLL(len, x)];
    if (len == x) return d[PLL(len, x)] = 1;
    if (len < x) return d[PLL(len, x)] = 0;
    return d[PLL(len, x)] = get((len - 1) / 2, x) + get(len / 2, x);
}

int main() {
    #ifdef krauch
        freopen("input.txt", "r", stdin);
    #else
        //freopen(fname".in", "r", stdin);
        //freopen(fname".out", "w", stdout);
    #endif

    scanf("%lld%d%d", &L, &n, &m);
    ll last = 0;
    forn(i, 1, n) {
        ll x;
        scanf("%lld", &x);
        a[i].F = last + 1;
        a[i].S = x - 1;
        if (last < x - 1) {
            st.insert(PLI(x - last - 1, n + 1 - i));
        }
        last = x;
    }
    a[n + 1].F = last + 1;
    a[n + 1].S = L;
    if (last < L) {
        st.insert(PLI(L - last, 0));
    }

    forn(i, 1, m) {
        scanf("%lld", &b[i].F);
        b[i].F -= n;
        b[i].S = i;
    }

    sort(b + 1, b + m + 1);

    int ptr = 1;
    while (ptr <= m && b[ptr].F <= 0) {
        ans[b[ptr].S] = a[b[ptr].F + n].S + 1;
        ++ptr;
    }
    ll sum = 0;
    while (sz(st)) {
        int i = n + 1 - st.rbegin() -> S;
        ll len = st.rbegin() -> F;
        if (!len) break;
        st.erase(*st.rbegin());
        ll val = get(a[i].S - a[i].F + 1, len);
        while (ptr <= m && sum + val >= b[ptr].F) {
            ll pos = b[ptr].F - sum;
            ll l = a[i].F, r = a[i].S;
            while (r - l + 1 > len) {
                ll mid = (l + r) >> 1ll;
                ll res = get(mid - l, len);
                if (res >= pos) {
                    r = mid - 1;
                }
                else {
                    l = mid + 1;
                    pos -= res;
                }
            }
            if (r - l + 1 != len) assert(0);
            ans[b[ptr].S] = (l + r) >> 1ll;
            ++ptr;
        }
        if (ptr > m) break;
        sum += val;
        if ((len - 1) / 2) {
            st.insert(PLI((len - 1) / 2, n + 1 - i));
        }
        if (len / 2) {
            st.insert(PLI(len / 2, n + 1 - i));
        }
    }

    forn(i, 1, m) {
        printf("%lld\n", ans[i]);
    }

	return 0;
}

Compilation message

ogledala.cpp: In function 'int main()':
ogledala.cpp:66:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%d%d", &L, &n, &m);
                                  ^
ogledala.cpp:70:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &x);
                          ^
ogledala.cpp:85:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &b[i].F);
                               ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 17652 KB Output is correct
2 Correct 1 ms 17652 KB Output is correct
3 Correct 63 ms 18576 KB Output is correct
4 Correct 42 ms 18840 KB Output is correct
5 Correct 103 ms 22668 KB Output is correct
6 Correct 113 ms 23988 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19104 KB Output is correct
2 Correct 13 ms 19236 KB Output is correct
3 Correct 418 ms 49728 KB Output is correct
4 Correct 367 ms 46692 KB Output is correct
5 Correct 420 ms 49860 KB Output is correct
6 Correct 414 ms 49464 KB Output is correct

Subtask #3
0 / 59.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4000 ms 220404 KB Execution timed out
2 Halted 0 ms 0 KB -