Submission #1013002

#	Time	Username	Problem	Language	Result	Execution time	Memory
1013002		octane	Meteors (POI11_met)	C++17	74 / 100	2649 ms	62776 KiB

met

#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
struct qu{
    int l, r;
    ll a;
    qu(){}
    qu(int l, int r, ll a): l(l), r(r), a(a){}
};
typedef pair<int, int> pi;
typedef pair<pi, vector<int>> pii;

int n, k, q, x;
ll goal[300005];
qu qus[300005];
ll tree[1200005];
vector<int> num[300005];
int res[300005];
vector<pii> vec[50];

void init(int node, int s, int e){
    tree[node] = 0;
    if(s==e) return;
    int m = (s+e)>>1;
    init(node<<1, s, m);
    init(node<<1|1, m+1, e);
}

void update(int node, int s, int e, int l, ll v){
    if(e<l||l<s) return;
    if(s==e){
        tree[node] += v;
        return;
    }
    int m = (s+e)>>1;
    update(node<<1, s, m, l, v);
    update(node<<1|1, m+1, e, l, v);
    tree[node] = tree[node<<1]+tree[node<<1|1];
}

ll query(int node, int s, int e, int l, int r){
    if(e<l||r<s) return 0;
    if(l<=s&&e<=r) return tree[node];
    int m = (s+e)>>1;
    return query(node<<1, s, m, l, r)+query(node<<1|1, m+1, e, l, r);
}

int main(){
    scanf("%d %d", &n, &k);
    for(int i=1;i<=k;i++){
        scanf("%d", &x);
        num[x].push_back(i);
    }
    for(int i=1;i<=n;i++) scanf("%lld", &goal[i]);
    scanf("%d", &q);
    vector<int> emp;
    for(int i=1;i<=n;i++) emp.push_back(i);
    vec[0].push_back(pii(pi(0, q-1), emp));
    for(int i=0;i<q;i++) scanf("%d %d %lld", &qus[i].l, &qus[i].r, &qus[i].a);
    int idx = 0;
    while(!vec[idx].empty()){
        for(int i=1;i<=4*k;i++) tree[i] = 0;
        int prv = 0;
        for(auto p: vec[idx]){
            int s = p.first.first;
            int e = p.first.second;
            int m = (s+e)>>1;
            vector<int> v = p.second;
            if(s==e){
                for(int i=prv;i<=s;i++){
                    if(qus[i].l<=qus[i].r){
                        update(1, 1, k+1, qus[i].l, qus[i].a);
                        update(1, 1, k+1, qus[i].r+1, -qus[i].a);
                    }
                    else{
                        update(1, 1, k+1, qus[i].l, qus[i].a);
                        update(1, 1, k+1, k+1, -qus[i].a);
                        update(1, 1, k+1, 1, qus[i].a);
                        update(1, 1, k+1, qus[i].r+1, -qus[i].a);
                    }
                }
                for(auto u: v){
                    ll sm = 0;
                    for(auto w: num[u]) sm += query(1, 1, k+1, 1, w);
                    if(sm>=goal[u]) res[u] = s;
                    else res[u] = -1;
                }
                prv = e+1;
                continue;
            }
            vector<int> vec1;
            vector<int> vec2;
            for(int i=prv;i<=m;i++){
                if(qus[i].l<=qus[i].r){
                    update(1, 1, k+1, qus[i].l, qus[i].a);
                    update(1, 1, k+1, qus[i].r+1, -qus[i].a);
                }
                else{
                    update(1, 1, k+1, qus[i].l, qus[i].a);
                    update(1, 1, k+1, k+1, -qus[i].a);
                    update(1, 1, k+1, 1, qus[i].a);
                    update(1, 1, k+1, qus[i].r+1, -qus[i].a);
                }
            }
            for(auto u: v){
                ll sm = 0;
                for(auto w: num[u]) sm += query(1, 1, k+1, 1, w);
                if(sm>=goal[u]) vec1.push_back(u);
                else vec2.push_back(u);
            }
            for(int i=m+1;i<=e;i++){
                if(qus[i].l<=qus[i].r){
                    update(1, 1, k+1, qus[i].l, qus[i].a);
                    update(1, 1, k+1, qus[i].r+1, -qus[i].a);
                }
                else{
                    update(1, 1, k+1, qus[i].l, qus[i].a);
                    update(1, 1, k+1, k+1, -qus[i].a);
                    update(1, 1, k+1, 1, qus[i].a);
                    update(1, 1, k+1, qus[i].r+1, -qus[i].a);
                }
            }
            prv = e+1;
            vec[idx+1].push_back(pii(pi(s, m), vec1));
            vec[idx+1].push_back(pii(pi(m+1, e), vec2));
        }
        idx++;
    }
    for(int i=1;i<=n;i++){
        if(res[i]==-1) printf("NIE\n");
        else printf("%d\n", res[i]+1);
    }
}

Compilation message (stderr)

met.cpp: In function 'int main()':
met.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
met.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
met.cpp:59:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     for(int i=1;i<=n;i++) scanf("%lld", &goal[i]);
      |                           ~~~~~^~~~~~~~~~~~~~~~~~
met.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
met.cpp:64:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     for(int i=0;i<q;i++) scanf("%d %d %lld", &qus[i].l, &qus[i].r, &qus[i].a);
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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: 0 / 13
• Subtask 8: 0 / 13