oj.uz

Submission #788681

# Submission time Handle Problem Language Result Execution time Memory
788681 2023-07-20T13:24:09 Z Dawnlight Meteors (POI11_met) C++14
38 / 100
 467 ms 65536 KB 
#include <bits/stdc++.h>
#define ll long long
#define SZ(X) (int)(X.size())
#define MAX 300005
#define pii pair <int,ll>
#define ind first
#define val second
#define INF (ll)(1e18)
using namespace std;

struct Query{
    int le, ri, amo;
};

int typeNum, len, queNum;
int arr[MAX];
int ans[MAX];
vector <int> sta[MAX]; // stations of every type
vector <Query> allQ;
vector <pii> allT;
int a, b, c;

void solve(vector <Query> & que, vector <pii> & type, int pos){ // type: station types and how much is needed, pos = le
    //cout << SZ(que) << " " << SZ(type) << " " << pos << "\n";
    if (type.empty() || que.empty()) return;
    vector <pii> loc; // considered locations and dif
    vector <pii> tCopy; // copy of type
    for (pii t : type){
        for (int s : sta[t.ind])
            loc.push_back({s, 0});
        tCopy.push_back(t);
    }
    sort(loc.begin(), loc.end());
    if (loc.empty()) return;
    
    vector <Query> queA, queB; // separate que into first and second half
    for (int i = 0; i < SZ(que); i++){
        if (i < (SZ(que)+1)/2) queA.push_back(que[i]);
        else queB.push_back(que[i]);
    }
    for (Query q : queA){ // set up prefix difference
        int add = q.le, sub = q.ri;
        if (q.le > q.ri) { // ring-shaped array
            loc[0].val += q.amo;
        }
        auto it = lower_bound(loc.begin(), loc.end(), make_pair(add, -INF));
        if (it != loc.end()) it->val += q.amo;
        it = lower_bound(loc.begin(), loc.end(), make_pair(sub+1, -INF));
        if (it != loc.end()) it->val -= q.amo;
    }
    ll sum = 0;
    for (pii l : loc){ // use prefix difference to calculate how much more we need for each type
        sum += l.val;
        auto it = lower_bound(tCopy.begin(), tCopy.end(), make_pair(arr[l.ind], -INF));
        it->val -= sum;
        //cout << sum << " ";
    }
    
    if (queA.empty() || queB.empty()){ // this is the final step
        for (pii t : tCopy){
            if (t.val <= 0) ans[t.ind] = pos;
            else ans[t.ind] = -1;
        }
        return;
    }
    
    vector <pii> typeA, typeB;
    for (int i = 0; i < SZ(type); i++){
        if (tCopy[i].val <= 0) typeA.push_back(type[i]);
        else typeB.push_back(tCopy[i]);
    }
    solve(queA, typeA, pos);
    solve(queB, typeB, pos+SZ(queA));
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> typeNum >> len;
    for (int i = 1; i <= len; i++) {
        cin >> arr[i];
        sta[arr[i]].push_back(i);
    }
    for (int i = 1; i <= typeNum; i++){
        cin >> a;
        allT.push_back({i, a});
    }
    cin >> queNum;
    for (int i = 1; i <= queNum; i++){
        cin >> a >> b >> c;
        allQ.push_back({a, b, c});
    }
    solve(allQ, allT, 1);
    for (int i = 1; i <= typeNum; i++){
        if (ans[i] == -1) cout << "NIE\n";
        else cout << ans[i] << "\n";
    }
    
    return 0;
}
/*
 10 10
 1 2 3 4 5 6 7 8 9 10
 1 2 3 4 5 6 7 8 9 10
 10
 1 3 1
 3 4 1
 7 1 1
 1 5 1
 1 5 1
 6 6 1
 7 7 1
 8 8 1
 9 9 1
 10 10 1
 */

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7508 KB Output is correct
2 Correct 5 ms 7776 KB Output is correct
3 Correct 5 ms 7508 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 13676 KB Output is correct
2 Correct 123 ms 13608 KB Output is correct
3 Incorrect 159 ms 28092 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 15964 KB Output is correct
2 Correct 89 ms 28676 KB Output is correct
3 Correct 22 ms 9296 KB Output is correct
4 Correct 129 ms 15624 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 19072 KB Output is correct
2 Correct 115 ms 19896 KB Output is correct
3 Correct 66 ms 13528 KB Output is correct
4 Correct 129 ms 20432 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 467 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 450 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -