oj.uz

Submission #58908

# Submission time Handle Problem Language Result Execution time Memory
58908 2018-07-19T19:19:41 Z Benq Global Warming (NOI13_gw) C++11
40 / 40
 455 ms 25920 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 1000005;

int N, co = 0;
int ins[MX], del[MX];

int lst = 0;

void process(int x) {
    ins[co] = min(x,lst);
    del[co] = max(x,lst);
    co ++;
    lst = x;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    FOR(i,1,N+1) {
        int x; cin >> x;
        process(x);
    }
    process(0);
    
    sort(ins,ins+N+1);
    sort(del,del+N+1);
    int cur = 0, ind = 0, ans = 0;
    F0R(i,N+1) {
        int a = ins[i];
        cur ++;
        while (ind < N+1 && del[ind] <= a) {
            ind ++;
            cur --;
        }
        ans = max(ans,cur);
    }
    
    cout << ans/2;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 2 ms 548 KB Output is correct
4 Correct 3 ms 548 KB Output is correct
5 Correct 3 ms 552 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1572 KB Output is correct
2 Correct 18 ms 1868 KB Output is correct
3 Correct 19 ms 2072 KB Output is correct
4 Correct 19 ms 2500 KB Output is correct
5 Correct 29 ms 2740 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3468 KB Output is correct
2 Correct 21 ms 4128 KB Output is correct
3 Correct 49 ms 4588 KB Output is correct
4 Correct 34 ms 4588 KB Output is correct
5 Correct 30 ms 4588 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 377 ms 11588 KB Output is correct
2 Correct 455 ms 14824 KB Output is correct
3 Correct 360 ms 14892 KB Output is correct
4 Correct 389 ms 14892 KB Output is correct
5 Correct 356 ms 15708 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 20144 KB Output is correct
2 Correct 361 ms 20292 KB Output is correct
3 Correct 354 ms 20292 KB Output is correct
4 Correct 210 ms 22980 KB Output is correct
5 Correct 185 ms 25920 KB Output is correct