Submission #347749

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
347749	2021-01-13T10:59:28 Z	jklepec	Meteors (POI11_met)	C++11	100 / 100	1387 ms	30852 KB

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int llint;
int o[300005],arr[300005],sol[300005];
llint fwt[300005],n,m,k;
vector <pair<pair<int,int>,llint> > v;
vector <int> ind[300005],v1;
void update(int x,llint v) {
	for(x;x<300005;x+=x&-x) fwt[x]+=v;
}
llint query(int x) {
	llint ret=0;
	for(x;x>0;x-=x&-x) ret+=fwt[x];
	return ret;
}
void f(int l,int r,llint v) {
	if(l<=r) {
		update(l,v);
		update(r+1,-v);
	}
	else {
		update(l,v);
		update(m+1,-v);
		update(1,v);
		update(r+1,-v);
	}
	//cout << query(1) << " " << query(2) << " " << query(3) << " " << query(4) << " " << query(5) << "\n";
}
llint eval(int x) {
	llint ret=0;
	for(int i=0;i<ind[x].size();i++) {
		ret+=query(ind[x][i]+1);
		if(ret>=arr[x]) break;
	}
	return ret;
}
void rek(int lo,int hi) {
	//cout << lo1 << " " << hi1 << "\n";
	//system("pause");
	if(lo>hi) {
		for(int i=0;i<v1.size();i++) {
			sol[v1[i]]=-1;
		}
		return;
	}
	if(lo==hi) {
		
		for(int i=0;i<v1.size();i++) {
			sol[v1[i]]=lo;
		}
		return;
	}
	int mid=(lo+hi)/2;
	for(int i=lo;i<=mid;i++) {
		f(v[i].first.first,v[i].first.second,v[i].second);
	}
	vector <int> l,r;
	for(int i=0;i<v1.size();i++) {
		if(eval(v1[i])>=arr[v1[i]]) l.push_back(v1[i]);
		else r.push_back(v1[i]);
	}
	//cout << l.size() << " " << r.size() << "\n";
	//cout << lo1 << " " << mid << " " << mid+1 << " " << hi1 << "\n";
	//system("pause");
	v1=r;
	rek(mid+1,hi);
	for(int i=lo;i<=mid;i++) {
		f(v[i].first.first,v[i].first.second,-v[i].second);
	}
	v1=l;
	rek(lo,mid);
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for(int i=0;i<m;i++) {
		cin >> o[i];
		ind[o[i]-1].push_back(i);
	}
	for(int i=0;i<n;i++) {
		cin >> arr[i];
		v1.push_back(i);
	}
	cin >> k;
	for(int i=0;i<k;i++) {
		llint l,r,a;
		cin >> l >> r >> a;
		v.push_back(make_pair(make_pair(l,r),a));
	}
	//cout << "abc\n";
	//system("pause");
	rek(0,k);
	for(int i=0;i<n;i++) {
		if(sol[i]==k) cout << "NIE\n";
		else cout << sol[i]+1 << "\n";
	}
	return 0;
}

Compilation message

met.cpp: In function 'void update(int, llint)':
met.cpp:11:6: warning: statement has no effect [-Wunused-value]
   11 |  for(x;x<300005;x+=x&-x) fwt[x]+=v;
      |      ^
met.cpp: In function 'llint query(int)':
met.cpp:15:6: warning: statement has no effect [-Wunused-value]
   15 |  for(x;x>0;x-=x&-x) ret+=fwt[x];
      |      ^
met.cpp: In function 'llint eval(int)':
met.cpp:33:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int i=0;i<ind[x].size();i++) {
      |              ~^~~~~~~~~~~~~~
met.cpp: In function 'void rek(int, int)':
met.cpp:43:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for(int i=0;i<v1.size();i++) {
      |               ~^~~~~~~~~~
met.cpp:50:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for(int i=0;i<v1.size();i++) {
      |               ~^~~~~~~~~~
met.cpp:60:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |  for(int i=0;i<v1.size();i++) {
      |              ~^~~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	7532 KB	Output is correct
2	Correct	7 ms	7532 KB	Output is correct
3	Correct	7 ms	7532 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	7532 KB	Output is correct
2	Correct	7 ms	7532 KB	Output is correct
3	Correct	7 ms	7532 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	78 ms	9696 KB	Output is correct
2	Correct	161 ms	11360 KB	Output is correct
3	Correct	112 ms	9696 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	134 ms	9560 KB	Output is correct
2	Correct	131 ms	9568 KB	Output is correct
3	Correct	158 ms	10852 KB	Output is correct
4	Correct	35 ms	9324 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	104 ms	9576 KB	Output is correct
2	Correct	166 ms	11032 KB	Output is correct
3	Correct	171 ms	8556 KB	Output is correct
4	Correct	112 ms	9952 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	137 ms	9184 KB	Output is correct
2	Correct	144 ms	9568 KB	Output is correct
3	Correct	97 ms	9312 KB	Output is correct
4	Correct	151 ms	10848 KB	Output is correct

Subtask #7
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1042 ms	26316 KB	Output is correct
2	Correct	652 ms	18156 KB	Output is correct
3	Correct	896 ms	11620 KB	Output is correct
4	Correct	1275 ms	27708 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	986 ms	24264 KB	Output is correct
2	Correct	623 ms	18284 KB	Output is correct
3	Correct	762 ms	11620 KB	Output is correct
4	Correct	1387 ms	30852 KB	Output is correct