oj.uz

Submission #633603

# Submission time Handle Problem Language Result Execution time Memory
633603 2022-08-22T19:48:25 Z Ahmed57 Global Warming (NOI13_gw) C++14
19 / 40
 1000 ms 62792 KB 
#include <bits/stdc++.h>

using namespace std;
int n;
int pre[2000005];
map<int,int> cmp;
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n;
    int la = 2;
    int arr[n],so[n];
    for(int i = 0;i<n;i++){
        cin>>arr[i];
        so[i] = arr[i];
    }
    sort(so,so+n);
    long long z = 1;
    for(int i= 0;i<n;i++){
        if(i&&so[i]==so[i-1])z--;
        cmp[so[i]] = ++z;
    }
    for(int i = 0;i<n;i++){
        if(la<cmp[arr[i]]*2){
            pre[la]++;
            pre[cmp[arr[i]]*2]--;
        }
        la = cmp[arr[i]]*2;
    }
    int ma = 0;la = 0;
    for(int i = 2;i<=z*2;i++){
        la+=pre[i];
        ma = max(ma,la);
    }
    cout<<ma<<"\n";
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1104 KB Output is correct
2 Correct 14 ms 1112 KB Output is correct
3 Correct 18 ms 1108 KB Output is correct
4 Correct 16 ms 1104 KB Output is correct
5 Correct 14 ms 1108 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 6552 KB Output is correct
2 Correct 50 ms 6456 KB Output is correct
3 Correct 77 ms 6564 KB Output is correct
4 Correct 74 ms 6556 KB Output is correct
5 Correct 76 ms 6456 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1098 ms 62792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 39404 KB Time limit exceeded
2 Halted 0 ms 0 KB -