oj.uz

답안 #700371

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
700371 2023-02-19T05:49:15 Z LeVanThuc Discharging (NOI20_discharging) C++11
36 / 100
 1000 ms 172508 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define p(x,y) pair<ll,ll>(x,y)
#define BIT(i,x) ((x>>i)&1)
#define MASK(x) (1<<x)
#define ld long double
#define __builtin_popcount __builtin_popcountll
#define pll pair<ll,ll>
template<class T1,class T2>
bool maximize(T1 &x,const T2 &y)
{
    if(x<y)
    {
        x=y;
        return 1;
    }
    return 0;
}
template<class T1,class T2>
bool minimize(T1 &x,const T2 &y)
{
    if(x>y)
    {
        x=y;
        return 1;
    }
    return 0;
}
void online()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
#ifndef ONLINE_JUDGE
//    freopen("input.inp", "r", stdin);
//    freopen("output.out","w", stdout);
#else
#endif
}
static const ll N=1e6+10,M=1e16;
ll n,m,A,B,a[N][21],b[N],f[N],po[21];
ll rmq(ll l,ll r)
{
    ll z=log2(r-l);
    return max(a[l][z],a[r-po[z]+1][z]);
}
ll c(ll l,ll r)
{
    return rmq(l,r)*(n-l+1);
}
int main()
{
    online();
    cin>>n;
    for(ll i=1;i<=n;i++)
    {
        cin>>a[i][0];
    }
    po[0]=1;
    for(int k=1;k<=19;k++) po[k]=po[k-1]*2;
    for(int j=1;j<=19;j++)
    for(int i=1;i+po[j]-1<=n;i++)
    {
        a[i][j]=max(a[i][j-1],a[i+po[j-1]][j-1]);
    }
    f[0]=0;
    deque<pll> vt;
    vt.emplace_back(0,0);
    ll ans=M;
    for(ll i=1;i<=n;i++)
    {
        while(vt.size()>=2&&vt[1].fi<=i) vt.pop_front();
        ll k=vt[0].se;
        f[i]=f[k]+c(k+1,i);
        for(ll j=vt.size()-1;j>=0;j--)
        {
            if(f[vt[j].se]+c(vt[j].se+1,vt[j].fi)>f[i]+c(i+1,vt[j].fi))
            {
                vt.pop_back();
            }
            else
            {
                ll b=vt[j].fi,d=n/2+1;
                 while(d)
                {
                    while(b+d<=n&&f[vt[j].se]+c(vt[j].se+1,b+d)<=f[i]+c(i+1,b+d)) b+=d;
                    d/=2;
                }
                b++;
                if(b!=n+1)
                {
                    vt.emplace_back(b,i);
                }
                break;
            }
        }
        if(vt.empty()) vt.emplace_back(1,i);
//        for(auto v:vt) cout<<"("<<v.fi<<","<<v.se<<") ";
//        cout<<f[i];
//        cout<<'\n';
    }
    cout<<f[n];
}

Compilation message

Discharging.cpp: In function 'int main()':
Discharging.cpp:71:8: warning: unused variable 'ans' [-Wunused-variable]
   71 |     ll ans=M;
      |        ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 384 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 580 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 468 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 580 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Execution timed out 1066 ms 167984 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 609 ms 172468 KB Output is correct
2 Correct 973 ms 172508 KB Output is correct
3 Correct 692 ms 172492 KB Output is correct
4 Execution timed out 1107 ms 172436 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 580 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 612 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 488 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 4 ms 468 KB Output is correct
50 Correct 2 ms 512 KB Output is correct

Subtask #6
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 580 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 612 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Execution timed out 1066 ms 167984 KB Time limit exceeded
31 Halted 0 ms 0 KB -