Submission #284989

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
284989	2020-08-28T08:44:52 Z	achibasadzishvili	Discharging (NOI20_discharging)	C++17	38 / 100	800 ms	162036 KB

Discharging

#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
int n,a[1000002];
ll dp[1000002];
int rm[1000002][21],po[2000002],pw[200],raod,mn,lo;
int lef[1000002],rig[1000002];
vector<int>del[1000002];
int get(int x,int y){
    return a[y];
    lo = po[y - x + 1];
    if(rm[y][lo] > rm[x + pw[lo] - 1][lo])return rm[y][lo];
    return rm[x + pw[lo] - 1][lo];
}
int ind(int x,int y){
    if(y == n)return -1;
    ll l = y + 1,r = n,mid,ind = -1;
    while(r >= l){
        mid = (l + r) / 2;
        if(dp[x] + (ll)get(x + 1 , mid) * (n - x) > dp[y] + (ll)get(y + 1 , mid) * (n - y)){
            r = mid - 1;
            ind = mid;
        }
        else
            l = mid + 1;
    }
    return ind;
}
void delet(int x){
    if(lef[x] == rig[x] && lef[x] == -1)return;
    if(lef[x] == -1){
        lef[rig[x]] = -1;
        mn = rig[x];
        rig[x] = -1;
        return;
    }
    rig[lef[x]] = rig[x];
    lef[rig[x]] = lef[x];
    int cur = ind(lef[x] , rig[x]);
    if(cur == -1){
        lef[x] = rig[x] = -1;
        return;
    }
    del[cur].pb(lef[x]);
    lef[x] = rig[x] = -1;
}
int main(){
    scanf("%d",&n);
    for(int i=1; i<=n; i++){
        scanf("%d",&a[i]);
    }
    //int cl = clock();
    //n = 1000000;
    //for(int i=1; i<=n; i++)
    //    a[i] = n-i+1;
    pw[0] = 1;
    
    for(int i=1; i<=21; i++){
        pw[i] = pw[i - 1] * 2;
        for(int j=pw[i - 1]; j<pw[i]; j++){
            if(j <= 1000000)
                po[j] = i - 1;
        }
    }
    for(int i=0; i<=n; i++)
        lef[i] = rig[i] = -1;
    for(int i=1; i<=n; i++){
        rm[i][0] = a[i];
        for(int j=1; j<=20; j++){
            rm[i][j] = rm[i][j - 1];
            if(i - pw[j] + 1 >= 1 && rm[i - pw[j - 1]][j - 1]>rm[i][j])
                rm[i][j] = rm[i - pw[j - 1]][j - 1];
        }
    }
    //cout << clock() - cl << '\n';
    for(int i=1; i<=n; i++){
        for(int j=0; j<del[i].size(); j++){
            delet(del[i][j]);
        }
        dp[i] = dp[mn] + (ll)get(mn + 1 , i) * (ll)(n - mn);
        rig[i - 1] = i;
        lef[i] = i - 1;
        ll cur = ind(i - 1 , i);
        if(cur != -1)
            del[cur].pb(i - 1);
    }
    //cout << "time: " << clock() - cl << " " << raod << '\n';
    cout << dp[n];
    
    
    return 0;
}

Compilation message

Discharging.cpp: In function 'int main()':
Discharging.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for(int j=0; j<del[i].size(); j++){
      |                      ~^~~~~~~~~~~~~~
Discharging.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Discharging.cpp:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   53 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	27776 KB	Output is correct
2	Correct	20 ms	27776 KB	Output is correct
3	Incorrect	20 ms	27776 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	27912 KB	Output is correct
2	Correct	21 ms	27904 KB	Output is correct
3	Correct	21 ms	27904 KB	Output is correct
4	Correct	21 ms	27904 KB	Output is correct
5	Correct	21 ms	27904 KB	Output is correct
6	Correct	21 ms	27904 KB	Output is correct
7	Correct	21 ms	27896 KB	Output is correct
8	Correct	21 ms	27904 KB	Output is correct
9	Correct	21 ms	27904 KB	Output is correct
10	Correct	21 ms	27904 KB	Output is correct
11	Correct	21 ms	27904 KB	Output is correct
12	Correct	21 ms	27904 KB	Output is correct
13	Correct	21 ms	27904 KB	Output is correct
14	Correct	21 ms	27904 KB	Output is correct
15	Correct	24 ms	28032 KB	Output is correct

Subtask #3
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	27912 KB	Output is correct
2	Correct	21 ms	27904 KB	Output is correct
3	Correct	21 ms	27904 KB	Output is correct
4	Correct	21 ms	27904 KB	Output is correct
5	Correct	21 ms	27904 KB	Output is correct
6	Correct	21 ms	27904 KB	Output is correct
7	Correct	21 ms	27896 KB	Output is correct
8	Correct	21 ms	27904 KB	Output is correct
9	Correct	21 ms	27904 KB	Output is correct
10	Correct	21 ms	27904 KB	Output is correct
11	Correct	21 ms	27904 KB	Output is correct
12	Correct	21 ms	27904 KB	Output is correct
13	Correct	21 ms	27904 KB	Output is correct
14	Correct	21 ms	27904 KB	Output is correct
15	Correct	24 ms	28032 KB	Output is correct
16	Correct	668 ms	161144 KB	Output is correct
17	Correct	737 ms	159108 KB	Output is correct
18	Correct	600 ms	162036 KB	Output is correct
19	Correct	695 ms	158212 KB	Output is correct
20	Correct	716 ms	158084 KB	Output is correct
21	Correct	752 ms	159224 KB	Output is correct
22	Correct	725 ms	159492 KB	Output is correct
23	Correct	800 ms	156148 KB	Output is correct
24	Correct	763 ms	157036 KB	Output is correct
25	Correct	751 ms	156896 KB	Output is correct
26	Correct	796 ms	154872 KB	Output is correct
27	Correct	640 ms	160632 KB	Output is correct
28	Correct	722 ms	158712 KB	Output is correct
29	Correct	696 ms	156148 KB	Output is correct
30	Correct	771 ms	155380 KB	Output is correct