oj.uz

Submission #82844

# Submission time Handle Problem Language Result Execution time Memory
82844 2018-11-02T05:34:46 Z mra2322001 Global Warming (NOI13_gw) C++14
40 / 40
 327 ms 32408 KB 
#include <bits/stdc++.h>
#define f0(i, n) for(int i(0); i < (n); i++)
#define f1(i, n) for(int i(1); i <= n; i++)
#define left le

using namespace std;
typedef long long ll;
const int N = 1e6 + 2;

int n, left[N];
vector <pair <int, int> > a;

int get1(int u){
    if(left[u]==-1) return -1;
    if(left[u]==u) return u;
    left[u] = get1(left[u]);
    return left[u];
}

int main(){
    ios_base::sync_with_stdio(0);

    cin >> n;
    f1(i, n){
        int x; cin >> x;
        a.emplace_back(x, i);
        left[i] = -1;
    }
    sort(a.begin(), a.end(), greater <pair <int, int> > ());
    int cur = 0, res = 0;
    for(int i = 0; i < n; i++){
        int j = i;
        if(a[i].first==0) continue;
        for(j = i; j < n; j++){
            if(a[j].first != a[i].first) break;
            int u = a[j].second;
            left[u] = u;
            int k1 = get1(u - 1), k2 = get1(u + 1);
            if(k1 > 0 && k2 > 0){
                left[k2] = k1;
                left[u] = k1;
                cur--;
            }
            else if(k2 > 0){
                left[k2] = u;
            }
            else if(k1 > 0){
                left[u] = k1;
            }
            else cur++;
        }
        res = max(res, cur);
        i = j - 1;
    }
    cout << res;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 532 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2028 KB Output is correct
2 Correct 24 ms 2028 KB Output is correct
3 Correct 24 ms 2028 KB Output is correct
4 Correct 24 ms 2028 KB Output is correct
5 Correct 26 ms 2028 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2028 KB Output is correct
2 Correct 20 ms 2028 KB Output is correct
3 Correct 28 ms 2028 KB Output is correct
4 Correct 29 ms 2028 KB Output is correct
5 Correct 27 ms 2036 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 12428 KB Output is correct
2 Correct 327 ms 12532 KB Output is correct
3 Correct 295 ms 12532 KB Output is correct
4 Correct 297 ms 18012 KB Output is correct
5 Correct 324 ms 18012 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 18012 KB Output is correct
2 Correct 292 ms 18012 KB Output is correct
3 Correct 298 ms 26700 KB Output is correct
4 Correct 246 ms 29516 KB Output is correct
5 Correct 248 ms 32408 KB Output is correct