oj.uz

Submission #422047

# Submission time Handle Problem Language Result Execution time Memory
422047 2021-06-09T16:03:06 Z amunduzbaev Snowball (JOI21_ho_t2) C++14
100 / 100
 170 ms 12876 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
int qq[N], mn[N], mx[N];

pii rng(int i, int r) { return mp(a[i] + mn[r], a[i] + mx[r]); }

void solve(int t_case){
	cin>>n>>q;
	a[0] = -inf, a[n+1] = inf;
	for(int i=1;i<=n;i++) cin>>a[i];
	int tt = 0;
	for(int i=0;i<q;i++){
		cin>>qq[i], tt += qq[i];
		umin(mn[i], tt), umax(mx[i], tt);
		if(i) umin(mn[i], mn[i-1]), umax(mx[i], mx[i-1]);
	}
	
	//~ for(int i=0;i<q;i++) cout<<mn[i]<<" "<<mx[i]<<"\n";
	
	for(int i=1;i<=n;i++){
		int l = 0, r = q-1;
		int L, R;
		if(rng(i-1, r).ss >= rng(i, r).ff){
			while(l < r){
				int m = (l + r)>>1;
				pii mx = rng(i, m), lx = rng(i - 1, m);
				if(lx.ss >= mx.ff) r = m;
				else l = m + 1;
			} pii lx = rng(i-1, l), m = rng(i, l);
			if(qq[l] > 0) L = m.ff;
			else L = lx.ss;
		} else L = rng(i, r).ff;
		
		l = 0, r = q-1;
		if(rng(i, r).ss >= rng(i+1, r).ff){
			while(l < r){
				int m = (l + r)>>1;
				pii mx = rng(i, m), rx = rng(i + 1, m);
				if(mx.ss >= rx.ff) r = m;
				else l = m + 1;
			} pii m = rng(i, l), rx = rng(i+1, l);
			//~ cout<<l<<" ";
			if(qq[l] < 0) R = m.ss;
			else R = rx.ff;
		} else R = rng(i, r).ss;
		
		//~ cout<<L<<" "<<R<<"\n";
		cout<<R - L<<"\n";
	}
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

Main.cpp: In function 'void usaco(std::string)':
Main.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

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

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 34 ms 4912 KB Output is correct
21 Correct 32 ms 5004 KB Output is correct
22 Correct 32 ms 4888 KB Output is correct
23 Correct 31 ms 4996 KB Output is correct
24 Correct 40 ms 5316 KB Output is correct
25 Correct 152 ms 11820 KB Output is correct
26 Correct 148 ms 11708 KB Output is correct
27 Correct 150 ms 11424 KB Output is correct
28 Correct 155 ms 11560 KB Output is correct
29 Correct 151 ms 11032 KB Output is correct
30 Correct 139 ms 10588 KB Output is correct
31 Correct 92 ms 9316 KB Output is correct
32 Correct 77 ms 7684 KB Output is correct
33 Correct 14 ms 1520 KB Output is correct
34 Correct 165 ms 12216 KB Output is correct
35 Correct 167 ms 11572 KB Output is correct
36 Correct 154 ms 11808 KB Output is correct
37 Correct 163 ms 11652 KB Output is correct
38 Correct 170 ms 11412 KB Output is correct
39 Correct 141 ms 11668 KB Output is correct
40 Correct 102 ms 11716 KB Output is correct
41 Correct 42 ms 6140 KB Output is correct
42 Correct 65 ms 6860 KB Output is correct
43 Correct 102 ms 12700 KB Output is correct
44 Correct 37 ms 7504 KB Output is correct
45 Correct 84 ms 11604 KB Output is correct
46 Correct 102 ms 12864 KB Output is correct
47 Correct 104 ms 12876 KB Output is correct
48 Correct 120 ms 11260 KB Output is correct