oj.uz

Submission #548510

# Submission time Handle Problem Language Result Execution time Memory
548510 2022-04-13T16:47:50 Z 2fat2code Meteors (POI11_met) C++17
61 / 100
 3977 ms 39828 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define fr first
#define sc second
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int nmax = 300005;

int n, m, k, a[nmax], x[nmax], y[nmax], ans[nmax], curr;
long long tree[4*nmax], lazy[4*nmax], p[nmax], z[nmax];

vector<int>members[nmax];

void push(int l, int r, int nod){
    tree[nod] += lazy[nod];
    if(l != r){
        lazy[2*nod] += lazy[nod];
        lazy[2*nod + 1] += lazy[nod];
    }
    lazy[nod] = 0;
}

void add(int l, int r, int le, int ri, long long val, int nod){
    push(l, r, nod);
    if(r < le || l > ri) return;
    else if(l >= le && r <= ri){
        lazy[nod] += val;
        push(l, r, nod);
    }
    else{
        int mid = l + (r - l) / 2;
        add(l, mid, le, ri, val, 2*nod);
        add(mid + 1, r, le, ri, val, 2*nod + 1);
        tree[nod] = tree[2*nod] + tree[2*nod + 1];
    }
}

int query(int l, int r, int le, int ri, int nod){
    push(l, r, nod);
    if(r < le || l > ri) return 0;
    else if(l >= le && r <= ri){
        return tree[nod];
    }
    else{
        int mid = l + (r - l) / 2;
        return query(l, mid, le, ri, 2*nod) + query(mid + 1, r, le, ri, 2*nod + 1);
    }
}

void rec(int l, int r, vector<int>&pending){
    if(r < l) return;
    int mid = l + (r - l) / 2;
    while(curr < mid){
        curr++;
        if(x[curr] <= y[curr]) add(1, m, x[curr], y[curr], z[curr], 1);
        else{
            add(1, m, x[curr], m, z[curr], 1);
            add(1, m, 1, y[curr], z[curr], 1);
        }
    }
    while(curr > mid){
        if(x[curr] <= y[curr]) add(1, m, x[curr], y[curr], -z[curr], 1);
        else{
            add(1, m, x[curr], m, -z[curr], 1);
            add(1, m, 1, y[curr], -z[curr], 1);
        }
        --curr;
    }
    vector<int>good;
    vector<int>bad;
    for(auto it : pending){
        int curr = 0;
        for(auto it1 : members[it]){
            curr += query(1, m, it1, it1, 1);
        }
        if(curr >= p[it]){
            good.push_back(it);
            ans[it] = mid;
        }
        else{
            bad.push_back(it);
        }
    }
    pending.clear();
    if(l != r){
        rec(l, mid - 1, good);
        rec(mid + 1, r, bad);
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    //freopen("input.in", "r", stdin);
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        cin >> a[i];
        members[a[i]].push_back(i);
    }
    for(int i=1;i<=n;i++) cin >> p[i];
    cin >> k;
    for(int i=1;i<=k;i++){
        cin >> x[i] >> y[i] >> z[i];
    }
    vector<int>tz;
    for(int i=1;i<=n;i++) tz.push_back(i);
    rec(1, k, tz);
    for(int i=1;i<=n;i++){
        if(!ans[i]){
            cout << "NIE" << '\n';
        }
        else{
            cout << ans[i] << '\n';
        }
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7496 KB Output is correct
2 Correct 7 ms 7508 KB Output is correct
3 Correct 7 ms 7504 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7508 KB Output is correct
2 Correct 7 ms 7508 KB Output is correct
3 Correct 9 ms 7540 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 11112 KB Output is correct
2 Correct 432 ms 13088 KB Output is correct
3 Correct 430 ms 11328 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 359 ms 11212 KB Output is correct
2 Correct 362 ms 11200 KB Output is correct
3 Correct 425 ms 12448 KB Output is correct
4 Correct 136 ms 11080 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 11064 KB Output is correct
2 Correct 339 ms 12784 KB Output is correct
3 Correct 118 ms 8252 KB Output is correct
4 Correct 375 ms 11604 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 356 ms 10740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3977 ms 39828 KB Output is correct
2 Incorrect 2419 ms 31080 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3819 ms 38052 KB Output is correct
2 Incorrect 1752 ms 30992 KB Output isn't correct
3 Halted 0 ms 0 KB -