| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 887053 |
2023-12-13T14:42:43 Z |
nnhzzz |
Zoltan (COCI16_zoltan) |
C++14 |
|
86 ms |
5080 KB |
/* [Author: Nguyen Ngoc Hung] - From THPT Ngo Gia Tu with Love */
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <locale>
#include <map>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <unordered_set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <cmath>
#include <array>
#include <cassert>
#include <random>
#include <chrono>
using namespace std;
#define __nnhzzz__ signed main()
#define BIT(i,j) (((i)>>(j))&1LL)
#define MASK(i) (1LL<<(i))
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define fi first
#define se second
#define ll long long
#define ld long double
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int,int>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define REPDIS(i,be,en,j) for(int i = (be); i<=(en); i+=j)
#define REPD(i,be,en) for(int i = (be); i>=(en); i--)
#define REP(i,be,en) for(int i = (be); i<=(en); i++)
#define endl "\n"
#define MP make_pair
// #define int ll
//-----------------------------------------------------------------------------------------------//
int readInt(){
char c;
do{ c = getchar(); }while(c!='-' && !isdigit(c));
bool neg = (c=='-');
int res = neg?0:c-'0';
while(isdigit(c=getchar())) res = (res<<3)+(res<<1)+(c-'0');
return neg?-res:res;
}
//------------------------------------------------------------------------------------------------//
const ll LINF = 1e18;
const int INF = 1e9;
const int LOG = 20;
const int MAXN = 5e5+7;
const int N = 1e2+3;
const int MOD = 1e9+7;
const int BASE = 1e5;
const ld EPS = 1e-9;
const ld PI = acos(-1);
const int OFFSET = 1e3;
//------------------------------------------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }
//------------------------------------------------------------------------------------------------//
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Nguyen Ngoc Hung - nnhzzz
Training for VOI24 gold medal
----------------------------------------------------------------
*/
struct fenwick_tree{
vpii f;
int n;
pii combine(const pii &u, const pii &v){
if(u.fi<v.fi) return v;
if(u.fi>v.fi) return u;
return MP(u.fi,(u.se+v.se)%MOD);
}
void update(int id, const pii &val){
for(; id<=n; id+=id&-id) f[id] = combine(f[id],val);
}
pii get(int id){
pii res = MP(0,1);
for(; id>0; id-=id&-id) res = combine(res,f[id]);
++res.fi;
return res;
}
fenwick_tree(int _n):n(_n){
f.assign(n+3,MP(0,0));
}
};
int POW(int a, int b){
int res = 1;
while(b>0){
if(b&1) res = 1LL*res*a%MOD;
a = 1LL*a*a%MOD;
b >>= 1;
}
return res;
}
int a[MAXN];
void solve(){
int cnt = 0,res = 0,n = readInt();
vi cur;
REP(i,1,n){
a[i] = readInt();
cur.push_back(a[i]);
}
sort(ALL(cur)); cur.resize(unique(ALL(cur))-cur.begin());
fenwick_tree f(n+1),g(n+1);
REPD(i,n,1){
a[i] = upper_bound(ALL(cur),a[i])-cur.begin();
pii dec = f.get(a[i]-1);
pii asc = g.get(n-a[i]);
int now = dec.fi+asc.fi-1;
if(maxi(res,now)) cnt = 1LL*dec.se*asc.se%MOD;
else if(now==res) cnt = (cnt+1LL*dec.se*asc.se%MOD)%MOD;
f.update(a[i],dec);
g.update(n-a[i]+1,asc);
}
cout << res << " " << 1LL*cnt*POW(2,n-res)%MOD;
}
__nnhzzz__{
ios::sync_with_stdio(0);
// cin.tie(0); cout.tie(0);
#define task "test"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
#define task1 "nnhzzz"
if(fopen(task1".inp","r")){
freopen(task1".inp","r",stdin);
freopen(task1".out","w",stdout);
}
int test = 1;
while(test--){
solve();
}
cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
return 0;
}
/** /\_/\
* (= ._.)
* / >TL \>AC
**/
Compilation message
zoltan.cpp: In function 'int main()':
zoltan.cpp:166:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
166 | freopen(task".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
zoltan.cpp:167:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
167 | freopen(task".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
zoltan.cpp:171:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
171 | freopen(task1".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
zoltan.cpp:172:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
172 | freopen(task1".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
600 KB |
Output is correct |
| 11 |
Correct |
43 ms |
4308 KB |
Output is correct |
| 12 |
Correct |
38 ms |
3796 KB |
Output is correct |
| 13 |
Correct |
35 ms |
3624 KB |
Output is correct |
| 14 |
Correct |
56 ms |
3800 KB |
Output is correct |
| 15 |
Correct |
70 ms |
4568 KB |
Output is correct |
| 16 |
Correct |
86 ms |
5080 KB |
Output is correct |
| 17 |
Correct |
53 ms |
5076 KB |
Output is correct |
| 18 |
Correct |
51 ms |
5080 KB |
Output is correct |
| 19 |
Correct |
51 ms |
5080 KB |
Output is correct |
| 20 |
Correct |
58 ms |
5080 KB |
Output is correct |
