oj.uz

Submission #58904

# Submission time Handle Problem Language Result Execution time Memory
58904 2018-07-19T19:12:25 Z Benq Global Warming (NOI13_gw) C++14
19 / 40
 1000 ms 33792 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, ad[MX];
vi h;

void compress() {
    map<int,int> m;
    F0R(i,N+2) m[h[i]] = 0;
    int co = 0;
    for (auto& a: m) a.s = co++;
    F0R(i,N+2) h[i] = m[h[i]];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N;
    h.resize(N+2);
    FOR(i,1,N+1) cin >> h[i];
    compress();
    F0R(i,N+1) {
        ad[min(h[i],h[i+1])] ++;
        ad[max(h[i],h[i+1])] --;
    }
    int ans = 0;
    F0R(i,MX) {
        if (i) ad[i] += ad[i-1];
        ans = max(ans,ad[i]);
    }
    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 13 ms 4472 KB Output is correct
2 Correct 11 ms 4596 KB Output is correct
3 Correct 12 ms 4780 KB Output is correct
4 Correct 9 ms 4780 KB Output is correct
5 Correct 11 ms 4780 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5388 KB Output is correct
2 Correct 26 ms 5704 KB Output is correct
3 Correct 26 ms 5888 KB Output is correct
4 Correct 25 ms 6268 KB Output is correct
5 Correct 26 ms 6576 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 12092 KB Output is correct
2 Correct 81 ms 12768 KB Output is correct
3 Correct 148 ms 13696 KB Output is correct
4 Correct 102 ms 14396 KB Output is correct
5 Correct 108 ms 15360 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1042 ms 33792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 33792 KB Time limit exceeded
2 Halted 0 ms 0 KB -