제출 #1186109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186109		Faisal_Saqib	Meteors (POI11_met)	C++17	100 / 100	695 ms	57100 KiB

met

/*
    VENI VIDI VICI
*/

// #pragma GCC optimize("Ofast","unroll-all-loops","fast-math","no-stack-protector","give-no-fuck")
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <set>
// #include <map>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#define rep(i,x, n) for (int i = (x); i < (n); ++i)
#define repr(i,x, n) for (int i = (n) - 1; i >= (x); --i)
// #define sum accumulate

//using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;


using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;

template<class T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto &i:v) is>>i;
    return is;
}
template<class T1,class T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
    is>>p.fi>>p.se;
    return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for(const auto &i:v) os<<i<<' ';
    return os;
}
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
    os<<p.fi<<' '<<p.se; return os;
}
void pyn(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
    cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
    cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}
bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
const int N=3e5+1;
int want[N],L[N],R[N],ql[N],qr[N],qv[N];
vi ind[N],query[N];
ll fen[N],sm1=0;
void add(int x,int v)
{
	while(x<N)
	{
		fen[x]+=v;
		x+=(x&-x);
	}
}
ll get(int x)
{
	sm1=0;
	while(x>0)
	{
		sm1+=fen[x];
		x-=(x&-x);
	}
	return sm1;
}
void solve()
{
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		cin>>sm1;
		ind[sm1].pb(i);
	}
	for(int i=1;i<=n;i++)
	{
		cin>>want[i];
	}
	ll k;
	cin>>k;
	for(int i=1;i<=k;i++)
	{
		cin>>ql[i]>>qr[i]>>qv[i];
	}
	rep(i,1,n+1)
	{
		L[i]=0;
		R[i]=k+1;
		query[(L[i]+R[i])/2].pb(i);
	}
	int solved=0;
	while(solved<n)
	{
		for(int i=1;i<N;i++)
		{
			fen[i]=0;
		}
		for(int i=1;i<=k;i++)
		{
			add(ql[i],qv[i]);
			add(qr[i]+1,-qv[i]);
			if(ql[i]>qr[i])
			{
				add(1,qv[i]);
			}
			for(int&id:query[i])
			{
				ll sm=0;
				for(int&j:ind[id])
				{
					sm+=get(j);
					if(sm>=want[id])break;
				}
				if(sm>=want[id])
				{
					R[id]=i;
				}
				else
				{
					L[id]=i;
				}
				if(L[id]+1<R[id])
				{
					query[(L[id]+R[id])/2].pb(id);
				}
				else
				{
					solved++;
				}
			}
			query[i].clear();
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(R[i]==k+1)
		{
			cout<<"NIE"<<'\n';
		}		
		else
		{
			cout<<R[i]<<'\n';
		}
	}
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int uwu=1;

    // cin>>uwu;

    while(uwu--) {
        solve();
    }
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 13 / 13
• Subtask 6: 13 / 13
• Subtask 7: 13 / 13
• Subtask 8: 13 / 13