# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72111 | 2018-08-26T05:20:15 Z | BOOM Tetris for Jeff(#2197, exqt, esselem) | Box Run (FXCUP3_box) | C++17 | 3 ms | 612 KB |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; stack<int> st; vector<int> h(n+1), res(n+1, -1); st.push(0); h[0] = 2e9; for(int i=1; i<=n; i++) { cin >> h[i]; while(h[st.top()] < h[i]) { int p = st.top(); st.pop(); int gap = i - st.top() - 1; if(res[gap] == -1) res[gap] = st.top()+1; } st.push(i); } for(int i=1; i<=n; i++) cout << res[i] << ' '; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 552 KB | Output is correct |
4 | Incorrect | 2 ms | 612 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 552 KB | Output is correct |
4 | Incorrect | 2 ms | 612 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |