Submission #498855

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
498855	2021-12-26T13:07:49 Z	tht2005	Meteors (POI11_met)	C++17	74 / 100	410 ms	23408 KB

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

void io(string in = "", string out = "", string err = "") {
if(fopen(in.c_str(), "r")) {
    freopen(in.c_str(), "r", stdin);
    freopen(out.c_str(), "w", stdout);
#ifdef conv_local
    freopen(err.c_str(), "w", stderr);
#endif
}
}
void conv();

int main() {
#ifdef conv_local
    //io("in.txt", "out.txt", "err.txt");
    auto st = chrono::steady_clock::now();
#else
#define TASKNAME ""
    io(TASKNAME".inp", TASKNAME".out");
#endif
    ios::sync_with_stdio(false); cin.tie(NULL);
    int Q = 1;
    //cin >> Q;
    while(Q--) {
        conv();
    }
#ifdef conv_local
    auto ed = chrono::steady_clock::now();
    cout << "\nExcution Time: " << chrono::duration_cast<chrono::milliseconds> (ed - st).count() << "[ms]" << endl;
#endif
    return 0;
}

typedef long long LL;

const int N = 300003;
int n, m, q, g = 0, l[N], r[N], a[N], res[N];
LL f[N], p[N];
vector<int> o[N];

void add(int x, LL d) {
    for(; x <= m; x += x&-x) f[x] += d;
}
LL query(int x) {
    LL ret = 0;
    for(; x > 0; x &= x - 1) ret += f[x];
    return ret;
}
void add_range(int ql, int qr, LL d) {
    add(ql, d);
    add(qr + 1, -d);
    if(ql > qr) add(1, d);
}
void solve(int ql, int qr, vector<int>& v) {
    if(ql == qr || v.empty()) {
        for(int i : v) res[i] = ql;
    }
    else {
        int qm = (ql + qr) >> 1;
        while(g < qm) ++g, add_range(l[g], r[g], a[g]);
        while(g > qm) add_range(l[g], r[g], -a[g]), --g;
        vector<int> ok, n_ok;
        for(int i : v) {
            LL tot = 0;
            for(int j : o[i]) tot += query(j);
            if(tot < p[i]) n_ok.push_back(i);
            else ok.push_back(i);
        }
        solve(ql, qm, ok);
        solve(qm + 1, qr, n_ok);
    }
}
void conv() {
    cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int j;
        cin >> j;
        o[j].push_back(i);
    }
    for(int i = 1; i <= n; ++i) cin >> p[i];
    cin >> q;
    for(int i = 1; i <= q; ++i) cin >> l[i] >> r[i] >> a[i];
    vector<int> v(n);
    iota(v.begin(), v.end(), 1);
    solve(1, q + 1, v);
    for(int i = 1; i <= n; ++i) {
        if(res[i] > q) cout << "NIE" << '\n';
        else cout << res[i] << '\n';
    }
}

Compilation message

met.cpp: In function 'void io(std::string, std::string, std::string)':
met.cpp:31:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     freopen(in.c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
met.cpp:32:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     freopen(out.c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	9084 KB	Output is correct
2	Correct	75 ms	10976 KB	Output is correct
3	Correct	65 ms	9332 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	55 ms	9036 KB	Output is correct
2	Correct	62 ms	9048 KB	Output is correct
3	Correct	54 ms	10436 KB	Output is correct
4	Correct	25 ms	9152 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	8924 KB	Output is correct
2	Correct	61 ms	10568 KB	Output is correct
3	Correct	18 ms	7940 KB	Output is correct
4	Correct	61 ms	9536 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	35 ms	8652 KB	Output is correct
2	Correct	60 ms	9068 KB	Output is correct
3	Correct	40 ms	8752 KB	Output is correct
4	Correct	77 ms	10156 KB	Output is correct

Subtask #7
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	410 ms	23408 KB	Output is correct
2	Incorrect	260 ms	14552 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #8
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	357 ms	21556 KB	Output is correct
2	Incorrect	265 ms	14308 KB	Output isn't correct
3	Halted	0 ms	0 KB	-