Submission #660925

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
660925	2022-11-23T14:36:41 Z	rukashii	Meteors (POI11_met)	C++17	74 / 100	776 ms	32848 KB

#include <bits/stdc++.h>
using namespace std;
 
//#define int long long
 
const int maxn = 3e5 + 2;
 
int n, m, a[maxn], q, tree[maxn];
vector <tuple<int, int, int>> query;
vector <int> st[maxn], check[maxn];
pair <int, int> b[maxn];
 
void update(int pos, int val)
{
	for (int i = pos; i <= m; i += (i & (-i)))
	{
		tree[i] += val;
	}
}
 
int get(int pos)
{
	int ret = 0;
	for (int i = pos; i >= 1; i -= (i & (-i)))
	{
		ret += tree[i];
	}
	
	return ret;
}
 
void query_apply(int i)
{
	auto [u, v, f] = query[i - 1];
	
	if (u <= v)
	{
		update(u, f);
		update(v + 1, -f);
	}
	else
	{
		update(1, f);
		update(v + 1, -f);
		update(u, f);
	}
}
 
signed main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	//freopen("input.inp", "r", stdin);
	//freopen("output.out", "w", stdout);
	
	cin >> n >> m;
	
	for (int i = 1, t; i <= m; i++)
	{
		cin >> t;
		
		st[t].push_back(i);
	}
	
	for (int i = 1; i <= n; i++)
		cin >> a[i];
		
	cin >> q;
	
	for (int i = 1; i <= q; i++)
	{
		int l, r, w;
		cin >> l >> r >> w;
		
		query.push_back({l, r, w});
	}
	
	for (int i = 1; i <= n; i++)
	{
	    b[i] = {1, q + 1};
	}
	
	int cnt = n;
	while (1)
	{
		bool kt = 0;
		memset(tree, 0, sizeof(tree));
		for (int i = 1; i <= q; i++)
			check[i].clear();
		
		for (int i = 1; i <= n; i++)
		{
			auto [l, r] = b[i];
			if (l < r)
			{
				int mid = (l + r) / 2;
				check[mid].push_back(i);
				kt = 1;
			}
		}
		
		if (!kt)
			break;
		
		for (int i = 1; i <= q; i++)
		{
			query_apply(i);
			
			for (int p : check[i])
			{
				int &l = b[p].first, &r = b[p].second;
				int mid = (l + r) / 2;
				
				long long sum = 0;
				for (int child : st[p])
				{
					sum += get(child);
					if (sum >= a[p])
						break;
				}
				
				
				if (sum < a[p])
				{
					l = mid + 1;
				}
				else
				{
					r = mid;
				}
			}
		}
	}
	
	for (int i = 1; i <= n; i++)
        if (b[i].second <= q)
        	cout << b[i].second << '\n';
        else
        	cout << "NIE\n";
}

Compilation message

met.cpp: In function 'int main()':
met.cpp:82:6: warning: unused variable 'cnt' [-Wunused-variable]
   82 |  int cnt = n;
      |      ^~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	15572 KB	Output is correct
2	Correct	9 ms	15572 KB	Output is correct
3	Correct	10 ms	15596 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	15572 KB	Output is correct
2	Correct	9 ms	15556 KB	Output is correct
3	Correct	9 ms	15708 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	59 ms	16976 KB	Output is correct
2	Correct	101 ms	18880 KB	Output is correct
3	Correct	93 ms	18720 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	85 ms	18024 KB	Output is correct
2	Correct	93 ms	18088 KB	Output is correct
3	Correct	91 ms	19016 KB	Output is correct
4	Correct	31 ms	17352 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	75 ms	17460 KB	Output is correct
2	Correct	77 ms	19440 KB	Output is correct
3	Correct	47 ms	16332 KB	Output is correct
4	Correct	90 ms	18980 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	72 ms	16636 KB	Output is correct
2	Correct	81 ms	18044 KB	Output is correct
3	Correct	75 ms	16816 KB	Output is correct
4	Correct	102 ms	20284 KB	Output is correct

Subtask #7
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	776 ms	32848 KB	Output is correct
2	Incorrect	422 ms	22060 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #8
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	759 ms	31532 KB	Output is correct
2	Incorrect	447 ms	22136 KB	Output isn't correct
3	Halted	0 ms	0 KB	-