oj.uz

답안 #422037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
422037 2021-06-09T15:37:49 Z amunduzbaev Snowball (JOI21_ho_t2) C++14
33 / 100
 2500 ms 3936 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];

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];
	for(int i=0;i<q;i++) cin>>qq[i];
	for(int i=1;i<=n;i++){
		int lx = a[i-1], x = a[i] , rx = a[i+1]; 
		pii lr = {lx, lx}, mr = {x, x}, rr = {rx, rx};
		
		int l = -inf, r = -inf;
		for(int j=0;j<q;j++){
			if(qq[j] == 0) continue;
			lx+=qq[j], x+=qq[j], rx+=qq[j];
			umin(lr.ff, lx), umax(lr.ss, lx);
			umin(mr.ff, x), umax(mr.ss, x);
			umin(rr.ff, rx), umax(rr.ss, rx);
			if(l == -inf && lr.ss >= mr.ff){
				if(qq[j] > 0) l = mr.ff;
				else l = lr.ss;
			} if(r == -inf && rr.ff <= mr.ss){
				if(qq[j] > 0) r = rr.ff;
				else r = mr.ss;
			}
		} 
		if(l == -inf) l = mr.ff;
		if(r == -inf) r = mr.ss;
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 12 ms 332 KB Output is correct
5 Correct 12 ms 376 KB Output is correct
6 Correct 13 ms 324 KB Output is correct
7 Correct 16 ms 460 KB Output is correct
8 Correct 23 ms 332 KB Output is correct
9 Correct 14 ms 396 KB Output is correct
10 Correct 11 ms 392 KB Output is correct
11 Correct 5 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 12 ms 404 KB Output is correct
16 Correct 12 ms 332 KB Output is correct
17 Correct 12 ms 412 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 3 ms 368 KB Output is correct

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 12 ms 332 KB Output is correct
5 Correct 12 ms 376 KB Output is correct
6 Correct 13 ms 324 KB Output is correct
7 Correct 16 ms 460 KB Output is correct
8 Correct 23 ms 332 KB Output is correct
9 Correct 14 ms 396 KB Output is correct
10 Correct 11 ms 392 KB Output is correct
11 Correct 5 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 12 ms 404 KB Output is correct
16 Correct 12 ms 332 KB Output is correct
17 Correct 12 ms 412 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 3 ms 368 KB Output is correct
20 Correct 39 ms 3936 KB Output is correct
21 Correct 53 ms 3780 KB Output is correct
22 Correct 140 ms 3608 KB Output is correct
23 Correct 1144 ms 3476 KB Output is correct
24 Execution timed out 2573 ms 3676 KB Time limit exceeded
25 Halted 0 ms 0 KB -