# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
544137 |
2022-04-01T06:51:48 Z |
Sho10 |
popa (BOI18_popa) |
C++17 |
|
83 ms |
440 KB |
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#include "popa.h"
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=1000000007;
ld const PI=3.14159265359;
ll const MAX_N=3e5+5;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int solve(int n,int *left,int *right){
ll root=-1;
vector<ll>st;
for(ll i=0;i<n;i++)
{
left[i]=right[i]=-1;
while(st.size()&&query(st.back(),i,i,i)){
right[st.back()]=left[i];
left[i]=st.back();
st.pop_back();
}
if(st.size()){
right[st.back()]=i;
}else root=i;
st.pb(i);
}
return root;
}
/*
int32_t main(){
CODE_START;
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
208 KB |
Output is correct |
2 |
Correct |
7 ms |
208 KB |
Output is correct |
3 |
Correct |
8 ms |
208 KB |
Output is correct |
4 |
Correct |
9 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
77 ms |
304 KB |
Output is correct |
2 |
Correct |
83 ms |
208 KB |
Output is correct |
3 |
Correct |
62 ms |
292 KB |
Output is correct |
4 |
Correct |
76 ms |
312 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
79 ms |
284 KB |
Output is correct |
2 |
Correct |
78 ms |
440 KB |
Output is correct |
3 |
Correct |
82 ms |
292 KB |
Output is correct |
4 |
Correct |
70 ms |
412 KB |
Output is correct |