# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081948 | 2024-08-30T13:10:15 Z | farica | Radio Towers (IOI22_towers) | C++17 | 4000 ms | 5668 KB |
#include "towers.h" #include <bits/stdc++.h> using namespace std; int n,sub1=1,idx=0; vector<int> h; void init(int N, vector<int> H) { h.clear(); sub1 = 1; n = N; for(auto x : H) h.push_back(x); int ok=1; for(int i=0; i<H.size()-1; i++) { if(ok and H[i] > H[i+1]) { ok=0; idx = i; } if(!ok and H[i] < H[i+1]) sub1=0; } } int max_towers(int L, int R, int D) { if(sub1) { if(idx > L and idx < R and (h[L]+D) <= h[idx] and (h[R]+D) <= h[idx]) return 2; else return 1; } int ans=0; set<int>s; map<int,int>m; for(int i=L+1; i<=R; i++) { auto it = s.lower_bound(h[i]+D); m[h[i]] = ans; if(it != s.end()) ans = max(ans, m[*it]+1); while(!s.empty() && *(s.begin()) < h[i]) s.erase(s.begin()); s.insert(h[i]); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 319 ms | 1236 KB | Output is correct |
2 | Correct | 613 ms | 1744 KB | Output is correct |
3 | Correct | 593 ms | 1748 KB | Output is correct |
4 | Correct | 621 ms | 1744 KB | Output is correct |
5 | Correct | 728 ms | 1748 KB | Output is correct |
6 | Correct | 544 ms | 1748 KB | Output is correct |
7 | Correct | 655 ms | 1748 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '13', found: '14' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '13', found: '14' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4025 ms | 5668 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4024 ms | 1624 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '13', found: '14' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 319 ms | 1236 KB | Output is correct |
2 | Correct | 613 ms | 1744 KB | Output is correct |
3 | Correct | 593 ms | 1748 KB | Output is correct |
4 | Correct | 621 ms | 1744 KB | Output is correct |
5 | Correct | 728 ms | 1748 KB | Output is correct |
6 | Correct | 544 ms | 1748 KB | Output is correct |
7 | Correct | 655 ms | 1748 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 344 KB | Output is correct |
11 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '13', found: '14' |
12 | Halted | 0 ms | 0 KB | - |