제출 #544137

#제출 시각아이디문제언어결과실행 시간메모리
544137Sho10popa (BOI18_popa)C++17
100 / 100
83 ms440 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...