oj.uz

답안 #1085638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1085638 2024-09-08T13:59:15 Z Sunbae 지구 온난화 (NOI13_gw) C++17
19 / 40
 983 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) if(H[i]) cp[m++] = H[i];
	for(int i = 0; i<m; ++i) to_remove[i].clear(); s.clear();
	sort(cp, cp+m); m = unique(cp, cp+m) - cp;
	for(int i = 0; i<n; ++i) if(H[i]) to_remove[lower_bound(cp, cp+m, H[i]) - cp].push_back(i);
	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;
	}
	int mx = (int)s.size();
	for(int t = 0; t<m; ++t){
		for(int j : to_remove[t]){
			auto 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 gw(int, int*)':
gw.cpp:14:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   14 |  for(int i = 0; i<m; ++i) to_remove[i].clear(); s.clear();
      |  ^~~
gw.cpp:14:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   14 |  for(int i = 0; i<m; ++i) to_remove[i].clear(); s.clear();
      |                                                 ^
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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 25180 KB Output is correct
2 Correct 10 ms 25180 KB Output is correct
3 Correct 10 ms 25180 KB Output is correct
4 Correct 9 ms 25180 KB Output is correct
5 Correct 10 ms 25172 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 27740 KB Output is correct
2 Correct 35 ms 27728 KB Output is correct
3 Correct 44 ms 27740 KB Output is correct
4 Correct 37 ms 27680 KB Output is correct
5 Correct 39 ms 27672 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 30144 KB Output is correct
2 Correct 42 ms 31260 KB Output is correct
3 Correct 68 ms 30036 KB Output is correct
4 Correct 72 ms 30288 KB Output is correct
5 Correct 75 ms 30292 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 435 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 983 ms 65536 KB Memory limit exceeded
2 Halted 0 ms 0 KB -