| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 525454 | 2022-02-11T16:43:40 Z | omohamadooo | Secret (JOI14_secret) | C++14 | Compilation error |
0 ms | 0 KB |
#include "secret.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll,ll >
#define F first
# define S second
#define all(x) (x).begin(),(x).end()
using namespace std;
using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
Compilation message
secret.cpp:14:171: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:246: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:249: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:263: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:266: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:278: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:281: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:284: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:287: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:310: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:313: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:316: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(ll i=0;i<n;i++) v.pb(a[i]); get(0,n-1,0);} ll get_ans(ll segl,ll segr,ll l,ll r,ll lg){ ll m = (segl + segr)/2; if(m >= l && m < r){ return Secret(suf[l][lg] , pref[r][lg]); } if(l > m) return get_ans(m+1,segr,l,r,lg+1); else return get_ans(segl,m,l,r,lg+1);} int Query(int l, int r){ if(l == r) return v[l]; return get_ans(0,n-1 , l,r , 0);}
| ^
secret.cpp:14:319: error: extended character is not valid in an identifier
14 | using namespace __gnu_pbds; typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set; const int MOD=998244353 ;const int N=1e6+ 7;const ll INF= 1e18+10; struct trp{ll F,S,T;}; ll po(ll x,ll y){ ll ans = 1; while(y){ if( y & 1 ) ans *=x; y /= 2; x *=x; x %= MOD; ans %= MOD; } return ans;} int n;ll suf[N][20];ll pref[N][20];vector<int>v; void get(ll l,ll r,ll lg){ if(l == r) return; ll m = (l+r)/2; suf[m][lg] = v[m]; pref[m+1][lg] = v[m+1]; ll j = 1; for(ll i= m-1;i>=l;i--){ suf[i][lg] = Secret(suf[i+1][lg] , v[i]); } j = 1; for(ll i=m+2;i<=r;i++){ pref[i][lg] = Secret(pref[i-1][lg] , v[i]); } get(l,m,lg+1); get(m+1,r,lg+1);} void Init(int f , int *a){ n = f; for(