oj.uz

Submission #229479

# Submission time Handle Problem Language Result Execution time Memory
229479 2020-05-04T15:25:49 Z b00n0rp Global Warming (CEOI18_glo) C++17
100 / 100
 1258 ms 93280 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")\
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
	fact[0] = 1;
	FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
	ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
	REPD(i,FACSZ-1){
		ifact[i] = mul(i+1,ifact[i+1],c);
	}
}
 
int ncr(int n,int r,int c = MOD){
	return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
	// (UNCOMMENT FOR CIN/COUT) \
	FAST_IO
	PRECISION(10)
 
	int t = 1;
	// (UNCOMMENT FOR MULTIPLE TEST CASES) \
	sfl(t);
	FOR(testcase,1,t+1){
		// (UNCOMMENT FOR CODEJAM) \
		printf("Case #%lld: ",testcase); 
		solvethetestcase();
	}
}   
 
int n,x;
int a[200005],suflis[200005],preflis[200005];
const int MX = 1e6+1;
int seg[2*MX+5];
unordered_map<int,int> conv;

void upd(int ind,int val){
	// trace(ind,val);
	ind += MX;
	while(ind){
		remax(seg[ind],val);
		ind /= 2;
	}
}

int quer(int l,int r){
	// trace(l,r);
	l += MX;
	r += MX+1;
	int res = 0;
	while(l < r){
		if(l%2){
			remax(res,seg[l]);
			l++;
		}
		if(r%2){
			--r;	
			remax(res,seg[r]);
		}
		l /= 2;
		r /= 2;
	}
	return res;
}
 
void solvethetestcase(){
	sfl2(n,x)
	unordered_set<int> s;
	FOR(i,1,n+1){
		sfl(a[i])
		s.insert(a[i]);
		s.insert(a[i]-1);
		s.insert(a[i]+1);
		s.insert(a[i]-1+x);
	}
	s.insert(0);
	vi v;
	int cur = 0;
	for(auto x:s){
		v.pb(x);
	}
	sort(all(v));
	for(auto x:v){
		conv[x] = cur++;
	}
	suflis[n+1] = 0;
	preflis[0] = 0;
	REP(i,2*MX+5) seg[i] = 0;
	FORD(i,n,1){
		int x1 = quer(conv[a[i]+1],MX-1)+1;
		upd(conv[a[i]],x1);
		suflis[i] = x1;
		// trace(i,suflis[i]);
	}
	REP(i,2*MX+5) seg[i] = 0;
	FOR(i,1,n+1){
		int x1 = quer(0,conv[a[i]-1])+1;
		upd(conv[a[i]],x1);
		preflis[i] = x1;
		// trace(i,preflis[i]);
	}
	REP(i,2*MX+5) seg[i] = 0;
	int ans = 0;
	FOR(i,1,n+1){
		int x1 = quer(0,min(conv[a[i]-1+x],MX-1));	
		upd(conv[a[i]],preflis[i]);
		remax(ans,x1+suflis[i]);
		// trace(i,x1,x1+suflis[i]);
	}
	// cout << runtime() << endl;
	pfl(ans)
}

Compilation message

glo.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
glo.cpp:6:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN NEEDED)\
 ^
glo.cpp:56:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
glo.cpp:212:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR CIN/COUT) \
  ^
glo.cpp:217:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ^
glo.cpp:220:3: warning: multi-line comment [-Wcomment]
   // (UNCOMMENT FOR CODEJAM) \
   ^
glo.cpp: In function 'void solvethetestcase()':
glo.cpp:96:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
glo.cpp:262:2: note: in expansion of macro 'sfl2'
  sfl2(n,x)
  ^~~~
glo.cpp:95:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
glo.cpp:265:3: note: in expansion of macro 'sfl'
   sfl(a[i])
   ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16000 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 17 ms 16000 KB Output is correct
6 Correct 15 ms 16000 KB Output is correct
7 Correct 15 ms 16000 KB Output is correct
8 Correct 15 ms 16000 KB Output is correct
9 Correct 18 ms 16000 KB Output is correct
10 Correct 15 ms 16000 KB Output is correct
11 Correct 15 ms 16000 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16000 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 17 ms 16000 KB Output is correct
6 Correct 15 ms 16000 KB Output is correct
7 Correct 15 ms 16000 KB Output is correct
8 Correct 15 ms 16000 KB Output is correct
9 Correct 18 ms 16000 KB Output is correct
10 Correct 15 ms 16000 KB Output is correct
11 Correct 15 ms 16000 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 16 ms 16000 KB Output is correct
14 Correct 16 ms 16000 KB Output is correct
15 Correct 16 ms 16000 KB Output is correct
16 Correct 16 ms 16000 KB Output is correct
17 Correct 16 ms 16128 KB Output is correct
18 Correct 16 ms 16000 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16000 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 17 ms 16000 KB Output is correct
6 Correct 15 ms 16000 KB Output is correct
7 Correct 15 ms 16000 KB Output is correct
8 Correct 15 ms 16000 KB Output is correct
9 Correct 18 ms 16000 KB Output is correct
10 Correct 15 ms 16000 KB Output is correct
11 Correct 15 ms 16000 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 16 ms 16000 KB Output is correct
14 Correct 16 ms 16000 KB Output is correct
15 Correct 16 ms 16000 KB Output is correct
16 Correct 16 ms 16000 KB Output is correct
17 Correct 16 ms 16128 KB Output is correct
18 Correct 16 ms 16000 KB Output is correct
19 Correct 18 ms 16384 KB Output is correct
20 Correct 18 ms 16384 KB Output is correct
21 Correct 18 ms 16384 KB Output is correct
22 Correct 18 ms 16256 KB Output is correct
23 Correct 17 ms 16256 KB Output is correct
24 Correct 17 ms 16256 KB Output is correct
25 Correct 16 ms 16128 KB Output is correct
26 Correct 17 ms 16128 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 971 ms 77252 KB Output is correct
2 Correct 935 ms 77128 KB Output is correct
3 Correct 945 ms 77148 KB Output is correct
4 Correct 966 ms 77020 KB Output is correct
5 Correct 349 ms 48760 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 34736 KB Output is correct
2 Correct 217 ms 34748 KB Output is correct
3 Correct 201 ms 34720 KB Output is correct
4 Correct 87 ms 25988 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 50 ms 21536 KB Output is correct
7 Correct 149 ms 31152 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 53452 KB Output is correct
2 Correct 559 ms 53600 KB Output is correct
3 Correct 1258 ms 91480 KB Output is correct
4 Correct 476 ms 57028 KB Output is correct
5 Correct 121 ms 36528 KB Output is correct
6 Correct 213 ms 55420 KB Output is correct
7 Correct 214 ms 56056 KB Output is correct
8 Correct 369 ms 49784 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16000 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 17 ms 16000 KB Output is correct
6 Correct 15 ms 16000 KB Output is correct
7 Correct 15 ms 16000 KB Output is correct
8 Correct 15 ms 16000 KB Output is correct
9 Correct 18 ms 16000 KB Output is correct
10 Correct 15 ms 16000 KB Output is correct
11 Correct 15 ms 16000 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 16 ms 16000 KB Output is correct
14 Correct 16 ms 16000 KB Output is correct
15 Correct 16 ms 16000 KB Output is correct
16 Correct 16 ms 16000 KB Output is correct
17 Correct 16 ms 16128 KB Output is correct
18 Correct 16 ms 16000 KB Output is correct
19 Correct 18 ms 16384 KB Output is correct
20 Correct 18 ms 16384 KB Output is correct
21 Correct 18 ms 16384 KB Output is correct
22 Correct 18 ms 16256 KB Output is correct
23 Correct 17 ms 16256 KB Output is correct
24 Correct 17 ms 16256 KB Output is correct
25 Correct 16 ms 16128 KB Output is correct
26 Correct 17 ms 16128 KB Output is correct
27 Correct 971 ms 77252 KB Output is correct
28 Correct 935 ms 77128 KB Output is correct
29 Correct 945 ms 77148 KB Output is correct
30 Correct 966 ms 77020 KB Output is correct
31 Correct 349 ms 48760 KB Output is correct
32 Correct 203 ms 34736 KB Output is correct
33 Correct 217 ms 34748 KB Output is correct
34 Correct 201 ms 34720 KB Output is correct
35 Correct 87 ms 25988 KB Output is correct
36 Correct 16 ms 16000 KB Output is correct
37 Correct 50 ms 21536 KB Output is correct
38 Correct 149 ms 31152 KB Output is correct
39 Correct 551 ms 53452 KB Output is correct
40 Correct 559 ms 53600 KB Output is correct
41 Correct 1258 ms 91480 KB Output is correct
42 Correct 476 ms 57028 KB Output is correct
43 Correct 121 ms 36528 KB Output is correct
44 Correct 213 ms 55420 KB Output is correct
45 Correct 214 ms 56056 KB Output is correct
46 Correct 369 ms 49784 KB Output is correct
47 Correct 530 ms 54532 KB Output is correct
48 Correct 537 ms 54520 KB Output is correct
49 Correct 1238 ms 93280 KB Output is correct
50 Correct 452 ms 56956 KB Output is correct
51 Correct 132 ms 34360 KB Output is correct
52 Correct 172 ms 39592 KB Output is correct
53 Correct 218 ms 57080 KB Output is correct
54 Correct 220 ms 57720 KB Output is correct
55 Correct 826 ms 79088 KB Output is correct