oj.uz

답안 #1116316

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116316 2024-11-21T13:37:40 Z thelegendary08 Measures (CEOI22_measures) C++17
100 / 100
 517 ms 36936 KB 
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) cout<<#v<<' '; for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 2e5 + 5;

vi tree(mxn * 4, -4e18);
vi lazy(mxn * 4, 0);
void push(int x){
	lazy[x*2] += lazy[x];
	tree[x*2] += lazy[x];
	lazy[x*2+1] += lazy[x];
	tree[x*2+1] += lazy[x];
	lazy[x] = 0;
}

void update(int node, int tl, int tr, int l, int r, int x){
	if(l > r)return;
	if(l == tl && r == tr){
		tree[node] += x;
		lazy[node] += x;
	}
	else{
		push(node);
		int mid = (tl + tr)/2;
		update(node * 2, tl, mid, l, min(mid,r), x);
		update(node * 2 + 1, mid+1, tr, max(mid+1, l), r, x);
		tree[node] = max(tree[node*2], tree[node*2+1]);
	}
}

int query(int node, int tl, int tr, int l, int r){
	if(l > r)return -4e18;
	if(l == tl && r == tr){
		return tree[node];
	}
	push(node);
	int mid = (tl + tr)/2;
	return max(query(node*2, tl, mid, l, min(r, mid)), query(node*2+1, mid+1, tr, max(l, mid+1), r));
}

vi tree2(mxn * 4, 4e18);
vi lazy2(mxn * 4, 0);

void push2(int x){
	lazy2[x*2] += lazy2[x];
	tree2[x*2] += lazy2[x];
	lazy2[x*2+1] += lazy2[x];
	tree2[x*2+1] += lazy2[x];
	lazy2[x] = 0;
}

void update2(int node, int tl, int tr, int l, int r, int x){
	if(l > r)return;
	if(l == tl && r == tr){
		tree2[node] += x;
		lazy2[node] += x;
	}
	else{
		push2(node);
		int mid = (tl + tr)/2;
		update2(node * 2, tl, mid, l, min(mid,r), x);
		update2(node * 2 + 1, mid+1, tr, max(mid+1, l), r, x);
		tree2[node] = min(tree2[node*2], tree2[node*2+1]);
	}
}

int query2(int node, int tl, int tr, int l, int r){
	if(l > r)return 4e18;
	if(l == tl && r == tr){
		return tree2[node];
	}
	push2(node);
	int mid = (tl + tr)/2;
	return min(query2(node*2, tl, mid, l, min(r, mid)), query2(node*2+1, mid+1, tr, max(l, mid+1), r));
}

//1 is max, 2 is min
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,m,d);
	if(n > 0){
		vin(v,n);
		f0r(i,n)v[i] *= 2;
		d *= 2;
		while(m--){
			in(x);
			v.pb(x*2);
			sort(all(v));
			int lo = 0;
			int hi = 3e14;
			while(lo < hi){
				int m = lo + (hi - lo)/2;
				//double m = mid/2.0;
				int cur = v[0] - m;
				
				bool ok = 1;
				FOR(i, 1, v.size()){
					if(v[i] - m > d + cur){
						cur = v[i] - m;
						//w.pb(v[i] - m);
					}
					else if(v[i] + m < d + cur){
						ok = 0;
						break;
					}
					else{
						cur = d + cur;
					}
				}
				//dout(mid);
				if(ok){
					hi = m;
				}
				else{
					lo = m + 1;
				}
				//if(mid == 6)vout(w);
			}
			if(lo%2==0)cout<<lo/2<<' ';
			else cout<<lo/2<<".5 ";
		}
	}
	else{
		//int ans = 0;
		int mx = 0;
		//int mn = 4e18;
		int ans = 0;
		vi v(m);
		f0r(i,m)cin>>v[i];
		vpii w(m);
		f0r(i,m)w[i] = {v[i], i};
		sort(all(w));
		vi dex(m);
		f0r(i,m)dex[w[i].second] = i+1;
		//vout(dex);
		FOR(i, 1, m+1){
			//cout<<query(1, 1, m, i, i)<<' ';
		}
		//cout<<'\n';
		f0r(i,m){
			int cur = dex[i];
			update(1, 1, m, cur+1, m, -d);
			update2(1, 1, m, cur+1, m, -d);
			update(1, 1, m, cur, cur, 4e18);
			update(1, 1, m, cur, cur, v[i]);
			update2(1, 1, m, cur, cur, -4e18);
			update2(1, 1, m, cur, cur, v[i]);
			FOR(i, 1, m+1){
				//cout<<query(1, 1, m, i, i)<<' ';
			}
			//cout<<'\n';
			
			ans = max(ans, query(1, 1, m, 1, cur) - query2(1, 1, m, cur, m));
			
			if(ans % 2 == 0)cout<<ans/2<<' ';
			else cout<<ans/2<<".5 ";
			
		}
		
	}
	
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:12:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR(i,k,n) for(int i=k;i<n;i++)
......
  127 |     FOR(i, 1, v.size()){
      |         ~~~~~~~~~~~~~~           
Main.cpp:127:5: note: in expansion of macro 'FOR'
  127 |     FOR(i, 1, v.size()){
      |     ^~~
Main.cpp:155:7: warning: unused variable 'mx' [-Wunused-variable]
  155 |   int mx = 0;
      |       ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 25424 KB Output is correct
2 Correct 8 ms 25424 KB Output is correct
3 Correct 6 ms 25424 KB Output is correct
4 Correct 7 ms 25596 KB Output is correct
5 Correct 6 ms 25424 KB Output is correct
6 Correct 6 ms 25424 KB Output is correct
7 Correct 7 ms 25424 KB Output is correct
8 Correct 6 ms 25424 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 25424 KB Output is correct
2 Correct 8 ms 25424 KB Output is correct
3 Correct 6 ms 25424 KB Output is correct
4 Correct 7 ms 25596 KB Output is correct
5 Correct 6 ms 25424 KB Output is correct
6 Correct 6 ms 25424 KB Output is correct
7 Correct 7 ms 25424 KB Output is correct
8 Correct 6 ms 25424 KB Output is correct
9 Correct 168 ms 29008 KB Output is correct
10 Correct 204 ms 31056 KB Output is correct
11 Correct 107 ms 31056 KB Output is correct
12 Correct 213 ms 30188 KB Output is correct
13 Correct 109 ms 30556 KB Output is correct
14 Correct 284 ms 30792 KB Output is correct
15 Correct 170 ms 30288 KB Output is correct
16 Correct 113 ms 31056 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 34504 KB Output is correct
2 Correct 340 ms 36424 KB Output is correct
3 Correct 319 ms 36420 KB Output is correct
4 Correct 313 ms 34120 KB Output is correct
5 Correct 287 ms 35572 KB Output is correct
6 Correct 296 ms 34636 KB Output is correct
7 Correct 302 ms 35656 KB Output is correct
8 Correct 301 ms 34376 KB Output is correct
9 Correct 290 ms 34392 KB Output is correct
10 Correct 310 ms 36680 KB Output is correct
11 Correct 319 ms 35188 KB Output is correct
12 Correct 264 ms 34120 KB Output is correct
13 Correct 320 ms 34120 KB Output is correct
14 Correct 319 ms 36288 KB Output is correct
15 Correct 345 ms 36060 KB Output is correct
16 Correct 300 ms 33864 KB Output is correct
17 Correct 294 ms 35904 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 34504 KB Output is correct
2 Correct 340 ms 36424 KB Output is correct
3 Correct 319 ms 36420 KB Output is correct
4 Correct 313 ms 34120 KB Output is correct
5 Correct 287 ms 35572 KB Output is correct
6 Correct 296 ms 34636 KB Output is correct
7 Correct 302 ms 35656 KB Output is correct
8 Correct 301 ms 34376 KB Output is correct
9 Correct 290 ms 34392 KB Output is correct
10 Correct 310 ms 36680 KB Output is correct
11 Correct 319 ms 35188 KB Output is correct
12 Correct 264 ms 34120 KB Output is correct
13 Correct 320 ms 34120 KB Output is correct
14 Correct 319 ms 36288 KB Output is correct
15 Correct 345 ms 36060 KB Output is correct
16 Correct 300 ms 33864 KB Output is correct
17 Correct 294 ms 35904 KB Output is correct
18 Correct 424 ms 34544 KB Output is correct
19 Correct 461 ms 36364 KB Output is correct
20 Correct 330 ms 36424 KB Output is correct
21 Correct 337 ms 34632 KB Output is correct
22 Correct 389 ms 34888 KB Output is correct
23 Correct 329 ms 34632 KB Output is correct
24 Correct 451 ms 35320 KB Output is correct
25 Correct 310 ms 34452 KB Output is correct
26 Correct 432 ms 34376 KB Output is correct
27 Correct 424 ms 36936 KB Output is correct
28 Correct 391 ms 34892 KB Output is correct
29 Correct 413 ms 36048 KB Output is correct
30 Correct 355 ms 34376 KB Output is correct
31 Correct 351 ms 36424 KB Output is correct
32 Correct 348 ms 36220 KB Output is correct
33 Correct 517 ms 33864 KB Output is correct
34 Correct 356 ms 35656 KB Output is correct