oj.uz

Submission #1085662

# Submission time Handle Problem Language Result Execution time Memory
1085662 2024-09-08T14:30:25 Z Sunbae Global Warming (NOI13_gw) C++17
29 / 40
 721 ms 29072 KB 
#include <cstdio>
#include <set>
#include <algorithm>
#include <numeric>
#define z exit(0)
#define mp make_pair
#define F first
#define S second
using namespace std;
using pii = pair<int,int>;
const int N = 1e6, inf = 1e9;
int m, idx[N];
set<pii> s;
int gw(int n, int H[]){
	s.clear();
	for(int i = 0, j = 0; i<n; ){
		for(; j+1<n && H[j+1] > 0; ++j){}
		s.emplace(i, j);
		i = j+2; j = i;
	}
	iota(idx, idx+n, 0);
	auto cmp = [&](int i, int j) { return (H[i] == H[j]) ? i < j : H[i] < H[j]; }; 
	sort(idx, idx+n, cmp);
	int mx = (int)s.size(), j = 0;
	for(int i = 0; i<n; ++i) if(H[idx[i]]){ j = i; break;}
	for(int k; j<n; ){
		for(k = j; k+1 < n && H[idx[k+1]] == H[idx[j]]; ++k){}
		for(int i = j; i<=k; ++i){
			auto itr = s.upper_bound(mp(idx[i], inf)); --itr;
			if(itr == s.end()) continue;
			int l = itr->F, r = itr->S;
			s.erase(itr);
			if(l <= idx[i]-1) s.emplace(l, idx[i]-1);
			if(idx[i]+1 <= r) s.emplace(idx[i]+1, r);
		}
		j = k+1; 
		mx = max(mx, (int)s.size());
	}
	return mx;
}

signed main(){
	int n; scanf("%d", &n);
	int H[n];
	for(int i = 0; i<n; ++i) scanf("%d", H+i);
	printf("%d", gw(n, H));
}

Compilation message

gw.cpp: In function 'int main()':
gw.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |  int n; scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
gw.cpp:45:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |  for(int i = 0; i<n; ++i) scanf("%d", H+i);
      |                           ~~~~~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2388 KB Output is correct
2 Correct 34 ms 2396 KB Output is correct
3 Correct 30 ms 2396 KB Output is correct
4 Correct 30 ms 2396 KB Output is correct
5 Correct 30 ms 2536 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 3124 KB Output is correct
2 Correct 26 ms 3984 KB Output is correct
3 Correct 44 ms 3156 KB Output is correct
4 Correct 44 ms 3152 KB Output is correct
5 Correct 43 ms 2904 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 650 ms 29008 KB Output is correct
2 Correct 671 ms 29012 KB Output is correct
3 Correct 676 ms 29072 KB Output is correct
4 Correct 665 ms 28896 KB Output is correct
5 Correct 657 ms 28500 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 708 ms 28516 KB Output is correct
2 Correct 709 ms 28496 KB Output is correct
3 Correct 721 ms 28492 KB Output is correct
4 Correct 391 ms 22608 KB Output is correct
5 Incorrect 394 ms 22732 KB Output isn't correct
6 Halted 0 ms 0 KB -