제출 #983587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
983587		shadow_sami	모임들 (IOI18_meetings)	C++17	17 / 100	78 ms	24972 KiB

meetings

#include<bits/stdc++.h>
#include "meetings.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,cnt,sum,tptp,ans;
const ll mx = 1e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[mx];
ll l[mx];
ll r[mx];
ll le[mx];
ll re[mx];

array<ll,4> aa = {0,0,0,0};

typedef struct SEGMENT_TREE{
	vector<array<ll,4>> arr;
	vi laz;
	ll range;
	void init(ll k){
		range = 4 * k;		
		arr.resize(range);
		laz.resize(range);
		fip(0,range){
			fjp(0,4)
				arr[i][j] = 0;
			laz[i] = -1;
		}
		return;
	}
	array<ll,4> combine(array<ll,4> l,array<ll,4> r){	
		array<ll,4> res;		
		res[0] = l[0] + r[0];
		res[1] = l[1];
		if(l[3]==l[0])
			res[1] = max(res[1],l[0]+r[1]);
		res[2] = r[2];
		if(r[3]==r[0])
			res[2] = max(res[2],r[0]+l[2]);		
		res[3] = max(l[3],r[3]);
		res[3] = max(l[2]+r[1],res[3]);
		return res;
	}
	void build(ll ptr,ll l,ll r){
		if(l==r){
			arr[ptr][0] = 1;
			arr[ptr][1] = (a[l]==1);
			arr[ptr][2] = (a[l]==1);
			arr[ptr][3] = (a[l]==1);
			return;
		}
		ll mid = l + (r-l) / 2;
		build(2*ptr,l,mid);
		build(2*ptr+1,mid+1,r);
		arr[ptr] = combine(arr[2*ptr],arr[2*ptr+1]);
		return;
	}
	array<ll,4> query(ll ptr,ll l,ll r,ll st,ll en){
		if(l>en || r<st)
			return aa;
		if(l>=st && r<=en)
			return arr[ptr];
		ll mid = l + (r-l) / 2;
		return combine(query(2*ptr,l,mid,st,en),query(2*ptr+1,mid+1,r,st,en));		
	}
	void deb(ll ptr,ll l,ll r){
		cerr<<ptr<<" "<<l<<" "<<r<<nli;
		cerr<<arr[ptr][3]<<nli;
		if(l==r)
			return;
		ll mid = l + (r-l) / 2;
		deb(2*ptr,l,mid);
		deb(2*ptr+1,mid+1,r);
		return;
	}
}SGT;

SGT sgt;

vector<long long> minimum_costs(vector<int> H, vector<int> L,vector<int> R) {
  	n = H.size();
  	m = L.size();
  	fip(0,n)
  		a[i] = H[i];
  	fip(0,m){
  		l[i] = L[i];
  		r[i] = R[i];
  	}  	
  	vi na(m);
  	sgt.init(n);
  	sgt.build(1,0,n-1);
  	// sgt.deb(1,0,n-1);
  	fip(0,m)
  		na[i] = 2*(r[i]-l[i]+1) - sgt.query(1,0,n-1,l[i],r[i])[3];
  	return na;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         cin>>n>>m;
//         vector<int> H(n),L(m),R(m);
//         fip(0,n)
//         	cin>>H[i];
//         fip(0,m)
//         	cin>>L[i]>>R[i];
//         vi na = minimum_costs(H,L,R);
//         fx(na)
//         	cout<<x<<nli;
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 17 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40