oj.uz

답안 #153336

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153336 2019-09-13T13:12:52 Z arnold518 휴가 (IOI14_holiday) C++14
100 / 100
 556 ms 49864 KB 
#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int MAXS = 20e5;

int N, S, D, A[MAXN+10];
vector<int> comp;
int getcomp(int x) { return lower_bound(comp.begin(), comp.end(), x)-comp.begin(); }
ll ans;

struct Node
{
    int cnt; ll sum;
    int lc, rc;
    Node() : cnt(0), sum(0), lc(-1), rc(-1) {}
};
Node nodes[MAXS]; int cnt=0;
int tree[MAXN+10];

int newNode() { return cnt++; }

void makeTree(int node, int tl, int tr)
{
    if(tl==tr) return;
    int mid=tl+tr>>1;
    nodes[node].lc=newNode();
    nodes[node].rc=newNode();
    makeTree(nodes[node].lc, tl, mid);
    makeTree(nodes[node].rc, mid+1, tr);
}

int addTree(int node, int tl, int tr, int pos)
{
    if(pos<tl || tr<pos) return node;
    int ret=newNode();
    if(tl==tr)
    {
        nodes[ret].cnt=(nodes[node].cnt)+1;
        nodes[ret].sum=(nodes[node].sum)+comp[pos];
        return ret;
    }
    int mid=tl+tr>>1;
    nodes[ret].lc=addTree(nodes[node].lc, tl, mid, pos);
    nodes[ret].rc=addTree(nodes[node].rc, mid+1, tr, pos);
    nodes[ret].cnt=(nodes[nodes[ret].lc].cnt)+(nodes[nodes[ret].rc].cnt);
    nodes[ret].sum=(nodes[nodes[ret].lc].sum)+(nodes[nodes[ret].rc].sum);
    return ret;
}

ll query(int nodel, int noder, int tl, int tr, int k)
{
    if(tl==tr) return comp[tl]*min((ll)k, (ll)(nodes[noder].cnt)-(nodes[nodel].cnt));
    int mid=tl+tr>>1;
    ll t=(nodes[nodes[noder].rc].cnt)-(nodes[nodes[nodel].rc].cnt);
    if(t>=k) return query(nodes[nodel].rc, nodes[noder].rc, mid+1, tr, k);
    else return query(nodes[nodel].lc, nodes[noder].lc, tl, mid, k-t)+(nodes[nodes[noder].rc].sum)-(nodes[nodes[nodel].rc].sum);
}

int dist(int l, int r) { return D-(r-l+min(abs(S-l), abs(r-S))); }

void solve(int sl, int sr, int el, int er)
{
    if(sl>sr) return;
    int i, j;
    int smid=sl+sr>>1, emid=er; ll val=-1;
    for(i=max(smid, el); i<=er; i++)
    {
        ll t=query(tree[smid-1], tree[i], 1, comp.size()-1, dist(smid, i));
        if(t>val) val=t, emid=i;
    }
    ans=max(ans, val);
    solve(sl, smid-1, el, emid);
    solve(smid+1, sr, emid, er);
}

ll findMaxAttraction(int _N, int _S, int _D, int *_A)
{
    int i, j;
    N=_N; S=_S; D=_D; S++;
    for(i=1; i<=N; i++) A[i]=_A[i-1], comp.push_back(A[i]); comp.push_back(-1);
    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());

    tree[0]=newNode();
    makeTree(tree[0], 1, comp.size()-1);
    for(i=1; i<=N; i++) tree[i]=addTree(tree[i-1], 1, comp.size()-1, getcomp(A[i]));

    solve(1, N, 1, N);
    return ans;
}

Compilation message

holiday.cpp: In function 'void makeTree(int, int, int)':
holiday.cpp:31:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
holiday.cpp: In function 'int addTree(int, int, int, int)':
holiday.cpp:48:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
holiday.cpp: In function 'll query(int, int, int, int, int)':
holiday.cpp:59:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
holiday.cpp: In function 'void solve(int, int, int, int)':
holiday.cpp:71:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int smid=sl+sr>>1, emid=er; ll val=-1;
              ~~^~~
holiday.cpp:70:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
holiday.cpp: In function 'll findMaxAttraction(int, int, int, int*)':
holiday.cpp:86:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1; i<=N; i++) A[i]=_A[i-1], comp.push_back(A[i]); comp.push_back(-1);
     ^~~
holiday.cpp:86:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(i=1; i<=N; i++) A[i]=_A[i-1], comp.push_back(A[i]); comp.push_back(-1);
                                                             ^~~~
holiday.cpp:84:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 47352 KB Output is correct
2 Correct 42 ms 47352 KB Output is correct
3 Correct 41 ms 47352 KB Output is correct
4 Correct 50 ms 47228 KB Output is correct
5 Correct 42 ms 47352 KB Output is correct
6 Correct 42 ms 47352 KB Output is correct
7 Correct 42 ms 47384 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 49252 KB Output is correct
2 Correct 61 ms 49144 KB Output is correct
3 Correct 75 ms 49136 KB Output is correct
4 Correct 74 ms 49136 KB Output is correct
5 Correct 173 ms 49164 KB Output is correct
6 Correct 78 ms 47992 KB Output is correct
7 Correct 96 ms 48336 KB Output is correct
8 Correct 108 ms 48628 KB Output is correct
9 Correct 61 ms 47864 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 47344 KB Output is correct
2 Correct 43 ms 47352 KB Output is correct
3 Correct 46 ms 47352 KB Output is correct
4 Correct 47 ms 47352 KB Output is correct
5 Correct 50 ms 47492 KB Output is correct
6 Correct 43 ms 47264 KB Output is correct
7 Correct 50 ms 47352 KB Output is correct
8 Correct 42 ms 47352 KB Output is correct
9 Correct 109 ms 47352 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 49852 KB Output is correct
2 Correct 398 ms 49864 KB Output is correct
3 Correct 155 ms 48500 KB Output is correct
4 Correct 46 ms 47352 KB Output is correct
5 Correct 45 ms 47348 KB Output is correct
6 Correct 47 ms 47352 KB Output is correct
7 Correct 42 ms 47352 KB Output is correct
8 Correct 522 ms 49776 KB Output is correct
9 Correct 556 ms 49772 KB Output is correct