답안 #498890

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
498890	2021-12-26T14:09:15 Z	tht2005	Meteors (POI11_met)	C++14	74 / 100	2238 ms	26052 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;
const int M = N << 1;
int n, m, q, l[N], r[N], ql[N], qr[N], a[N], res[N];
LL f[M], p[N];
list<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), add(m + 1, -d);
}

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 >> ql[i] >> qr[i] >> a[i];
    }
    for(int i = 1; i <= n; ++i) {
        l[i] = 1;
        r[i] = q + 1;
    }
    int ptr = 0;
    while(1) {
        vector<pair<int, int>> work;
        for(int i = 1; i <= n; ++i) {
            if(l[i] != r[i]) {
                int qm = (l[i] + r[i]) >> 1;
                work.emplace_back(qm, i);
            }
        }
        if(work.empty()) break;
        sort(work.begin(), work.end());
        for(auto [qm, i] : work) {
            while(ptr < qm) ++ptr, add_range(ql[ptr], qr[ptr], a[ptr]);
            while(ptr > qm) add_range(ql[ptr], qr[ptr], -a[ptr]), --ptr;
            LL tot = 0;
            for(int j : o[i]) tot += query(j);
            if(tot < p[i]) l[i] = qm + 1;
            else r[i] = qm;
        }
    }
    for(int i = 1; i <= n; ++i) {
        if(l[i] > q) cout << "NIE" << '\n';
        else cout << l[i] << '\n';
    }
}

Compilation message

met.cpp: In function 'void conv()':
met.cpp:111:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  111 |         for(auto [qm, i] : work) {
      |                  ^
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

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7500 KB	Output is correct
2	Correct	6 ms	7500 KB	Output is correct
3	Correct	7 ms	7476 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	7520 KB	Output is correct
2	Correct	7 ms	7500 KB	Output is correct
3	Correct	7 ms	7440 KB	Output is correct

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	114 ms	10156 KB	Output is correct
2	Correct	263 ms	10820 KB	Output is correct
3	Correct	167 ms	10564 KB	Output is correct

Subtask #4
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	222 ms	10312 KB	Output is correct
2	Correct	212 ms	10364 KB	Output is correct
3	Correct	299 ms	10984 KB	Output is correct
4	Correct	43 ms	9968 KB	Output is correct

Subtask #5
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	179 ms	10152 KB	Output is correct
2	Correct	284 ms	10940 KB	Output is correct
3	Correct	100 ms	8012 KB	Output is correct
4	Correct	172 ms	10628 KB	Output is correct

Subtask #6
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	86 ms	9996 KB	Output is correct
2	Correct	297 ms	10456 KB	Output is correct
3	Correct	98 ms	10052 KB	Output is correct
4	Correct	244 ms	10828 KB	Output is correct

Subtask #7
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	963 ms	26052 KB	Output is correct
2	Incorrect	2238 ms	22752 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #8
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	937 ms	25852 KB	Output is correct
2	Incorrect	717 ms	22376 KB	Output isn't correct
3	Halted	0 ms	0 KB	-