# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029455 | 2024-07-20T22:19:45 Z | rsinventor | Global Warming (NOI13_gw) | C++17 | 172 ms | 14932 KB |
#include <bits/stdc++.h> using namespace std; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); // freopen("warming.in", "r", stdin); // freopen("warming.out", "w", stdout); int n; cin >> n; int h[n]; vector<pair<int, int>> sh2(n); for(int i = 0; i < n; i++) { cin >> h[i]; sh2[i].first = h[i]; sh2[i].second = i; } sort(sh2.begin(), sh2.end()); int mx_islands = 0; int islands = 0; for(int i = 0; i < n; i++) { if(max(0, h[i])>0 && (i==0 || max(0, h[i-1])==0)) islands++; } mx_islands = max(mx_islands, islands); for(int i = 0; i < sh2.size(); i++) { int s = sh2[i].second; islands++; if(h[s+1]<h[s]) { islands--; } if(h[s-1]<=h[s]) { islands--; } if(i==n-1 || sh2[i].first!=sh2[i+1].first) { mx_islands = max(mx_islands, islands); } } cout << mx_islands << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 1628 KB | Output is correct |
2 | Correct | 13 ms | 1892 KB | Output is correct |
3 | Correct | 13 ms | 1884 KB | Output is correct |
4 | Correct | 12 ms | 1884 KB | Output is correct |
5 | Correct | 12 ms | 1884 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 1628 KB | Output is correct |
2 | Correct | 8 ms | 1640 KB | Output is correct |
3 | Correct | 15 ms | 1628 KB | Output is correct |
4 | Correct | 13 ms | 1648 KB | Output is correct |
5 | Correct | 16 ms | 1636 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 146 ms | 12124 KB | Output is correct |
2 | Correct | 141 ms | 12120 KB | Output is correct |
3 | Correct | 143 ms | 12120 KB | Output is correct |
4 | Correct | 147 ms | 12120 KB | Output is correct |
5 | Correct | 151 ms | 12124 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 172 ms | 12120 KB | Output is correct |
2 | Correct | 159 ms | 12120 KB | Output is correct |
3 | Correct | 148 ms | 12124 KB | Output is correct |
4 | Correct | 132 ms | 12124 KB | Output is correct |
5 | Incorrect | 133 ms | 14932 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |