# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994790 | 2024-06-08T05:46:46 Z | guagua0407 | Editor (BOI15_edi) | C++17 | 33 ms | 3420 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 e[mxn]; int main() {_ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>e[i]; //cout<<e[i]<<' '; } //cout<<'\n'; if(n<=5000){ vector<bool> active(n+1); vector<int> prv(n+1); set<pair<int,int>> S; S.insert({-1,0}); for(int i=1;i<=n;i++){ if(e[i]>=0){ active[i]=true; S.insert({i,e[i]}); } else{ active[i]=true; int x; for(int j=i-1;j>=0;j--){ if(active[j] and (e[j]>=0 or e[j]>e[i])){ x=j; break; } } //cout<<i<<' '<<x<<'\n'; prv[i]=x; while(e[x]<0){ active[x]=!active[x]; x=prv[x]; } active[x]=!active[x]; if(active[x]){ S.insert({x,e[x]}); } else{ S.erase({x,e[x]}); } } cout<<(*S.rbegin()).s<<'\n'; } return 0; } vector<int> ans; ans.push_back(0); for(int i=1;i<=n;i++){ if(e[i]>=0) ans.push_back(e[i]); else ans.pop_back(); cout<<ans.back()<<'\n'; } return 0; } //maybe its multiset not set //yeeorz //laborz
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 604 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 15 ms | 536 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 604 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 3420 KB | Output is correct |
2 | Correct | 33 ms | 3416 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 2264 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 604 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 15 ms | 536 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 604 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 604 KB | Output is correct |
10 | Correct | 33 ms | 3420 KB | Output is correct |
11 | Correct | 33 ms | 3416 KB | Output is correct |
12 | Incorrect | 16 ms | 2264 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |