oj.uz

Submission #238426

# Submission time Handle Problem Language Result Execution time Memory
238426 2020-06-11T07:58:15 Z b00n0rp Constellation 3 (JOI20_constellation3) C++17
100 / 100
 681 ms 150520 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,m,root,total;
int a[200005],lg2[200005];
pii mx[200005][21];

pii stmx(int l,int r){
	return max(mx[l][lg2[r-l+1]],mx[r-(1<<lg2[r-l+1])+1][lg2[r-l+1]]);
}

vi adj[200005];
vpii bruh[200005];
int par[200005][21];
int dep[200005];

void form_tree(int l,int r,int u,int d = 0){
	dep[u] = d;
	if(l < u){
		int gg = stmx(l,u-1).S;
		adj[u].pb(gg);
		par[gg][0] = u;
		form_tree(l,u-1,gg,d+1);
	}
	if(r > u){
		int gg = stmx(u+1,r).S;
		adj[u].pb(gg);
		par[gg][0] = u;
		form_tree(u+1,r,gg,d+1);
	}
}
 
int tim = 0;
int lft[200005],rgt[200005];

void euler(int u){
	lft[u] = tim;
	tim++;
	for(auto v:adj[u]){
		euler(v);
	}
	rgt[u] = tim;
}

int seg[400005],dp[200005][2];

int quer(int p){
	p += n;
	int res = 0;
	while(p){
		res += seg[p];
		p /= 2;
	}
	return res;
}

void upd(int l,int r,int val){
	l += n;
	r += n;
	while(l < r){
		if(l%2) seg[l++] += val;
		if(r%2) seg[--r] += val;
		l /= 2;
		r /= 2;
	}
}

void dfs(int u){
	dp[u][0] = 0;
	for(auto v:adj[u]){
		dfs(v);
		dp[u][0] += dp[v][1];
	}
	dp[u][1] = dp[u][0];
	for(auto x:bruh[u]){
		remax(dp[u][1],dp[u][0]+x.S-quer(lft[x.F]));
	}
	upd(lft[u],rgt[u],dp[u][1]-dp[u][0]);
	// trace(u,dp[u][0],dp[u][1],lft[u],rgt[u],bruh[u].size());
	// for(auto x:bruh[u]) trace(x.F,x.S);
	// FOR(i,1,n+1){
	// 	trace(i,lft[i],quer(lft[i]));
	// }
}

void solvethetestcase(){
	sfl(n)
	lg2[1] = 0;
	FOR(i,1,n+1){
		sfl(a[i])
		mx[i][0] = {a[i],i};
		if(i > 1) lg2[i] = 1+lg2[i/2];
	}
	FOR(j,1,21){
		FOR(i,1,n+1){
			if(i+(1<<(j-1)) > n) mx[i][j] = mx[i][j-1];
			else mx[i][j] = max(mx[i][j-1],mx[i+(1<<(j-1))][j-1]);
		}
	}
	root = stmx(1,n).S;
	par[root][0] = root;
	form_tree(1,n,root);
	FOR(j,1,21){
		FOR(i,1,n+1){
			par[i][j] = par[par[i][j-1]][j-1];
		}
	}
	sfl(m)
	REP(i,m){
		int x,y,c;
		sfl3(x,y,c);
		total += c;
		int u = x;
		FORD(j,20,0){
			if(y > a[par[u][j]]) u = par[u][j];
		}
		bruh[u].pb({x,c});
	}
	tim = 0;
	euler(root);
	dfs(root);
	pfl(total-dp[root][1])
}
/*
5
1 3 4 2 3
3
1 5 3
4 3 2
2 4 2

7
5 6 2 3 6 7 6
5
7 7 5
3 3 7
3 7 10
1 7 6
4 7 8

8
6 8 5 7 3 4 2 1
10
8 2 9
6 6 7
8 3 18
5 8 17
8 5 3
5 5 3
5 4 8
1 8 13
1 7 5
7 4 13
*/

Compilation message

constellation3.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
constellation3.cpp:6:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN NEEDED)\
 ^
constellation3.cpp:56:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
constellation3.cpp:212:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR CIN/COUT) \
  ^
constellation3.cpp:217:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ^
constellation3.cpp:220:3: warning: multi-line comment [-Wcomment]
   // (UNCOMMENT FOR CODEJAM) \
   ^
constellation3.cpp: In function 'void solvethetestcase()':
constellation3.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);
                ~~~~~^~~~~~~~~~~
constellation3.cpp:309:2: note: in expansion of macro 'sfl'
  sfl(n)
  ^~~
constellation3.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);
                ~~~~~^~~~~~~~~~~
constellation3.cpp:312:3: note: in expansion of macro 'sfl'
   sfl(a[i])
   ^~~
constellation3.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);
                ~~~~~^~~~~~~~~~~
constellation3.cpp:330:2: note: in expansion of macro 'sfl'
  sfl(m)
  ^~~
constellation3.cpp:97:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
constellation3.cpp:333:3: note: in expansion of macro 'sfl3'
   sfl3(x,y,c);
   ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9984 KB Output is correct
2 Correct 11 ms 10112 KB Output is correct
3 Correct 11 ms 9984 KB Output is correct
4 Correct 11 ms 9984 KB Output is correct
5 Correct 10 ms 9984 KB Output is correct
6 Correct 12 ms 9984 KB Output is correct
7 Correct 10 ms 9984 KB Output is correct
8 Correct 11 ms 9984 KB Output is correct
9 Correct 11 ms 9984 KB Output is correct
10 Correct 11 ms 9984 KB Output is correct
11 Correct 12 ms 9984 KB Output is correct
12 Correct 12 ms 10056 KB Output is correct
13 Correct 11 ms 9984 KB Output is correct
14 Correct 10 ms 9984 KB Output is correct
15 Correct 11 ms 9984 KB Output is correct
16 Correct 11 ms 9984 KB Output is correct
17 Correct 11 ms 9984 KB Output is correct
18 Correct 11 ms 9984 KB Output is correct
19 Correct 11 ms 9984 KB Output is correct
20 Correct 10 ms 9984 KB Output is correct
21 Correct 11 ms 9984 KB Output is correct
22 Correct 11 ms 9984 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9984 KB Output is correct
2 Correct 11 ms 10112 KB Output is correct
3 Correct 11 ms 9984 KB Output is correct
4 Correct 11 ms 9984 KB Output is correct
5 Correct 10 ms 9984 KB Output is correct
6 Correct 12 ms 9984 KB Output is correct
7 Correct 10 ms 9984 KB Output is correct
8 Correct 11 ms 9984 KB Output is correct
9 Correct 11 ms 9984 KB Output is correct
10 Correct 11 ms 9984 KB Output is correct
11 Correct 12 ms 9984 KB Output is correct
12 Correct 12 ms 10056 KB Output is correct
13 Correct 11 ms 9984 KB Output is correct
14 Correct 10 ms 9984 KB Output is correct
15 Correct 11 ms 9984 KB Output is correct
16 Correct 11 ms 9984 KB Output is correct
17 Correct 11 ms 9984 KB Output is correct
18 Correct 11 ms 9984 KB Output is correct
19 Correct 11 ms 9984 KB Output is correct
20 Correct 10 ms 9984 KB Output is correct
21 Correct 11 ms 9984 KB Output is correct
22 Correct 11 ms 9984 KB Output is correct
23 Correct 13 ms 11008 KB Output is correct
24 Correct 13 ms 11008 KB Output is correct
25 Correct 14 ms 11008 KB Output is correct
26 Correct 13 ms 11008 KB Output is correct
27 Correct 13 ms 11008 KB Output is correct
28 Correct 13 ms 11008 KB Output is correct
29 Correct 13 ms 11008 KB Output is correct
30 Correct 13 ms 11008 KB Output is correct
31 Correct 13 ms 11008 KB Output is correct
32 Correct 13 ms 11008 KB Output is correct
33 Correct 13 ms 11136 KB Output is correct
34 Correct 13 ms 11008 KB Output is correct
35 Correct 13 ms 11136 KB Output is correct
36 Correct 13 ms 11136 KB Output is correct
37 Correct 13 ms 11136 KB Output is correct
38 Correct 13 ms 11136 KB Output is correct
39 Correct 14 ms 11008 KB Output is correct
40 Correct 13 ms 11136 KB Output is correct
41 Correct 13 ms 11008 KB Output is correct
42 Correct 12 ms 11008 KB Output is correct
43 Correct 13 ms 11136 KB Output is correct
44 Correct 13 ms 11008 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9984 KB Output is correct
2 Correct 11 ms 10112 KB Output is correct
3 Correct 11 ms 9984 KB Output is correct
4 Correct 11 ms 9984 KB Output is correct
5 Correct 10 ms 9984 KB Output is correct
6 Correct 12 ms 9984 KB Output is correct
7 Correct 10 ms 9984 KB Output is correct
8 Correct 11 ms 9984 KB Output is correct
9 Correct 11 ms 9984 KB Output is correct
10 Correct 11 ms 9984 KB Output is correct
11 Correct 12 ms 9984 KB Output is correct
12 Correct 12 ms 10056 KB Output is correct
13 Correct 11 ms 9984 KB Output is correct
14 Correct 10 ms 9984 KB Output is correct
15 Correct 11 ms 9984 KB Output is correct
16 Correct 11 ms 9984 KB Output is correct
17 Correct 11 ms 9984 KB Output is correct
18 Correct 11 ms 9984 KB Output is correct
19 Correct 11 ms 9984 KB Output is correct
20 Correct 10 ms 9984 KB Output is correct
21 Correct 11 ms 9984 KB Output is correct
22 Correct 11 ms 9984 KB Output is correct
23 Correct 13 ms 11008 KB Output is correct
24 Correct 13 ms 11008 KB Output is correct
25 Correct 14 ms 11008 KB Output is correct
26 Correct 13 ms 11008 KB Output is correct
27 Correct 13 ms 11008 KB Output is correct
28 Correct 13 ms 11008 KB Output is correct
29 Correct 13 ms 11008 KB Output is correct
30 Correct 13 ms 11008 KB Output is correct
31 Correct 13 ms 11008 KB Output is correct
32 Correct 13 ms 11008 KB Output is correct
33 Correct 13 ms 11136 KB Output is correct
34 Correct 13 ms 11008 KB Output is correct
35 Correct 13 ms 11136 KB Output is correct
36 Correct 13 ms 11136 KB Output is correct
37 Correct 13 ms 11136 KB Output is correct
38 Correct 13 ms 11136 KB Output is correct
39 Correct 14 ms 11008 KB Output is correct
40 Correct 13 ms 11136 KB Output is correct
41 Correct 13 ms 11008 KB Output is correct
42 Correct 12 ms 11008 KB Output is correct
43 Correct 13 ms 11136 KB Output is correct
44 Correct 13 ms 11008 KB Output is correct
45 Correct 451 ms 136432 KB Output is correct
46 Correct 448 ms 135160 KB Output is correct
47 Correct 442 ms 133112 KB Output is correct
48 Correct 443 ms 136568 KB Output is correct
49 Correct 447 ms 132472 KB Output is correct
50 Correct 437 ms 132476 KB Output is correct
51 Correct 441 ms 132728 KB Output is correct
52 Correct 449 ms 135416 KB Output is correct
53 Correct 451 ms 135480 KB Output is correct
54 Correct 681 ms 144996 KB Output is correct
55 Correct 655 ms 139640 KB Output is correct
56 Correct 631 ms 137360 KB Output is correct
57 Correct 638 ms 135288 KB Output is correct
58 Correct 524 ms 139616 KB Output is correct
59 Correct 534 ms 138872 KB Output is correct
60 Correct 334 ms 150520 KB Output is correct
61 Correct 445 ms 136548 KB Output is correct
62 Correct 661 ms 142620 KB Output is correct
63 Correct 444 ms 134260 KB Output is correct
64 Correct 427 ms 132084 KB Output is correct
65 Correct 656 ms 144268 KB Output is correct
66 Correct 431 ms 132716 KB Output is correct