oj.uz

답안 #1101840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101840 2024-10-17T02:42:58 Z blackslex 지구 온난화 (NOI13_gw) C++17
19 / 40
 520 ms 65536 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<int> c = a;
    sort(c.begin(), c.end()); c.resize(unique(c.begin(), c.end()) - c.begin());
    vector<vector<int>> add(n, vector<int>());
    auto get = [&] (int x) {
        return lower_bound(c.begin(), c.end(), x) - c.begin();
    };
    for (int i = 0; i < n; i++) add[get(a[i])].emplace_back(i);
    for (int i = n - 1; i >= 0; i--) {
        for (auto &e: add[i]) {
            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;
        }
        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 340 KB Output is correct
3 Correct 1 ms 352 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

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 4432 KB Output is correct
2 Correct 16 ms 4696 KB Output is correct
3 Correct 17 ms 4688 KB Output is correct
4 Correct 16 ms 4692 KB Output is correct
5 Correct 16 ms 4884 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 6984 KB Output is correct
2 Correct 23 ms 7680 KB Output is correct
3 Correct 43 ms 7804 KB Output is correct
4 Correct 41 ms 7756 KB Output is correct
5 Correct 37 ms 7756 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 403 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 520 ms 53716 KB Memory limit exceeded
2 Halted 0 ms 0 KB -