| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 866605 | asdfghjk | Meteors (POI11_met) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/// tree bends in youth
/// 24 .10.2023
/// success is doing same thing in every single day!!!
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
const ll N =3e5+ 5;
const ll NN =2e6 + 5;
const ll INF = -1e1;
const ll MOD = 1e9 + 7;
const ll LG = 18;
ll z[N],x[N];
ll t[4 * N],p[4 * N],c[N],b[N];
pair<ll,ll> seq[N];
set <ll> MID[N],rg[N];
ll ok[N];
void build(ll v,ll l,ll r){
p[v] = 0;
if(l == r){
t[v] = 0;
return;
}
ll mid = (l + r) / 2;
build(v+v,l,mid);
build(v+v+1,mid+1,r);
}
void push(ll v,ll l,ll r){
if(p[v]){
if(l != r){
p[v+v] += p[v];
p[v+v+1] += p[v];
}
else{
t[v] +=p[v];
}
p[v] = 0;
}
}
void upd(ll v,ll l,ll r,ll ql,ll qr,ll x){
push(v,l,r);
if(l >= ql && qr >= r){
p[v] += x;
push(v,l,r);
return;
}
if(qr < l || r < ql)return;
ll mid = (l + r) / 2;
upd(v+v,l,mid,ql,qr,x);
upd(v+v+1,mid+1,r,ql,qr,x);
}
ll get(ll v,ll l,ll r,ll x){
push(v,l,r);
if(l == r)return t[v];
ll mid = (l + r) / 2;
if(x <= mid)return get(v+v,l,mid,x);
else return get(v+v+1,mid + 1,r,x);
}
void solve(){
ll n,m;
cin >> n >> m;
for(ll i = 1;i <= m;i++){
ll u;cin >> u;
rg[u].insert(i);
}
for(ll i= 1;i <= n;i++){
cin >> b[i];
}
ll q;
cin >> q;
for(ll i = 1;i <=q;i++){
cin >> z[i] >> x[i] >> c[i];
}
for(ll i = 1;i <= n;i++){
seq[i] = {1,q};
}
ll tt = 19;
while(tt--){
for(ll i = 1;i <= n;i++){
ll md = (seq[i].F + seq[i].S) / 2;
MID[md].insert(i);
}
build(1,1,m);
for(ll i = 1;i <= q;i++){
if(z[i] > x[i]){
upd(1,1,m,1,x[i],c[i]);
upd(1,1,m,z[i],m,c[i]);
}
else{
upd(1,1,m,z[i],x[i],c[i]);
}
for(ll to : MID[i]){
ll sum= 0;
for(ll d : rg[to]){
sum += get(1,1,m,d);
}
if(sum >= b[to]){
ok[to] = 1;
seq[to].S= i;
}
else {
seq[to].F = i + 1;
}
}
}
for(ll i = 1;i <= q;i++){
MID[i].clear();
}
}
for(ll i = 1;i<=n;i++){
if(seq[i].F <= q){
cout << seq[i].F << '\n';
}
else{
cout << "NIE\n";
}
}
}
main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll abd= 1;
// cin >> abd;
for(ll i = 1;i <= abd;i++){
// cout << "Case " << i << ":\n";
solve();
}
}
/// tree bends in youth
/// 24 .10.2023
/// success is doing same thing in every single day!!!
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
const ll N =3e5+ 5;
const ll NN =2e6 + 5;
const ll INF = -1e1;
const ll MOD = 1e9 + 7;
const ll LG = 18;
ll z[N],x[N];
ll t[4 * N],p[4 * N],c[N],b[N];
pair<ll,ll> seq[N];
set <ll> MID[N],rg[N];
ll ok[N];
void build(ll v,ll l,ll r){
p[v] = 0;
if(l == r){
t[v] = 0;
return;
}
ll mid = (l + r) / 2;
build(v+v,l,mid);
build(v+v+1,mid+1,r);
}
void push(ll v,ll l,ll r){
if(p[v]){
if(l != r){
p[v+v] += p[v];
p[v+v+1] += p[v];
}
else{
t[v] +=p[v];
}
p[v] = 0;
}
}
void upd(ll v,ll l,ll r,ll ql,ll qr,ll x){
push(v,l,r);
if(l >= ql && qr >= r){
p[v] += x;
push(v,l,r);
return;
}
if(qr < l || r < ql)return;
ll mid = (l + r) / 2;
upd(v+v,l,mid,ql,qr,x);
upd(v+v+1,mid+1,r,ql,qr,x);
}
ll get(ll v,ll l,ll r,ll x){
push(v,l,r);
if(l == r)return t[v];
ll mid = (l + r) / 2;
if(x <= mid)return get(v+v,l,mid,x);
else return get(v+v+1,mid + 1,r,x);
}
void solve(){
ll n,m;
cin >> n >> m;
for(ll i = 1;i <= m;i++){
ll u;cin >> u;
rg[u].insert(i);
}
for(ll i= 1;i <= n;i++){
cin >> b[i];
}
ll q;
cin >> q;
for(ll i = 1;i <=q;i++){
cin >> z[i] >> x[i] >> c[i];
}
for(ll i = 1;i <= n;i++){
seq[i] = {1,q};
}
ll tt = 19;
while(tt--){
for(ll i = 1;i <= n;i++){
ll md = (seq[i].F + seq[i].S) / 2;
MID[md].insert(i);
}
build(1,1,m);
for(ll i = 1;i <= q;i++){
if(z[i] > x[i]){
upd(1,1,m,1,x[i],c[i]);
upd(1,1,m,z[i],m,c[i]);
}
else{
upd(1,1,m,z[i],x[i],c[i]);
}
for(ll to : MID[i]){
ll sum= 0;
for(ll d : rg[to]){
sum += get(1,1,m,d);
}
if(sum >= b[to]){
ok[to] = 1;
seq[to].S= i;
}
else {
seq[to].F = i + 1;
}
}
}
for(ll i = 1;i <= q;i++){
MID[i].clear();
}
}
for(ll i = 1;i<=n;i++){
if(seq[i].F <= q){
cout << seq[i].F << '\n';
}
else{
cout << "NIE\n";
}
}
}
main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll abd= 1;
// cin >> abd;
for(ll i = 1;i <= abd;i++){
// cout << "Case " << i << ":\n";
solve();
}
}