Submission #70180

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
70180	2018-08-22T13:02:48 Z	model_code	Global Warming (CEOI18_glo)	C++17	100 / 100	627 ms	13832 KB

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

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

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


struct Tree {
    vector<int> tree;
    vector<int> change;
    
    Tree() {
        init();
    }
    
    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) {
        change[2 * x] = min(change[x], change[2 * x]);
        change[2 * x + 1] = min(change[x], change[2 * x + 1]);
        tree[2 * x] = min(tree[2 * x], change[2 * x]);
        tree[2 * x + 1] = min(tree[2 * x + 1], change[2 * x + 1]);
    }

    void update(int x) {
        tree[x] = min(min(tree[2 * x + 1], tree[2 * x]), change[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] = min(change[x], val);
            tree[x] = min(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;
const int END = 2;

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


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

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

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

    a = tree[MID].find(val + dx) + 1;
    b = tree[FRESH].find(val + dx) + 1;
    tree[MID].put(min(a, b), 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);
    for(int i = 0; i < n; ++i)
        scanf("%d", t + i);

    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:108: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:110: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

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	12664 KB	Output is correct
2	Correct	16 ms	12776 KB	Output is correct
3	Correct	16 ms	12776 KB	Output is correct
4	Correct	14 ms	12832 KB	Output is correct
5	Correct	15 ms	12832 KB	Output is correct
6	Correct	15 ms	12832 KB	Output is correct
7	Correct	16 ms	12832 KB	Output is correct
8	Correct	15 ms	12832 KB	Output is correct
9	Correct	15 ms	12832 KB	Output is correct
10	Correct	15 ms	12832 KB	Output is correct
11	Correct	14 ms	12860 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	12664 KB	Output is correct
2	Correct	16 ms	12776 KB	Output is correct
3	Correct	16 ms	12776 KB	Output is correct
4	Correct	14 ms	12832 KB	Output is correct
5	Correct	15 ms	12832 KB	Output is correct
6	Correct	15 ms	12832 KB	Output is correct
7	Correct	16 ms	12832 KB	Output is correct
8	Correct	15 ms	12832 KB	Output is correct
9	Correct	15 ms	12832 KB	Output is correct
10	Correct	15 ms	12832 KB	Output is correct
11	Correct	14 ms	12860 KB	Output is correct
12	Correct	14 ms	12884 KB	Output is correct
13	Correct	14 ms	12884 KB	Output is correct
14	Correct	14 ms	12884 KB	Output is correct
15	Correct	14 ms	12908 KB	Output is correct
16	Correct	14 ms	12908 KB	Output is correct
17	Correct	16 ms	12908 KB	Output is correct
18	Correct	15 ms	13036 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	12664 KB	Output is correct
2	Correct	16 ms	12776 KB	Output is correct
3	Correct	16 ms	12776 KB	Output is correct
4	Correct	14 ms	12832 KB	Output is correct
5	Correct	15 ms	12832 KB	Output is correct
6	Correct	15 ms	12832 KB	Output is correct
7	Correct	16 ms	12832 KB	Output is correct
8	Correct	15 ms	12832 KB	Output is correct
9	Correct	15 ms	12832 KB	Output is correct
10	Correct	15 ms	12832 KB	Output is correct
11	Correct	14 ms	12860 KB	Output is correct
12	Correct	14 ms	12884 KB	Output is correct
13	Correct	14 ms	12884 KB	Output is correct
14	Correct	14 ms	12884 KB	Output is correct
15	Correct	14 ms	12908 KB	Output is correct
16	Correct	14 ms	12908 KB	Output is correct
17	Correct	16 ms	12908 KB	Output is correct
18	Correct	15 ms	13036 KB	Output is correct
19	Correct	16 ms	13036 KB	Output is correct
20	Correct	17 ms	13036 KB	Output is correct
21	Correct	18 ms	13036 KB	Output is correct
22	Correct	17 ms	13036 KB	Output is correct
23	Correct	18 ms	13036 KB	Output is correct
24	Correct	18 ms	13036 KB	Output is correct
25	Correct	16 ms	13036 KB	Output is correct
26	Correct	19 ms	13036 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	582 ms	13820 KB	Output is correct
2	Correct	581 ms	13832 KB	Output is correct
3	Correct	617 ms	13832 KB	Output is correct
4	Correct	627 ms	13832 KB	Output is correct
5	Correct	520 ms	13832 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	175 ms	13832 KB	Output is correct
2	Correct	192 ms	13832 KB	Output is correct
3	Correct	164 ms	13832 KB	Output is correct
4	Correct	140 ms	13832 KB	Output is correct
5	Correct	18 ms	13832 KB	Output is correct
6	Correct	141 ms	13832 KB	Output is correct
7	Correct	147 ms	13832 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	302 ms	13832 KB	Output is correct
2	Correct	283 ms	13832 KB	Output is correct
3	Correct	526 ms	13832 KB	Output is correct
4	Correct	491 ms	13832 KB	Output is correct
5	Correct	229 ms	13832 KB	Output is correct
6	Correct	346 ms	13832 KB	Output is correct
7	Correct	394 ms	13832 KB	Output is correct
8	Correct	230 ms	13832 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	12664 KB	Output is correct
2	Correct	16 ms	12776 KB	Output is correct
3	Correct	16 ms	12776 KB	Output is correct
4	Correct	14 ms	12832 KB	Output is correct
5	Correct	15 ms	12832 KB	Output is correct
6	Correct	15 ms	12832 KB	Output is correct
7	Correct	16 ms	12832 KB	Output is correct
8	Correct	15 ms	12832 KB	Output is correct
9	Correct	15 ms	12832 KB	Output is correct
10	Correct	15 ms	12832 KB	Output is correct
11	Correct	14 ms	12860 KB	Output is correct
12	Correct	14 ms	12884 KB	Output is correct
13	Correct	14 ms	12884 KB	Output is correct
14	Correct	14 ms	12884 KB	Output is correct
15	Correct	14 ms	12908 KB	Output is correct
16	Correct	14 ms	12908 KB	Output is correct
17	Correct	16 ms	12908 KB	Output is correct
18	Correct	15 ms	13036 KB	Output is correct
19	Correct	16 ms	13036 KB	Output is correct
20	Correct	17 ms	13036 KB	Output is correct
21	Correct	18 ms	13036 KB	Output is correct
22	Correct	17 ms	13036 KB	Output is correct
23	Correct	18 ms	13036 KB	Output is correct
24	Correct	18 ms	13036 KB	Output is correct
25	Correct	16 ms	13036 KB	Output is correct
26	Correct	19 ms	13036 KB	Output is correct
27	Correct	582 ms	13820 KB	Output is correct
28	Correct	581 ms	13832 KB	Output is correct
29	Correct	617 ms	13832 KB	Output is correct
30	Correct	627 ms	13832 KB	Output is correct
31	Correct	520 ms	13832 KB	Output is correct
32	Correct	175 ms	13832 KB	Output is correct
33	Correct	192 ms	13832 KB	Output is correct
34	Correct	164 ms	13832 KB	Output is correct
35	Correct	140 ms	13832 KB	Output is correct
36	Correct	18 ms	13832 KB	Output is correct
37	Correct	141 ms	13832 KB	Output is correct
38	Correct	147 ms	13832 KB	Output is correct
39	Correct	302 ms	13832 KB	Output is correct
40	Correct	283 ms	13832 KB	Output is correct
41	Correct	526 ms	13832 KB	Output is correct
42	Correct	491 ms	13832 KB	Output is correct
43	Correct	229 ms	13832 KB	Output is correct
44	Correct	346 ms	13832 KB	Output is correct
45	Correct	394 ms	13832 KB	Output is correct
46	Correct	230 ms	13832 KB	Output is correct
47	Correct	310 ms	13832 KB	Output is correct
48	Correct	302 ms	13832 KB	Output is correct
49	Correct	572 ms	13832 KB	Output is correct
50	Correct	548 ms	13832 KB	Output is correct
51	Correct	400 ms	13832 KB	Output is correct
52	Correct	517 ms	13832 KB	Output is correct
53	Correct	405 ms	13832 KB	Output is correct
54	Correct	438 ms	13832 KB	Output is correct
55	Correct	517 ms	13832 KB	Output is correct

Submission #70180

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