답안 #70183 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
70183	2018-08-22T13:02:59 Z	model_code	Global Warming (CEOI18_glo)	C++17	100 / 100	301 ms	9716 KB

// Patryk Czajka
// O(n *log(n))

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

int r = 1;
const int maxN = 2e5 + 10;
const int inf = 2e9+10;


struct Tree {
    vector<int> tree;
    vector<int> change;

    void init() {
        tree.resize(2 * r);
        change.resize(2 * r);
    }

    void reset() {
        fill(tree.begin(), tree.end(), inf);
        fill(change.begin(), change.end(), inf);
    }

    void push(int x) {
        if(change[x] == inf)
            return;

        change[2 * x] = change[2 * x + 1] = change[x];
        tree[2 * x] = tree[2 * x + 1] = change[x];
        change[x] = inf;
    }

    void update(int x) {
        tree[x] = min(tree[2 * x + 1], tree[2 * x]);
    }

    int find(int val) {
        if(tree[1] >= val)
            return -1;
        
        int x = 1;
        while(x < r) {
            push(x);
            if(tree[2 * x + 1] >= val)
                x = 2 * x;
            else
                x = 2 * x + 1;
        }
        return x - r;
    }

    void put(int qa, int qb, int val, int a, int b, int x) {
        if(qa <= a && b <= qb) {
            change[x] = tree[x] = val;
            return;
        }
    
        int avg = (a + b) / 2;
        push(x);
        if(qa <= avg) put(qa, qb, val, a, avg, 2 * x);
        if(avg < qb) put(qa, qb, val, avg + 1, b, 2 * x + 1);
        update(x);
    }
};

const int FRESH = 0;
const int MID = 1;

Tree tree[2];
int t[maxN];


void reset() {
    tree[FRESH].reset();
    tree[MID].reset();
}

void init() {
    tree[FRESH].init();
    tree[MID].init();
}

int get_res() {
    return tree[MID].find(inf) + 1;
}

#define DEF 0, r - 1, 1
void add(int val, int dx) {
    int a, b;
    a = tree[MID].find(val + dx) + 1;
    b = tree[FRESH].find(val + dx) + 1;
    tree[MID].put(a, max(a, b), val + dx, DEF);

    a = tree[FRESH].find(val) + 1;
    tree[FRESH].put(a, a, val, DEF);
}

int n, X, res;

int main() {
    scanf("%d%d", &n, &X);
    while(r < n)
        r *= 2;
    for(int i = 0; i < n; ++i)
        scanf("%d", t + i);

    init();
    reset();
    for(int i = 0; i < n; ++i)
        add(t[i], X);
    res = max(res, get_res());

    printf("%d\n", res);
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:104:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &X);
     ~~~~~^~~~~~~~~~~~~~~~
glo.cpp:108:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", t + i);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	340 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	536 KB	Output is correct
6	Correct	3 ms	536 KB	Output is correct
7	Correct	2 ms	536 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	340 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	536 KB	Output is correct
6	Correct	3 ms	536 KB	Output is correct
7	Correct	2 ms	536 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	2 ms	584 KB	Output is correct
13	Correct	2 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	2 ms	584 KB	Output is correct
16	Correct	2 ms	584 KB	Output is correct
17	Correct	2 ms	612 KB	Output is correct
18	Correct	2 ms	612 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	340 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	536 KB	Output is correct
6	Correct	3 ms	536 KB	Output is correct
7	Correct	2 ms	536 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	2 ms	584 KB	Output is correct
13	Correct	2 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	2 ms	584 KB	Output is correct
16	Correct	2 ms	584 KB	Output is correct
17	Correct	2 ms	612 KB	Output is correct
18	Correct	2 ms	612 KB	Output is correct
19	Correct	4 ms	652 KB	Output is correct
20	Correct	3 ms	652 KB	Output is correct
21	Correct	4 ms	652 KB	Output is correct
22	Correct	3 ms	652 KB	Output is correct
23	Correct	3 ms	652 KB	Output is correct
24	Correct	2 ms	668 KB	Output is correct
25	Correct	4 ms	672 KB	Output is correct
26	Correct	3 ms	672 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	280 ms	9656 KB	Output is correct
2	Correct	285 ms	9716 KB	Output is correct
3	Correct	259 ms	9716 KB	Output is correct
4	Correct	291 ms	9716 KB	Output is correct
5	Correct	218 ms	9716 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	58 ms	9716 KB	Output is correct
2	Correct	59 ms	9716 KB	Output is correct
3	Correct	64 ms	9716 KB	Output is correct
4	Correct	53 ms	9716 KB	Output is correct
5	Correct	3 ms	9716 KB	Output is correct
6	Correct	47 ms	9716 KB	Output is correct
7	Correct	49 ms	9716 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	126 ms	9716 KB	Output is correct
2	Correct	124 ms	9716 KB	Output is correct
3	Correct	295 ms	9716 KB	Output is correct
4	Correct	217 ms	9716 KB	Output is correct
5	Correct	85 ms	9716 KB	Output is correct
6	Correct	206 ms	9716 KB	Output is correct
7	Correct	251 ms	9716 KB	Output is correct
8	Correct	122 ms	9716 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	340 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	3 ms	488 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	536 KB	Output is correct
6	Correct	3 ms	536 KB	Output is correct
7	Correct	2 ms	536 KB	Output is correct
8	Correct	2 ms	536 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	2 ms	584 KB	Output is correct
13	Correct	2 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	2 ms	584 KB	Output is correct
16	Correct	2 ms	584 KB	Output is correct
17	Correct	2 ms	612 KB	Output is correct
18	Correct	2 ms	612 KB	Output is correct
19	Correct	4 ms	652 KB	Output is correct
20	Correct	3 ms	652 KB	Output is correct
21	Correct	4 ms	652 KB	Output is correct
22	Correct	3 ms	652 KB	Output is correct
23	Correct	3 ms	652 KB	Output is correct
24	Correct	2 ms	668 KB	Output is correct
25	Correct	4 ms	672 KB	Output is correct
26	Correct	3 ms	672 KB	Output is correct
27	Correct	280 ms	9656 KB	Output is correct
28	Correct	285 ms	9716 KB	Output is correct
29	Correct	259 ms	9716 KB	Output is correct
30	Correct	291 ms	9716 KB	Output is correct
31	Correct	218 ms	9716 KB	Output is correct
32	Correct	58 ms	9716 KB	Output is correct
33	Correct	59 ms	9716 KB	Output is correct
34	Correct	64 ms	9716 KB	Output is correct
35	Correct	53 ms	9716 KB	Output is correct
36	Correct	3 ms	9716 KB	Output is correct
37	Correct	47 ms	9716 KB	Output is correct
38	Correct	49 ms	9716 KB	Output is correct
39	Correct	126 ms	9716 KB	Output is correct
40	Correct	124 ms	9716 KB	Output is correct
41	Correct	295 ms	9716 KB	Output is correct
42	Correct	217 ms	9716 KB	Output is correct
43	Correct	85 ms	9716 KB	Output is correct
44	Correct	206 ms	9716 KB	Output is correct
45	Correct	251 ms	9716 KB	Output is correct
46	Correct	122 ms	9716 KB	Output is correct
47	Correct	125 ms	9716 KB	Output is correct
48	Correct	124 ms	9716 KB	Output is correct
49	Correct	296 ms	9716 KB	Output is correct
50	Correct	205 ms	9716 KB	Output is correct
51	Correct	162 ms	9716 KB	Output is correct
52	Correct	187 ms	9716 KB	Output is correct
53	Correct	176 ms	9716 KB	Output is correct
54	Correct	184 ms	9716 KB	Output is correct
55	Correct	301 ms	9716 KB	Output is correct

답안 #70183

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
25.0 / 25.0