oj.uz

Submission #461279

# Submission time Handle Problem Language Result Execution time Memory
461279 2021-08-09T16:29:46 Z vanic Nuclearia (CEOI15_nuclearia) C++14
40 / 100
 483 ms 317892 KB 
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cassert>

using namespace std;
typedef long long ll;

const int maxn=2500000;

ll range[maxn*2];
ll najl[maxn*2];
ll pref[maxn+1];

void precompute(){
	for(int i=maxn; i<maxn*2; i++){
		range[i]=1;
		najl[i]=i-maxn;
	}
	for(int i=maxn-1; i>0; i--){
		range[i]=range[i*2]*2;
		najl[i]=najl[i*2];
	}
}


struct tournament{
	ll t[maxn*2];
	pair < ll, ll > prop[maxn*2];
	void propagate(int &x){
		if(!prop[x].first && !prop[x].second){
			return;
		}
		t[x]+=prop[x].first*range[x]+prop[x].second*(range[x]*(range[x]-1)/2);
		if(x<maxn){
			prop[x*2].first+=prop[x].first;
			prop[x*2].second+=prop[x].second;
			prop[x*2+1].first+=prop[x].first+prop[x].second*(range[x]/2);
			prop[x*2+1].second+=prop[x].second;
		}
		prop[x].first=0;
		prop[x].second=0;
	}
	void update2(int l, int d, pair < ll, ll > val){
		ll L=l;
		d++;
		int x;
		ll val1;
		for(l+=maxn, d+=maxn; l<d; l>>=1, d>>=1){
			if(l&1){
				x=l++;
				val1=val.first+val.second*(najl[x]-L);
				prop[x].first+=val1;
				prop[x].second+=val.second;
			}
			if(d&1){
				x=--d;
				val1=val.first+val.second*(najl[x]-L);
				prop[x].first+=val1;
				prop[x].second+=val.second;
			}
		}
	}
	ll query(int l, int d){
		d++;
		ll sol=0;
		for(l+=maxn, d+=maxn; l<d; l>>=1, d>>=1){
			if(l&1){
				sol+=t[l++];
			}
			if(d&1){
				sol+=t[--d];
			}
		}
		return sol;
	}
	void resi(){
		for(int i=1; i<maxn*2; i++){
			propagate(i);
		}
	}
};

tournament T;


int main(){
	precompute();
	int h, w;
	scanf("%d%d", &w, &h);
	bool p=0;
	if(h>w){
		swap(h, w);
	}
	assert(h==1);
	int n, q;
	scanf("%d", &n);
	int a, b, c, d;
	int kol;
	int l, r;
	pair < ll, ll > val;
	for(int i=0; i<n; i++){
		scanf("%d%d%d%d", &a, &b, &c, &d);
		a--;
		b--;
		if(!p){
			swap(a, b);
		}
		kol=c/d;
		l=b-kol;
		r=b;
		if(l>-1){
			val={c%d, d};
		}
		else{
			val={c%d-l*d, d};
			l=0;
		}
//		cout << "upd " << val.first << ' ' << val.second << endl;
		T.update2(l, r, val);
		l=b+1;
		r=b+kol;
		r=min(r, w-1);
		val={c-d, -d};
		if(l<=r){
			T.update2(l, r, val);
		}
	}
	T.resi();
	for(int i=0; i<w; i++){
		pref[i+1]=pref[i]+T.t[i+maxn];
	}
/*	for(int i=0; i<w; i++){
		cout << T.query(i, i) << ' ';
	}
	cout << endl;*/
	scanf("%d", &q);
	ll sol, dij, res;
	for(int i=0; i<q; i++){
		scanf("%d%d%d%d", &a, &b, &c, &d);
		if(!p){
			swap(a, b);
			swap(c, d);
		}
		sol=pref[d]-pref[b-1];
		dij=d-b+1;
		res=sol/dij;
		if(sol%dij>=(dij+1)/2){
			res++;
		}
		printf("%lld\n", res);
//		printf("%lld\n", (ll)T.query(0, pot-1, 1, b, d));
	}
	return 0;
}

Compilation message

nuclearia.cpp: In function 'int main()':
nuclearia.cpp:91:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |  scanf("%d%d", &w, &h);
      |  ~~~~~^~~~~~~~~~~~~~~~
nuclearia.cpp:98:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
nuclearia.cpp:104:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |   scanf("%d%d%d%d", &a, &b, &c, &d);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
nuclearia.cpp:138:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  138 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
nuclearia.cpp:141:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  141 |   scanf("%d%d%d%d", &a, &b, &c, &d);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 215572 KB Output is correct
2 Correct 180 ms 159256 KB Output is correct
3 Correct 191 ms 158840 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 215472 KB Output is correct
2 Correct 169 ms 159240 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 230 ms 317776 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Runtime error 272 ms 317852 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 217700 KB Output is correct
2 Correct 175 ms 159520 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 182696 KB Output is correct
2 Correct 167 ms 159272 KB Output is correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 223 ms 317772 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #8
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 227 ms 317852 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 217884 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 217884 KB Output is correct

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 231 ms 317856 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 234 ms 317800 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #13
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 235 ms 317892 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 230 ms 317820 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -