# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
998045 | 2024-06-13T08:48:26 Z | guagua0407 | Editor (BOI15_edi) | C++17 | 164 ms | 30292 KB |
//#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int,int> #define f first #define s second #define all(x) x.begin(),x.end() #define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int dx[4]={0,0,1,-1}; int dy[4]={1,-1,0,0}; void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } const int mxn=3e5+5; int prv[mxn][20]; int e[mxn]; int lev[mxn]; int cur=0; int main() {_ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>e[i]; e[i]*=-1; lev[i]=max(0,e[i]); if(e[i]>0){ int x=i-1; for(int j=19;j>=0;j--){ if(lev[prv[x][j]]>=lev[i]){ x=prv[x][j]; } } x=prv[x][0]; if(lev[i-1]<lev[i]){ x=i-1; } int y=x-1; for(int j=19;j>=0;j--){ if(lev[prv[y][j]]>=lev[i]){ y=prv[y][j]; } } y=prv[y][0]; if(lev[x-1]<lev[i]){ y=x-1; } prv[i][0]=y; for(int j=1;j<20;j++){ prv[i][j]=prv[prv[i][j-1]][j-1]; } } int ans=i; for(int j=19;j>=0;j--){ if(lev[prv[ans][j]]>0){ ans=prv[ans][j]; } } if(lev[ans]>0) ans=prv[ans][0]; cout<<-e[ans]<<'\n'; } return 0; } //maybe its multiset not set //yeeorz //laborz
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | Output is correct |
2 | Correct | 2 ms | 2648 KB | Output is correct |
3 | Correct | 0 ms | 2396 KB | Output is correct |
4 | Correct | 0 ms | 2396 KB | Output is correct |
5 | Correct | 3 ms | 2908 KB | Output is correct |
6 | Correct | 0 ms | 2396 KB | Output is correct |
7 | Correct | 3 ms | 2904 KB | Output is correct |
8 | Correct | 0 ms | 2396 KB | Output is correct |
9 | Correct | 3 ms | 2908 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 104 ms | 28240 KB | Output is correct |
2 | Correct | 105 ms | 28160 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 52 ms | 9816 KB | Output is correct |
2 | Correct | 65 ms | 11856 KB | Output is correct |
3 | Correct | 126 ms | 24912 KB | Output is correct |
4 | Correct | 111 ms | 29524 KB | Output is correct |
5 | Correct | 114 ms | 30288 KB | Output is correct |
6 | Correct | 97 ms | 27388 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | Output is correct |
2 | Correct | 2 ms | 2648 KB | Output is correct |
3 | Correct | 0 ms | 2396 KB | Output is correct |
4 | Correct | 0 ms | 2396 KB | Output is correct |
5 | Correct | 3 ms | 2908 KB | Output is correct |
6 | Correct | 0 ms | 2396 KB | Output is correct |
7 | Correct | 3 ms | 2904 KB | Output is correct |
8 | Correct | 0 ms | 2396 KB | Output is correct |
9 | Correct | 3 ms | 2908 KB | Output is correct |
10 | Correct | 104 ms | 28240 KB | Output is correct |
11 | Correct | 105 ms | 28160 KB | Output is correct |
12 | Correct | 52 ms | 9816 KB | Output is correct |
13 | Correct | 65 ms | 11856 KB | Output is correct |
14 | Correct | 126 ms | 24912 KB | Output is correct |
15 | Correct | 111 ms | 29524 KB | Output is correct |
16 | Correct | 114 ms | 30288 KB | Output is correct |
17 | Correct | 97 ms | 27388 KB | Output is correct |
18 | Correct | 106 ms | 18360 KB | Output is correct |
19 | Correct | 123 ms | 18256 KB | Output is correct |
20 | Correct | 164 ms | 28756 KB | Output is correct |
21 | Correct | 112 ms | 29524 KB | Output is correct |
22 | Correct | 109 ms | 30292 KB | Output is correct |