Submission #358621

#	Time	Username	Problem	Language	Result	Execution time	Memory
358621		mjhmjh1104	새로운 문제 (POI11_met)	C++14	74 / 100	1222 ms	21712 KiB

met

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

long long tree[300006];

long long query(int x) {
    long long ret = 0;
    while (x > 0) {
        ret += tree[x];
        x -= x & -x;
    }
    return ret;
}

void update_fenwick(int x, long long v) {
    while (x < 300006) {
        tree[x] += v;
        x += x & -x;
    }
}

void update(int l, int r, long long v) {
    update_fenwick(l, v);
    update_fenwick(r + 1, -v);
}

struct Query {
    int q;
    int l;
    int r;
    int m;
};

int n, m, p[300006], q;
vector<pair<pair<int, int>, int>> updates;
vector<Query> queries;
vector<int> o[300006];

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; i++) {
        int t;
        scanf("%d", &t);
        o[t - 1].push_back(i);
    }
    for (int i = 0; i < n; i++) scanf("%d", p + i);
    scanf("%d", &q);
    for (int i = 0; i < q; i++) {
        int a, b, x;
        scanf("%d%d%d", &a, &b, &x);
        a--, b--;
        updates.push_back({ { a, b }, x });
    }
    for (int i = 0; i < n; i++) queries.push_back(Query{ i, 0, 300002, 150000 });
    for (int t = 0; t < 20; t++) {
        sort(queries.begin(), queries.end(), [](const Query &a, const Query &b) {
            return a.m < b.m;
        });
        fill(tree, tree + 300006, 0);
        int k = 0;
        for (int i = 0; i < q; i++) {
            while (k < n && i >= queries[k].m) {
                if (queries[k].l < queries[k].r) {
                    long long sum = 0;
                    for (auto &j: o[queries[k].q]) sum += query(j + 1);
                    if (sum >= p[queries[k].q]) queries[k].r = queries[k].m;
                    else queries[k].l = queries[k].m + 1;
                    queries[k].m = (queries[k].l + queries[k].r) / 2;
                }
                k++;
            }
            if (updates[i].first.first <= updates[i].first.second) update(updates[i].first.first + 1, updates[i].first.second + 1, updates[i].second);
            else update(updates[i].first.first + 1, m, updates[i].second), update(1, updates[i].first.second + 1, updates[i].second);
        }
        for (; k < n; k++) if (queries[k].l < queries[k].r) {
            long long sum = 0;
            for (auto &j: o[queries[k].q]) sum += query(j + 1);
            if (sum >= p[queries[k].q]) queries[k].r = queries[k].m;
            else queries[k].l = queries[k].m + 1;
            queries[k].m = (queries[k].l + queries[k].r) / 2;
        }
    }
    sort(queries.begin(), queries.end(), [](const Query &a, const Query &b) {
        return a.q < b.q;
    });
    for (auto &i: queries) {
        if (i.l >= 300002) puts("NIE");
        else printf("%d\n", i.l);
    }
}

Compilation message (stderr)

met.cpp: In function 'int main()':
met.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
met.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |         scanf("%d", &t);
      |         ~~~~~^~~~~~~~~~
met.cpp:48:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |     for (int i = 0; i < n; i++) scanf("%d", p + i);
      |                                 ~~~~~^~~~~~~~~~~~~
met.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   49 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
met.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   52 |         scanf("%d%d%d", &a, &b, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 13 / 13
• Subtask 6: 13 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13