oj.uz

Submission #770257

# Submission time Handle Problem Language Result Execution time Memory
770257 2023-07-01T03:50:09 Z horiiseun Global Warming (NOI13_gw) C++17
40 / 40
 205 ms 15004 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif
 
int n, isl, ans, idx, j;
bool nz;
vector<pair<int, int>> o;
vector<int> v;
 
int main() {
 
	ios_base::sync_with_stdio(false);
	cin.tie(0);
 
	cin >> n;
	for (int i = 0, x; i < n; i++) {
		cin >> x;
		nz |= (x != 0);
		if (v.size() && x == v.back()) continue;
		v.push_back(x);
		o.push_back({x, idx++});
	}
	D(v);
	sort(o.begin(), o.end());
	D(o);
 
	if (nz) ans = isl = 1;
	for (auto [ht, pos] : o) {
		isl++;
		if (pos == 0 || v[pos - 1] - ht < 0) isl--;
		if (pos == idx - 1 || v[pos + 1] - ht < 0) isl--;
		if (j != idx - 1 && o[j + 1].f != o[j].f) {
			ans = max(ans, isl);
		}
		j++;
	}
	D(isl);
 
	cout << ans << "\n";
 
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 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

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2040 KB Output is correct
2 Correct 15 ms 1984 KB Output is correct
3 Correct 14 ms 1980 KB Output is correct
4 Correct 14 ms 1992 KB Output is correct
5 Correct 16 ms 1992 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2336 KB Output is correct
2 Correct 11 ms 2368 KB Output is correct
3 Correct 16 ms 2368 KB Output is correct
4 Correct 17 ms 2388 KB Output is correct
5 Correct 16 ms 2376 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 12720 KB Output is correct
2 Correct 191 ms 12616 KB Output is correct
3 Correct 188 ms 12612 KB Output is correct
4 Correct 189 ms 12664 KB Output is correct
5 Correct 179 ms 12680 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 12664 KB Output is correct
2 Correct 190 ms 12624 KB Output is correct
3 Correct 182 ms 12668 KB Output is correct
4 Correct 161 ms 12724 KB Output is correct
5 Correct 159 ms 15004 KB Output is correct