Submission #1015647

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015647		vjudge1	Meteors (POI11_met)	C++17	62 / 100	481 ms	65536 KiB

met

//
//  main1.cpp
//  problem1
//
//  Created by Essa Almousa on 2030 / 01/ 01 AD.
//

#include <bits/stdc++.h>

using namespace std;
#define endl '\n'
using ll = long long;
#define pb push_back
#define pF first
#define pS second
#define SP <<" "<<
const ll N = 3e5+10;

struct segment {
    vector<ll> tree;
    ll offset = 1;
    void it(ll n) {
        while (offset < n) offset *= 2;
        tree.resize(offset*2, 0);
    }
    void upd(ll v, ll l, ll r, ll ql, ll qr, ll x) {
        if (l >= qr || r <= ql) return;
        if (l >= ql && r <= qr) {tree[v] += x; return;}
        ll mi = (l+r)/2;
        upd(v*2, l, mi, ql, qr, x);
        upd(v*2+1, mi, r, ql, qr, x);
    }
    ll query(ll i) {
        i--;
        i += offset;
        ll ans = 0;
        while (i >= 1) {
            ans += tree[i];
            i /= 2;
        }
        return ans;
    }
    void upd(ll l, ll r, ll val) {return upd(1, 0, offset, l-1, r, val);}
};

struct query_ {
    ll l, r, x;
};
ll a[N], b[N], sol[N];
vector<ll> frq[N];
query_ q[N];

int main() {
    //ios::sync_with_stdio(0); cout.tie(0); cin.tie(0);
    ll n, m;
    cin>>n>>m;
    for (ll i=1; i<=m; i++) {
        cin>>a[i];
        frq[a[i]].pb(i);
    }
    
    for (ll i=1; i<=n; i++) cin>>b[i];
    
    ll q1;
    cin>>q1;
    
    struct binnode { ll i, m, l, r; };
    
    vector<binnode> bin[N];
    for (ll i=1; i<=n; i++) {
        ll mi = q1+1/2;
        bin[mi].pb({i, mi, 1, q1});
    }

    for (ll i=1; i<=q1; i++) {
        ll l, r, x;
        cin>>l>>r>>x;
        q[i] = {l, r, x};
        sol[i] = -1;
    }
    ll cnt = n;
    while (cnt > 0) {
        segment tree;
        tree.it(m);
        for (ll i=1; i<=q1; i++) {
            if (q[i].l > q[i].r) {
                tree.upd(q[i].l, m, q[i].x);
                tree.upd(1, q[i].r, q[i].x);
            }
            else tree.upd(q[i].l, q[i].r, q[i].x);
            
            for (ll j = bin[i].size()-1; j >= 0; j = bin[i].size()-1) {
                binnode& x = bin[i][j];
                ll ans = 0; // the num
                for (ll k=0; k < frq[x.i].size(); k++) ans += tree.query(frq[x.i][k]);
                if (ans >= b[x.i]) x.r = x.m;
                else {
                    if (x.l >= q1) {cnt--;bin[i].pop_back(); continue;};
                    x.l = x.m+1;
                }
                ll mid = (x.l+x.r)/2;
                if (x.l != x.r) {bin[mid].pb({x.i, mid, x.l, x.r}); cnt++;}
                else sol[x.i] = x.l;
                bin[i].pop_back();
                cnt--;
                j = bin[i].size() - 1;
            }
        }
    }
    for (ll i=1; i<=n; i++) {
        if (sol[i] == -1) cout << "NIE" << endl;
        else cout << sol[i] << endl;
    }
}

Compilation message (stderr)

met.cpp: In function 'int main()':
met.cpp:95:32: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |                 for (ll k=0; k < frq[x.i].size(); k++) ans += tree.query(frq[x.i][k]);
      |                              ~~^~~~~~~~~~~~~~~~~

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