oj.uz

답안 #299556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299556 2020-09-15T07:28:58 Z gs18115 Archery (IOI09_archery) C++14
100 / 100
 1131 ms 11652 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
const int mx=200010;
struct seg
{
    struct node
    {
        int sum;
        int mxl;
        node(int v=0):sum(v),mxl(v){}
        node(int sum,int mxl):sum(sum),mxl(mxl){}
        node operator+(const node&x)
        {
            return node(sum+x.sum,max(mxl,sum+x.mxl));
        }
    }t[mx*4];
    void init(int n,int s,int e,vector<int>&v)
    {
        if(s==e)
        {
            t[n]=node(v[s]);
            return;
        }
        int m=s+(e-s)/2;
        init(n*2,s,m,v);
        init(n*2+1,m+1,e,v);
        t[n]=t[n*2]+t[n*2+1];
        return;
    }
    int query(int n,int s,int e,int S,int E,int lft)
    {
        if(s>E||S>e)
            return 0;
        if(S<=s&&e<=E&&t[n].mxl+lft<0)
            return t[n].sum+lft;
        if(s==e)
            return s;
        int m=s+(e-s)/2;
        int lf=query(n*2,s,m,S,E,lft);
        if(lf>0)
            return lf;
        return query(n*2+1,m+1,e,S,E,lf);
    }
}st;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,r;
    cin>>n>>r;
    r=(r-n*2)%n+n*2;
    int s;
    cin>>s;
    vector<int>v(n*2-1);
    for(int&t:v)
    {
        cin>>t;
        t=t>s?1:0;
    }
    vector<int>memo(n+1,inf);
    auto getpos=[&](int start)->int
    {
        if(s==1)
            return 1;
        if(memo[start]!=inf)
            return memo[start];
        vector<int>cnt(n+1,0);
        for(int i=1;i<start;i++)
            cnt[i]=v[i*2-2]+v[i*2-1]-1;
        cnt[start]=v[start*2-2]-1;
        for(int i=start;i++<n;)
            cnt[i]=v[i*2-3]+v[i*2-2]-1;
        cnt[1]++;
        vector<int>prfs(1,0);
        for(int i=0;i++<n;)
            prfs.eb(prfs.back()+cnt[i]);
        vector<int>tm(n+1,inf);
        for(int i=0;i++<n;)
        {
            if(cnt[i]<(i==start?0:1)+(i==1?1:0))
            {
                tm[1]=i-1;
                break;
            }
        }
        st.init(1,1,n,cnt);
        for(int i=1;i++<n;)
        {
            int fi=st.query(1,1,n,i,n,0);
            if(fi>0)
                tm[i]=fi-i;
            else
            {
                int se=st.query(1,1,n,1,i-1,fi);
                if(se>0)
                {
                    tm[i]=n-i+se;
                    if(se<=tm[1]&&prfs[se]+fi==0)
                        tm[i]++;
                }
            }
        }
        int cur=start,cc=start;
        for(int t=0;t<r;t++)
        {
            if(t>=tm[cc])
                cur--,cc--;
            if(cc==0)
                cc=n;
        }
        return memo[start]=cur;
    };
    {
        int pos=getpos(n);
        while((pos-1)%n!=0)
            pos--;
        int s=1,e=n;
        while(s<e)
        {
            int m=s+(e-s)/2;
            if(getpos(m)<pos)
                s=m+1;
            else
                e=m;
        }
        pos=getpos(s);
        e=n;
        for(int i=s;i++<n;)
            if(memo[i]!=inf&&memo[i]>pos)
                e=min(e,i-1);
        for(int i=s;i++<n;)
            if(memo[i]==pos)
                s=i;
        while(s<e)
        {
            int m=s+(e-s+1)/2;
            if(getpos(m)==pos)
                s=m;
            else
                e=m-1;
        }
        cout<<s<<endl;
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6528 KB Output is correct
2 Correct 5 ms 6656 KB Output is correct
3 Correct 5 ms 6656 KB Output is correct
4 Correct 14 ms 6656 KB Output is correct
5 Correct 5 ms 6528 KB Output is correct
6 Correct 5 ms 6528 KB Output is correct

Subtask #2
94.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6656 KB Output is correct
2 Correct 5 ms 6528 KB Output is correct
3 Correct 8 ms 6656 KB Output is correct
4 Correct 51 ms 7048 KB Output is correct
5 Correct 650 ms 11116 KB Output is correct
6 Correct 5 ms 6656 KB Output is correct
7 Correct 6 ms 6656 KB Output is correct
8 Correct 54 ms 7000 KB Output is correct
9 Correct 72 ms 7180 KB Output is correct
10 Correct 8 ms 6656 KB Output is correct
11 Correct 74 ms 7288 KB Output is correct
12 Correct 14 ms 6656 KB Output is correct
13 Correct 859 ms 9836 KB Output is correct
14 Correct 19 ms 6784 KB Output is correct
15 Correct 129 ms 7296 KB Output is correct
16 Correct 5 ms 6528 KB Output is correct
17 Correct 8 ms 6656 KB Output is correct
18 Correct 12 ms 6656 KB Output is correct
19 Correct 12 ms 6656 KB Output is correct
20 Correct 15 ms 6784 KB Output is correct
21 Correct 93 ms 7168 KB Output is correct
22 Correct 105 ms 7484 KB Output is correct
23 Correct 1131 ms 11460 KB Output is correct
24 Correct 5 ms 6528 KB Output is correct
25 Correct 7 ms 6656 KB Output is correct
26 Correct 18 ms 6784 KB Output is correct
27 Correct 76 ms 7252 KB Output is correct
28 Correct 787 ms 9716 KB Output is correct
29 Correct 8 ms 6656 KB Output is correct
30 Correct 20 ms 6784 KB Output is correct
31 Correct 86 ms 7176 KB Output is correct
32 Correct 827 ms 11212 KB Output is correct
33 Correct 5 ms 6656 KB Output is correct
34 Correct 5 ms 6656 KB Output is correct
35 Correct 12 ms 6784 KB Output is correct
36 Correct 11 ms 6656 KB Output is correct
37 Correct 85 ms 7152 KB Output is correct
38 Correct 96 ms 7280 KB Output is correct
39 Correct 5 ms 6528 KB Output is correct
40 Correct 7 ms 6656 KB Output is correct
41 Correct 9 ms 6784 KB Output is correct
42 Correct 10 ms 6656 KB Output is correct
43 Correct 18 ms 6784 KB Output is correct
44 Correct 39 ms 6912 KB Output is correct
45 Correct 79 ms 7180 KB Output is correct
46 Correct 73 ms 7216 KB Output is correct
47 Correct 944 ms 11652 KB Output is correct