oj.uz

Submission #633601

# Submission time Handle Problem Language Result Execution time Memory
633601 2022-08-22T19:46:54 Z Ahmed57 Global Warming (NOI13_gw) C++17
19 / 40
 1000 ms 62776 KB 
#include <bits/stdc++.h>

using namespace std;
int n;
int pre[2000005];
map<int,int> cmp;
int main(){
    cin>>n;
    int la = 2;
    set<int> s;
    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 25 ms 1088 KB Output is correct
2 Correct 23 ms 1340 KB Output is correct
3 Correct 22 ms 1236 KB Output is correct
4 Correct 24 ms 1344 KB Output is correct
5 Correct 24 ms 1328 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 6436 KB Output is correct
2 Correct 67 ms 7156 KB Output is correct
3 Correct 98 ms 7412 KB Output is correct
4 Correct 113 ms 7380 KB Output is correct
5 Correct 101 ms 7316 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 62776 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 1071 ms 39336 KB Time limit exceeded
2 Halted 0 ms 0 KB -