oj.uz

답안 #498721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498721 2021-12-26T09:06:14 Z tht2005 Meteors (POI11_met) C++14
0 / 100
 535 ms 30876 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 = 300000;
int n, m, q, p[N], l[N], r[N], a[N], res[N];
LL f[N];
vector<int> o[N];

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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 7372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 7372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 9940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 74 ms 10172 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 57 ms 9760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 9784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 535 ms 30876 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 450 ms 28908 KB Output isn't correct
2 Halted 0 ms 0 KB -