oj.uz

답안 #1101844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101844 2024-10-17T02:51:43 Z blackslex 지구 온난화 (NOI13_gw) C++17
40 / 40
 224 ms 18736 KB 
#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

int n;

int main() {
    scanf("%d", &n);
    vector<int> a(n), par(n); iota(par.begin(), par.end(), 0);
    vector<bool> ck(n);
    for (auto &e: a) scanf("%d", &e);
    int cnt = 0, ans = 0;
    function<int(int)> fset = [&] (int x) {return (par[x] == x ? x : par[x] = fset(par[x]));};
    auto mg = [&] (int x, int y) {
        if ((x = fset(x)) == (y = fset(y))) return;
        if (ck[x] && ck[y]) cnt--, par[x] = y;
        else if (!ck[x] && !ck[y]) cnt++, par[y] = x;
        else par[y] = x;
        ck[x] = ck[y] = 1;
    };
    vector<pii> c;
    for (int i = 0; i < n; i++) c.emplace_back(a[i], i);
    sort(c.begin(), c.end());
    for (int i = n - 1; i >= 0; i--) {
        int e = c[i].second;
        if (e && a[e - 1] >= a[e]) mg(e - 1, e);
        if (e != n - 1 && a[e + 1] >= a[e]) mg(e, e + 1);
        if (!ck[e]) cnt++, ck[e] = 1;
        if (i && c[i - 1].first == c[i].first) continue;
        ans = max(ans, cnt);
    }
    printf("%d", ans);
}

Compilation message

gw.cpp: In function 'int main()':
gw.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
gw.cpp:12:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     for (auto &e: a) scanf("%d", &e);
      |                      ~~~~~^~~~~~~~~~

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 21 ms 2248 KB Output is correct
2 Correct 19 ms 2248 KB Output is correct
3 Correct 23 ms 2248 KB Output is correct
4 Correct 19 ms 2248 KB Output is correct
5 Correct 18 ms 2416 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2248 KB Output is correct
2 Correct 16 ms 2248 KB Output is correct
3 Correct 26 ms 2248 KB Output is correct
4 Correct 20 ms 2248 KB Output is correct
5 Correct 26 ms 2248 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 18728 KB Output is correct
2 Correct 199 ms 18612 KB Output is correct
3 Correct 215 ms 18612 KB Output is correct
4 Correct 221 ms 18612 KB Output is correct
5 Correct 194 ms 18612 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 222 ms 18612 KB Output is correct
2 Correct 224 ms 18612 KB Output is correct
3 Correct 209 ms 18612 KB Output is correct
4 Correct 206 ms 18728 KB Output is correct
5 Correct 201 ms 18736 KB Output is correct