Submission #801070

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
801070	2023-08-02T04:25:29 Z	Dawnlight	Meteors (POI11_met)	C++14	100 / 100	1218 ms	55032 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;

vector <pii> loc; // considered locations and dif
vector <pii> tCopy; // copy of type

void solve(int le, int ri, vector <pii> & type){ // type: station types and how much is needed, le and ri of queries
    //cout << le << " " << ri << " " << SZ(type) << "\n";
    loc.clear();
    tCopy.clear();
    if (type.empty()) return;
    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;
    
    int mid = (le+ri)/2;
    for (int i = le; i <= mid; i++){ // set up prefix difference
        Query q = allQ[i];
        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;
        it->val = max(it->val, 0LL); // sum for individual station won't overflow, but the type might overflow if it has multiple stations
        //cout << sum << " ";
    }
    
    if (le == ri){ // this is the final step
        for (pii t : tCopy){
            if (t.val <= 0) ans[t.ind] = le+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(le, mid, typeA);
    solve(mid+1, ri, typeB);
}

signed 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 = 0; i < queNum; i++){
        cin >> a >> b >> c;
        allQ.push_back({a, b, c});
    }
    solve(0, queNum-1, allT);
    for (int i = 1; i <= typeNum; i++){
        if (ans[i] == 0) cout << "NIE\n";
        else cout << ans[i] << "\n";
    }
    
    return 0;
}
/*
 10 11
 1 2 3 4 5 6 7 8 9 10 11
 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	7380 KB	Output is correct
2	Correct	5 ms	7528 KB	Output is correct
3	Correct	4 ms	7380 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	49 ms	9996 KB	Output is correct
2	Correct	166 ms	17064 KB	Output is correct
3	Correct	126 ms	10712 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	85 ms	10432 KB	Output is correct
2	Correct	100 ms	10372 KB	Output is correct
3	Correct	151 ms	14284 KB	Output is correct
4	Correct	48 ms	11412 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	52 ms	10212 KB	Output is correct
2	Correct	75 ms	15272 KB	Output is correct
3	Correct	20 ms	8276 KB	Output is correct
4	Correct	99 ms	11260 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	77 ms	9900 KB	Output is correct
2	Correct	103 ms	10428 KB	Output is correct
3	Correct	60 ms	9956 KB	Output is correct
4	Correct	111 ms	13000 KB	Output is correct

Subtask #7
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1218 ms	44600 KB	Output is correct
2	Correct	276 ms	25744 KB	Output is correct
3	Correct	92 ms	12792 KB	Output is correct
4	Correct	1182 ms	47772 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1140 ms	38428 KB	Output is correct
2	Correct	245 ms	25456 KB	Output is correct
3	Correct	61 ms	13260 KB	Output is correct
4	Correct	1096 ms	55032 KB	Output is correct

Submission #801070

Compilation message