oj.uz

답안 #1113170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113170 2024-11-16T01:58:21 Z votranngocvy 지구 온난화 (NOI13_gw) C++14
30 / 40
 218 ms 33096 KB 
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fi first
#define se second
const int N = 1e6 + 5;
int par[N],sz[N],h[N],f[N];
pii a[N];

void make_set(int v) {
    par[v] = v;
    sz[v] = 1;
}

int find_set(int v) {
    if (v == par[v]) return v;
    int p = find_set(par[v]);
    par[v] = p;
    return p;
}

void union_sets(int a,int b) {
    a = find_set(a),b = find_set(b);
    if (a == b) return;
    if (sz[a] < sz[b]) swap(a,b);
    sz[a] += sz[b];
    par[b] = a;
}

int gw(int N,int *H) {
    int n = N;
    for (int i = 1; i <= n; i++) {
        a[i].fi = H[i - 1];
        a[i].se = i;
    }
    sort(a + 1,a + n + 1,greater<pii>());
    for (int i = 1; i <= n; i++) make_set(i);
    int ans = 0,cnt = 0,i = 1;
    while (i <= n) {
        int j = i;
        while (j <= n && a[j].fi == a[i].fi) {
            cnt++;
            if (i > 1 && f[a[j].se - 1]) {
                union_sets(a[j].se - 1,a[j].se);
                cnt--;
            }
            if (i < n && f[a[j].se + 1]) {
                union_sets(a[j].se + 1,a[j].se);
                cnt--;
            }
            f[a[j].se] = 1;
            j++;
        }
        i = j;
        ans = max(ans,cnt);
    }
    return ans;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> h[i];
    cout << gw(n,h) << "\n";
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 2640 KB Output is correct
2 Correct 18 ms 2916 KB Output is correct
3 Correct 16 ms 2896 KB Output is correct
4 Correct 17 ms 4688 KB Output is correct
5 Correct 22 ms 3152 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2676 KB Output is correct
2 Correct 12 ms 3408 KB Output is correct
3 Correct 19 ms 5200 KB Output is correct
4 Correct 18 ms 3664 KB Output is correct
5 Correct 19 ms 3408 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 23852 KB Output is correct
2 Runtime error 212 ms 33096 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 23904 KB Output is correct
2 Correct 213 ms 30796 KB Output is correct
3 Correct 218 ms 32328 KB Output is correct
4 Correct 189 ms 26752 KB Output is correct
5 Correct 176 ms 26764 KB Output is correct