oj.uz

Submission #867266

# Submission time Handle Problem Language Result Execution time Memory
867266 2023-10-28T04:39:29 Z asdfghjk Meteors (POI11_met) C++14
100 / 100
 4799 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;
int z[N],x[N];
ll t[4 * N],b[N],c[N];
pair<int,int> seq[N];
set <int> MID[N];
vector<int> rg[N];
void build(int v,int l,int r){
    t[v] = 0;
    if(l == r){
        t[v] = 0;
        return;
    }
    int mid = (l + r) / 2;
    build(v+v,l,mid);
    build(v+v+1,mid+1,r);
}
void upd(int v,int l,int r,int ql,int qr,ll x){
    if(ql <= l && r <= qr){
        t[v] += x;
        return;
    }
    if(ql > r || qr < l)return ;
    int mid =(l + r) / 2;
    upd(v+v,l,mid,ql,qr,x);
    upd(v+v+1,mid+1,r,ql,qr,x);
}
ll get(int v,int l,int r,int pos,ll sum){
    sum += t[v];
    if(l == r)return sum;
    int mid = (l + r) / 2;
    if(pos <= mid)return get(v+v,l,mid,pos,sum);
    else return get(v+v+1,mid +1,r,pos,sum);
}
void solve(){
    int n,m;
    cin >> n >> m;
    for(int i = 1;i <= m;i++){
        int u;cin >> u;
        rg[u].pb(i);
    }
    for(int i= 1;i <= n;i++){
        cin >> b[i];
    }
    int q;
    cin >> q;
    for(int i = 1;i <=q;i++){
        cin >> z[i] >> x[i] >> c[i];
    }
    for(int i = 1;i <= n;i++){
        seq[i] = {1,q};
    }
    int tt = 19;
    while(tt--){
        for(int i = 1;i <= n;i++){
            int md = (seq[i].F + seq[i].S) / 2;
            MID[md].insert(i);
        }
        build(1,1,m);
        for(int 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(int to : MID[i]){
                ll sum=  0;
                for(int d : rg[to]){
                    sum += get(1,1,m,d,0);
                    if(sum >= b[to])break;
                }
                if(sum >= b[to]){
                    seq[to].S = i;
                }
                else {
                    seq[to].F = i + 1;
                }
            }
        }
        for(int i = 1;i <= q;i++){
            MID[i].clear();
        }
    }
    for(int 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:108:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  108 | main (){
      | ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 31320 KB Output is correct
2 Correct 11 ms 31324 KB Output is correct
3 Correct 11 ms 31324 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 33968 KB Output is correct
2 Correct 446 ms 35236 KB Output is correct
3 Correct 364 ms 34640 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 34296 KB Output is correct
2 Correct 348 ms 34136 KB Output is correct
3 Correct 406 ms 35152 KB Output is correct
4 Correct 110 ms 34788 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 33880 KB Output is correct
2 Correct 273 ms 35396 KB Output is correct
3 Correct 147 ms 31432 KB Output is correct
4 Correct 366 ms 34852 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 33776 KB Output is correct
2 Correct 335 ms 34384 KB Output is correct
3 Correct 319 ms 33628 KB Output is correct
4 Correct 408 ms 35664 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3149 ms 49244 KB Output is correct
2 Correct 1105 ms 41820 KB Output is correct
3 Correct 713 ms 31992 KB Output is correct
4 Correct 4663 ms 65292 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3082 ms 48472 KB Output is correct
2 Correct 777 ms 41672 KB Output is correct
3 Correct 587 ms 31800 KB Output is correct
4 Correct 4799 ms 65536 KB Output is correct