답안 #941713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
941713	2024-03-09T10:34:48 Z	andrew	단층 (JOI16_ho_t5)	C++17	18 / 100	2 ms	604 KB

2016_ho_t5

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int N = 2e5;

template <typename T>
struct fenwick_tree{
    vector <T> t;
    fenwick_tree(int n){
        t.resize(n + 1);
        fill(t.begin(), t.end(), 0);
    }

    T f(int pos){
        T res = 0;
        for(int i = pos; i > 0; i -= i & -i) res += t[i];
        return res;
    }
    void u(int pos, T val){
        for(int i = pos; i < (int)t.size(); i += i & -i) t[i] += val;
    }
};

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);  

    int n, q;
    cin >> n >> q;

    fenwick_tree <int> x(n), y(n);

    for (int i = 1; i <= n; i++) {
        x.u(i, 1);
        y.u(i, 1);
    }

    vector <int> P(q), D(q), L(q);

    for (int i = 0; i < q; i++) {
        cin >> P[i] >> D[i] >> L[i];
    }

    for (int i = q - 1; i >= 0; i--) {
        if (D[i] == 1) {
            int l = 0, r = n + 1;
            while (r - l > 1) {
                int mid = (l + r) >> 1;
                if (x.f(mid) <= P[i]) l = mid;
                else r = mid;
            }
            y.u(1, -2 * L[i]);
            y.u(l + 1, 2 * L[i]);
        }else {
            int l = 0, r = n + 1;
            while (r - l > 1) {
                int mid = (l + r) >> 1;
                if (y.f(mid) <= P[i]) l = mid;
                else r = mid;
            }            
            x.u(r, 2 * L[i]);
        }
    }

    for (int i = 1; i <= n; i++) {
        cout << (x.f(i) - y.f(i)) / 2 << "\n";
    }

    return 0;
}

Subtask #1

18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	452 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	352 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	452 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	352 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	2 ms	600 KB	Output is correct
29	Correct	1 ms	544 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	2 ms	348 KB	Output is correct
32	Correct	2 ms	344 KB	Output is correct
33	Correct	2 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	2 ms	348 KB	Output is correct
36	Correct	1 ms	536 KB	Output is correct
37	Correct	2 ms	500 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	2 ms	348 KB	Output is correct
41	Correct	2 ms	348 KB	Output is correct
42	Correct	2 ms	536 KB	Output is correct
43	Incorrect	2 ms	604 KB	Output isn't correct
44	Halted	0 ms	0 KB	-

Subtask #3

0 / 66.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	452 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	352 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	2 ms	600 KB	Output is correct
29	Correct	1 ms	544 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	2 ms	348 KB	Output is correct
32	Correct	2 ms	344 KB	Output is correct
33	Correct	2 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	2 ms	348 KB	Output is correct
36	Correct	1 ms	536 KB	Output is correct
37	Correct	2 ms	500 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	2 ms	348 KB	Output is correct
41	Correct	2 ms	348 KB	Output is correct
42	Correct	2 ms	536 KB	Output is correct
43	Incorrect	2 ms	604 KB	Output isn't correct
44	Halted	0 ms	0 KB	-