oj.uz

답안 #284991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284991 2020-08-28T08:45:21 Z achibasadzishvili Discharging (NOI20_discharging) C++17
36 / 100
 1000 ms 160808 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#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){
    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:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("O3")
      | 
Discharging.cpp:6: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("unroll-loops")
      | 
Discharging.cpp: In function 'int main()':
Discharging.cpp:84:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         for(int j=0; j<del[i].size(); j++){
      |                      ~^~~~~~~~~~~~~~
Discharging.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Discharging.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 18 ms 27776 KB Output is correct
3 Correct 19 ms 27776 KB Output is correct
4 Correct 20 ms 27776 KB Output is correct
5 Correct 19 ms 27776 KB Output is correct
6 Correct 19 ms 27776 KB Output is correct
7 Correct 18 ms 27776 KB Output is correct
8 Correct 18 ms 27776 KB Output is correct
9 Correct 19 ms 27724 KB Output is correct
10 Correct 19 ms 27776 KB Output is correct
11 Correct 20 ms 27776 KB Output is correct
12 Correct 18 ms 27776 KB Output is correct
13 Correct 18 ms 27776 KB Output is correct
14 Correct 18 ms 27776 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27904 KB Output is correct
2 Correct 19 ms 28032 KB Output is correct
3 Correct 19 ms 27904 KB Output is correct
4 Correct 19 ms 27904 KB Output is correct
5 Correct 20 ms 27904 KB Output is correct
6 Correct 20 ms 27904 KB Output is correct
7 Correct 19 ms 27904 KB Output is correct
8 Correct 19 ms 27920 KB Output is correct
9 Correct 20 ms 27904 KB Output is correct
10 Correct 20 ms 27904 KB Output is correct
11 Correct 20 ms 27904 KB Output is correct
12 Correct 19 ms 27904 KB Output is correct
13 Correct 20 ms 27904 KB Output is correct
14 Correct 20 ms 27904 KB Output is correct
15 Correct 20 ms 27904 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27904 KB Output is correct
2 Correct 19 ms 28032 KB Output is correct
3 Correct 19 ms 27904 KB Output is correct
4 Correct 19 ms 27904 KB Output is correct
5 Correct 20 ms 27904 KB Output is correct
6 Correct 20 ms 27904 KB Output is correct
7 Correct 19 ms 27904 KB Output is correct
8 Correct 19 ms 27920 KB Output is correct
9 Correct 20 ms 27904 KB Output is correct
10 Correct 20 ms 27904 KB Output is correct
11 Correct 20 ms 27904 KB Output is correct
12 Correct 19 ms 27904 KB Output is correct
13 Correct 20 ms 27904 KB Output is correct
14 Correct 20 ms 27904 KB Output is correct
15 Correct 20 ms 27904 KB Output is correct
16 Execution timed out 1059 ms 146764 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1065 ms 160808 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 18 ms 27776 KB Output is correct
3 Correct 19 ms 27776 KB Output is correct
4 Correct 20 ms 27776 KB Output is correct
5 Correct 19 ms 27776 KB Output is correct
6 Correct 19 ms 27776 KB Output is correct
7 Correct 18 ms 27776 KB Output is correct
8 Correct 18 ms 27776 KB Output is correct
9 Correct 19 ms 27724 KB Output is correct
10 Correct 19 ms 27776 KB Output is correct
11 Correct 20 ms 27776 KB Output is correct
12 Correct 18 ms 27776 KB Output is correct
13 Correct 18 ms 27776 KB Output is correct
14 Correct 18 ms 27776 KB Output is correct
15 Correct 19 ms 27904 KB Output is correct
16 Correct 19 ms 28032 KB Output is correct
17 Correct 19 ms 27904 KB Output is correct
18 Correct 19 ms 27904 KB Output is correct
19 Correct 20 ms 27904 KB Output is correct
20 Correct 20 ms 27904 KB Output is correct
21 Correct 19 ms 27904 KB Output is correct
22 Correct 19 ms 27920 KB Output is correct
23 Correct 20 ms 27904 KB Output is correct
24 Correct 20 ms 27904 KB Output is correct
25 Correct 20 ms 27904 KB Output is correct
26 Correct 19 ms 27904 KB Output is correct
27 Correct 20 ms 27904 KB Output is correct
28 Correct 20 ms 27904 KB Output is correct
29 Correct 20 ms 27904 KB Output is correct
30 Correct 23 ms 28032 KB Output is correct
31 Correct 23 ms 27952 KB Output is correct
32 Correct 21 ms 27904 KB Output is correct
33 Correct 21 ms 28032 KB Output is correct
34 Correct 22 ms 28032 KB Output is correct
35 Correct 23 ms 28032 KB Output is correct
36 Correct 20 ms 28032 KB Output is correct
37 Correct 20 ms 28032 KB Output is correct
38 Correct 21 ms 28032 KB Output is correct
39 Correct 20 ms 28032 KB Output is correct
40 Correct 20 ms 28032 KB Output is correct
41 Correct 20 ms 28032 KB Output is correct
42 Correct 20 ms 28032 KB Output is correct
43 Correct 21 ms 27960 KB Output is correct
44 Correct 20 ms 27904 KB Output is correct
45 Correct 22 ms 28032 KB Output is correct
46 Correct 20 ms 27904 KB Output is correct
47 Correct 21 ms 28032 KB Output is correct
48 Correct 20 ms 27896 KB Output is correct
49 Correct 21 ms 27904 KB Output is correct
50 Correct 21 ms 28032 KB Output is correct

Subtask #6
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27776 KB Output is correct
2 Correct 18 ms 27776 KB Output is correct
3 Correct 19 ms 27776 KB Output is correct
4 Correct 20 ms 27776 KB Output is correct
5 Correct 19 ms 27776 KB Output is correct
6 Correct 19 ms 27776 KB Output is correct
7 Correct 18 ms 27776 KB Output is correct
8 Correct 18 ms 27776 KB Output is correct
9 Correct 19 ms 27724 KB Output is correct
10 Correct 19 ms 27776 KB Output is correct
11 Correct 20 ms 27776 KB Output is correct
12 Correct 18 ms 27776 KB Output is correct
13 Correct 18 ms 27776 KB Output is correct
14 Correct 18 ms 27776 KB Output is correct
15 Correct 19 ms 27904 KB Output is correct
16 Correct 19 ms 28032 KB Output is correct
17 Correct 19 ms 27904 KB Output is correct
18 Correct 19 ms 27904 KB Output is correct
19 Correct 20 ms 27904 KB Output is correct
20 Correct 20 ms 27904 KB Output is correct
21 Correct 19 ms 27904 KB Output is correct
22 Correct 19 ms 27920 KB Output is correct
23 Correct 20 ms 27904 KB Output is correct
24 Correct 20 ms 27904 KB Output is correct
25 Correct 20 ms 27904 KB Output is correct
26 Correct 19 ms 27904 KB Output is correct
27 Correct 20 ms 27904 KB Output is correct
28 Correct 20 ms 27904 KB Output is correct
29 Correct 20 ms 27904 KB Output is correct
30 Execution timed out 1059 ms 146764 KB Time limit exceeded
31 Halted 0 ms 0 KB -