oj.uz

Submission #1025897

# Submission time Handle Problem Language Result Execution time Memory
1025897 2024-07-17T11:04:24 Z rsinventor Global Warming (NOI13_gw) C++17
23 / 40
 199 ms 16976 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector <vector<int>> vvi;
typedef vector<bool> vb;
typedef vector <vector<bool>> vvb;
typedef vector <string> vs;
typedef vector<char> vc;
typedef vector <vector<char>> vvc;
typedef pair<int, int> pii;
typedef vector <pii> vpii;

#define all(a) (a).begin(), (a).end()
#define pb push_back
#define endl "\n"

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

//    freopen("warming.in", "r", stdin);
//    freopen("warming.out", "w", stdout);
    
    int n;
    cin >> n;
    vi h(n);
//    set<int> sh;
    vpii sh2(n);
    for(int i = 0; i < n; i++) {
        cin >> h[i];
        sh2[i].first = h[i];
        sh2[i].second = i;
//        sh.insert(h[i]);
    }
    sort(all(sh2));
    
    int mx_islands = 0;
//    sh.insert(0);
//    for(int v : sh) {
//        int islands = 0;
//        for(int i = 0; i < n; i++) {
//            if(max(0, h[i]-v)>0 && (i==0 || max(0, h[i-1]-v)==0)) islands++;
//        }
//        mx_islands = max(mx_islands, islands);
//    }
    
    int islands = 0;
    mx_islands = 0;
    for(int i = 0; i < n; i++) {
        if(max(0, h[i])>0 && (i==0 || max(0, h[i-1])==0)) islands++;
    }
    mx_islands = max(mx_islands, islands);
    for(int i = 0; i < n; i++) {
        if(sh2[i].first==sh2[i-1].first && abs(sh2[i].second-sh2[i-1].second)<=1) continue;
        int s = sh2[i].second;
        int e = sh2[i].second;
        while(e+1<n && h[e] == h[e+1]) e++;
        if(s==0 && e == n-1) {
            islands = 0;
        } else if(s==0 && h[e+1]<h[s]) {
            islands--;
        } else if(e==n-1 && h[s-1]<h[e]) {
            islands--;
        } else {
            if(h[s-1]>h[s] && h[e+1]>h[e]) {
                islands++;
                mx_islands = max(mx_islands, islands);
            } else if(h[s-1]<h[s] && h[e+1]<h[e]) {
                islands--;
            }
        }
        
    }
    
    cout << mx_islands << endl;


    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 464 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2396 KB Output is correct
2 Correct 10 ms 2140 KB Output is correct
3 Correct 16 ms 2364 KB Output is correct
4 Correct 20 ms 2396 KB Output is correct
5 Correct 21 ms 2392 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 16908 KB Output is correct
2 Correct 165 ms 16900 KB Output is correct
3 Correct 165 ms 16976 KB Output is correct
4 Correct 167 ms 16976 KB Output is correct
5 Correct 154 ms 16560 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 16732 KB Output is correct
2 Correct 199 ms 16724 KB Output is correct
3 Correct 174 ms 16656 KB Output is correct
4 Incorrect 145 ms 13908 KB Output isn't correct
5 Halted 0 ms 0 KB -