oj.uz

Submission #1085618

# Submission time Handle Problem Language Result Execution time Memory
1085618 2024-09-08T13:36:50 Z Sunbae Global Warming (NOI13_gw) C++17
19 / 40
 1000 ms 65536 KB 
#include <bits/stdc++.h>
#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 + 5, inf = 1e9;
int cp[N], a[N], m;
set<pii> s;
vector<int> to_remove[N];
int gw(int n, int H[]){
	for(int i = m = 0; i<n; ++i) cp[m++] = H[i];
	cp[m++] = 0;
	for(int i = 0; i<m; ++i) to_remove[i].clear();
	sort(cp, cp+m); m = unique(cp, cp+m) - cp;
	for(int i = 0; i<n; ++i) to_remove[a[i] = lower_bound(cp, cp+m, H[i]) - cp].push_back(i);
	for(int i = 0, j = 0; i<n; ){
		for(; j<n && a[j+1] > 0; ++j){}
		s.emplace(i, j);
		i = j+2; j = i;
	}
	int mx = (int)s.size();
	for(int t = 1; t<m; ++t){
		for(int j : to_remove[t]){
			set<pii>::iterator itr = (--s.upper_bound(mp(j, inf)));
			if(itr == s.end()) continue;
			int l = itr->F, r = itr->S;
			s.erase(itr);
			if(l <= j-1) s.emplace(l, j-1);
			if(j+1 <= r) s.emplace(j+1, r);
		}
		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:38:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |  int n; scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
gw.cpp:40:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  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 10 ms 25180 KB Output is correct
2 Correct 11 ms 25436 KB Output is correct
3 Correct 10 ms 25180 KB Output is correct
4 Correct 13 ms 25176 KB Output is correct
5 Correct 10 ms 25180 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 27984 KB Output is correct
2 Correct 38 ms 27988 KB Output is correct
3 Correct 35 ms 27996 KB Output is correct
4 Correct 37 ms 27740 KB Output is correct
5 Correct 36 ms 27740 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 31056 KB Output is correct
2 Correct 43 ms 32084 KB Output is correct
3 Correct 72 ms 30980 KB Output is correct
4 Correct 66 ms 30948 KB Output is correct
5 Correct 69 ms 31064 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 422 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

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