oj.uz

Submission #983568

# Submission time Handle Problem Language Result Execution time Memory
983568 2024-05-15T17:55:09 Z shadow_sami Meetings (IOI18_meetings) C++17
19 / 100
 5500 ms 9740 KB 
#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,res,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];
ll dp[mx];
stack<pi> sck;


void emptify(){
	while(sck.size())
		sck.pop();
	return;
}

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;
  	fip(0,m){
  		ans = 1e18;  		
  		fjp(0,n)
  			dp[j] = 0;  		
  		emptify();
  		res = 0;
  		fjp(l[i],r[i]+1){
  			tp = j;
  			while(sck.size() && a[sck.top().ff] <= a[j]){  				
  				res -= (sck.top().ff-sck.top().ss+1) * a[sck.top().ff];  				
  				tp = sck.top().ss;
	  			sck.pop();	  			
  			}
	  		sck.push({j,tp});	  		
	  		res += (j-tp+1) * a[j];	  	  		
	  		dp[j] += res;
  		}
  		emptify();
  		res = 0;
  		fjn(r[i],l[i]){
  			tp = j;
  			while(sck.size() && a[sck.top().ff] <= a[j]){  				
  				res -= (sck.top().ss-sck.top().ff+1) * a[sck.top().ff];  				
  				tp = sck.top().ss;
	  			sck.pop();	  			
  			}  			  			
	  		sck.push({j,tp});	  		
	  		res += (tp-j+1) * a[j];	  		 			  		
	  		dp[j] += res;
	  		ans = min(ans,dp[j]-a[j]);
  		}
  		na.push_back(ans);
  	}
  	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
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2532 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2532 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 263 ms 2660 KB Output is correct
11 Correct 835 ms 2764 KB Output is correct
12 Correct 267 ms 3048 KB Output is correct
13 Correct 845 ms 3040 KB Output is correct
14 Correct 210 ms 2896 KB Output is correct
15 Correct 216 ms 2764 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 3712 ms 4092 KB Output is correct
3 Execution timed out 5563 ms 9740 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 3712 ms 4092 KB Output is correct
3 Execution timed out 5563 ms 9740 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2532 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 263 ms 2660 KB Output is correct
11 Correct 835 ms 2764 KB Output is correct
12 Correct 267 ms 3048 KB Output is correct
13 Correct 845 ms 3040 KB Output is correct
14 Correct 210 ms 2896 KB Output is correct
15 Correct 216 ms 2764 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 3712 ms 4092 KB Output is correct
18 Execution timed out 5563 ms 9740 KB Time limit exceeded
19 Halted 0 ms 0 KB -