oj.uz

답안 #548548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548548 2022-04-13T18:37:38 Z 2fat2code Meteors (POI11_met) C++17
74 / 100
 3892 ms 53452 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 = 400005;
 
int n, m, k, a[nmax], p[nmax], x[nmax], y[nmax], z[nmax], ans[nmax], curr, tree[4*nmax], lazy[4*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, int 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){
        int fuck = z[curr] * (-1LL);
        if(x[curr] <= y[curr]) add(1, m, x[curr], y[curr], fuck, 1);
        else{
            add(1, m, x[curr], m, fuck,  1);
            add(1, m, 1, y[curr], fuck, 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, 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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9812 KB Output is correct
2 Correct 13 ms 9876 KB Output is correct
3 Correct 12 ms 9868 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9812 KB Output is correct
2 Correct 8 ms 9812 KB Output is correct
3 Correct 8 ms 9940 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 326 ms 14800 KB Output is correct
2 Correct 409 ms 18116 KB Output is correct
3 Correct 368 ms 14852 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 339 ms 14540 KB Output is correct
2 Correct 366 ms 14536 KB Output is correct
3 Correct 401 ms 16716 KB Output is correct
4 Correct 129 ms 14408 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 237 ms 14456 KB Output is correct
2 Correct 321 ms 17164 KB Output is correct
3 Correct 117 ms 10976 KB Output is correct
4 Correct 349 ms 15052 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 359 ms 13928 KB Output is correct
2 Correct 358 ms 14540 KB Output is correct
3 Correct 323 ms 14092 KB Output is correct
4 Correct 360 ms 16136 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3892 ms 53452 KB Output is correct
2 Incorrect 2384 ms 38060 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3717 ms 49632 KB Output is correct
2 Incorrect 1686 ms 38060 KB Output isn't correct
3 Halted 0 ms 0 KB -