oj.uz

답안 #866602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866602 2023-10-26T13:31:01 Z asdfghjk Meteors (POI11_met) C++14
74 / 100
 668 ms 65536 KB 
/// 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();
    }
}

Compilation message

met.cpp:122:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  122 | main (){
      | ^~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 41308 KB Output is correct
2 Correct 15 ms 41532 KB Output is correct
3 Correct 15 ms 41564 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 41564 KB Output is correct
2 Correct 14 ms 41564 KB Output is correct
3 Correct 15 ms 41548 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 491 ms 44116 KB Output is correct
2 Correct 615 ms 45088 KB Output is correct
3 Correct 589 ms 44540 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 537 ms 44332 KB Output is correct
2 Correct 545 ms 44332 KB Output is correct
3 Correct 668 ms 47232 KB Output is correct
4 Correct 144 ms 44644 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 233 ms 44116 KB Output is correct
2 Correct 432 ms 47440 KB Output is correct
3 Correct 245 ms 41532 KB Output is correct
4 Correct 589 ms 44880 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 539 ms 43868 KB Output is correct
2 Correct 518 ms 44644 KB Output is correct
3 Correct 504 ms 43952 KB Output is correct
4 Correct 604 ms 47232 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 138 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 124 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -