oj.uz

Submission #869614

# Submission time Handle Problem Language Result Execution time Memory
869614 2023-11-05T04:02:42 Z abhidot Meteors (POI11_met) C++17
74 / 100
 6000 ms 39952 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ll long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
#define mod2 998244353
#define lld long double
#define pii pair<int, int>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define rep(i,x,y) for(int i=x; i<y; i++)
#define fill(a,b) memset(a, b, sizeof(a))
#define vi vector<int>
#define V vector
#define setbits(x) __builtin_popcountll(x)
#define w(x)  int x; cin>>x; while(x--)
using namespace std;
using namespace __gnu_pbds; 
template <typename num_t> using ordered_set = tree<num_t, null_type, less<num_t>, rb_tree_tag, tree_order_statistics_node_update>;
const long long N=200005, INF=2000000000000000000, inf = 2e9+5;
 
int power(int a, int b, int p){
	if(a==0)
	return 0;
	int res=1;
	a%=p;
	while(b>0)
	{
		if(b&1)
		res=(res*a)%p;
		b>>=1;
		a=(a*a)%p;
	}
	return res;
}
 
 
void print(bool n){
    if(n){
        cout<<"YES\n";
    }else{
        cout<<"NO\n";
    }
}

int n, m, q, till=0;
vector<int> owners, reqd, ans, pr; 
vector<vector<int>> queries;

void apply(int l, int r, int a){
	if(l<=r){
		pr[l]+=a;
		pr[r+1]-=a;
	}else{
		pr[l]+=a;
		pr[m]-=a;
		pr[0]+=a;
		pr[r+1]-=a;
	}
}

void remove(int l, int r, int a){
	if(l<=r){
		pr[l]-=a;
		pr[r+1]+=a;
	}else{
		pr[l]-=a;
		pr[m]+=a;
		pr[0]-=a;
		pr[r+1]+=a;
	}
}

void update(int idx){
	while(till<idx){
		till++;
		// cout<<q<<" "<<till<<": ";
		// for(int i: queries[till]) cout<<i<<" "; cout<<"\n";
		apply(queries[till][0], queries[till][1], queries[till][2]);
	}
	while(till>idx){
		remove(queries[till][0], queries[till][1], queries[till][2]);
		till--;
	}
}

void rec(int l, int r, vector<int>& states){
	if(l==r){
		for(int i:states) ans[i]=l;
		states.clear();
		return;
	}
	int mid = (l+r)/2;
	update(mid);
	vector<int> have(n);
	int sm=0;
	// cout<<mid<<": \n";
	for(int i=0;i<m;i++){
		sm+=pr[i];
		// cout<<sm<<" ";
		have[owners[i]]+=sm;
	}
	// cout<<"\n";
	vector<int> L, R;
	for(int i:states){
		// cout<<i<<" "<<have[i]<<"\n";
		if(have[i]>=reqd[i]) L.pb(i);
		else R.pb(i);
	}
	states.clear();
	rec(l, mid, L);
	rec(mid+1, r, R);
}
 
int32_t main()
{
    IOS;
		cin>>n>>m;
		owners.resize(m);
		reqd.resize(n);
		ans.resize(n, -1);
		pr.resize(m+1);
		for(int i=0;i<m;i++){
			cin>>owners[i];
			owners[i]--;
		}
		for(int i=0;i<n;i++){
			cin>>reqd[i];
		}
		
		cin>>q;
		queries.resize(q+2);
		queries[0]={0,0,0};
		queries[q+1]={0,0,0};
		for(int i=1;i<=q;i++){
			int l, r, a;
			cin>>l>>r>>a;
			--l, --r;
			queries[i]={l, r, a};
		}
		
		vector<int> states;
		for(int i=0;i<n;i++) states.pb(i);
		rec(0, q+1, states);
		
		for(int i=0;i<n;i++){
			if(ans[i]==q+1){
				cout<<"NIE\n";
			}else cout<<ans[i]<<"\n";
		}
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5317 ms 5744 KB Output is correct
2 Correct 3816 ms 12492 KB Output is correct
3 Correct 3497 ms 7468 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2694 ms 5856 KB Output is correct
2 Correct 2629 ms 6936 KB Output is correct
3 Correct 4348 ms 10836 KB Output is correct
4 Correct 312 ms 4712 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2322 ms 5128 KB Output is correct
2 Correct 3817 ms 11368 KB Output is correct
3 Correct 31 ms 3672 KB Output is correct
4 Correct 3183 ms 8572 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2734 ms 4068 KB Output is correct
2 Correct 3486 ms 7256 KB Output is correct
3 Correct 3230 ms 5544 KB Output is correct
4 Correct 3823 ms 10580 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6012 ms 39952 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6092 ms 37356 KB Time limit exceeded
2 Halted 0 ms 0 KB -