oj.uz

답안 #884239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884239 2023-12-06T21:43:55 Z HorizonWest Financial Report (JOI21_financial) C++17
100 / 100
 619 ms 54100 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

struct SegmentTree
{
    struct node
    {
        int val;

        node(int v = 0)
        {
            val = v;
        }
    };

    vector <node> tree; int l;

    node merge(node a, node b)
    {
        return node(max(a.val, b.val));
    }

    void update(int k, int v)
    {
        k += (l - 1); tree[k] = node(v);
        for(k /= 2; k > 0; k /= 2)
            tree[k] = merge(tree[2*k], tree[2*k+1]);
    }

    node query(int k, int x, int y, int s, int e)
    {
        if(s > y || e < x)
            return node();
        if(s >= x && e <= y)
            return tree[k];

        int middle = (s + e) / 2;

        return merge(query(2*k, x, y, s, middle),
            query(2*k+1, x, y, middle + 1, e));
    }

    int query(int x, int y)
    {
        node ans = query(1, x, y, 1, l);
        return ans.val;
    }

    SegmentTree(int n)
    {
        for(l = 1; l < n; (l <<= 1));
        tree.assign(2 * l, node());
    }
};

struct SegmentTreePos
{
    struct node
    {
        int val, pos;

        node(int v = 0, int p = 0)
        {
            val = v; pos = p; 
        }
    };

    vector <node> tree; int l;

    node merge(node a, node b)
    {
        if(a.val == 0)
            return node(b.val, b.pos);     
        else 
            return node(a.val, a.pos);
    }

    void update(int k, int v)
    {
        k += (l - 1); tree[k] = node(v, k - (l - 1)); //cout << "UPDATE: " << k - (l - 1) << " " << v << endl; 
        for(k /= 2; k > 0; k /= 2)
            tree[k] = merge(tree[2*k], tree[2*k+1]);
    }

    node query(int k, int x, int y, int s, int e)
    {
        if(s > y || e < x)
            return node();
        if(s >= x && e <= y)
            return tree[k];

        int middle = (s + e) / 2;

        return merge(query(2*k, x, y, s, middle),
            query(2*k+1, x, y, middle + 1, e));
    }

    pair <int, int> query(int x, int y)
    {
        node ans = query(1, x, y, 1, l);
        return { ans.val, ans.pos };
    }

    SegmentTreePos(int n)
    {
        for(l = 1; l < n; (l <<= 1));
        tree.assign(2 * l, node());
    }
};

void solve()
{
    int n, d; cin >> n >> d; 
    SegmentTree St1(n+2);
    SegmentTreePos St2(n+2);
    vector <pair<int, int>> f(n);
    vector <int> v(n); 
    for(int i = 0; i < n; i++)
    {
        cin >> v[i]; 
        f[i].fs = v[i]; f[i].sd = i; 
    } 
    sort(all(f)); 

    map <int, int> mp; 

    for(int i = 0; i < n; i++)
        mp[f[i].fs] = i + 2; 

    for(int i = 1; i <= n; i++)
    {
        int x = mp[v[i-1]]; pair <int, int> y = St2.query(1, n+2); //cerr << "I: " << i << " X: " << x << "    - " << y.fs << " " << y.sd << " " << i - d << endl; 

        while ((y.fs < i - d) && y.fs != 0) // HERE
        {
            St1.update(y.sd, 0); //cerr << "PASA: " << y.fs << " " << y.sd << endl; 
            St2.update(y.sd, 0); 
            y = St2.query(1, n+2); 
        }
        
        St1.update(x, max(St1.query(x, x), St1.query(1, x - 1) + 1));
        St2.update(x, i); 
    }

    cout << St1.query(1, n+2) << endl; 
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 0 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 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 0 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 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 452 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 0 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 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 452 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 5 ms 1112 KB Output is correct
42 Correct 6 ms 1372 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 5 ms 1116 KB Output is correct
45 Correct 5 ms 1116 KB Output is correct
46 Correct 5 ms 1372 KB Output is correct
47 Correct 5 ms 1368 KB Output is correct
48 Correct 6 ms 1372 KB Output is correct
49 Correct 6 ms 1372 KB Output is correct
50 Correct 6 ms 1356 KB Output is correct
51 Correct 6 ms 1524 KB Output is correct
52 Correct 6 ms 1372 KB Output is correct
53 Correct 5 ms 1492 KB Output is correct
54 Correct 5 ms 1372 KB Output is correct
55 Correct 6 ms 1496 KB Output is correct
56 Correct 5 ms 1368 KB Output is correct
57 Correct 6 ms 1352 KB Output is correct
58 Correct 4 ms 1344 KB Output is correct
59 Correct 4 ms 1368 KB Output is correct
60 Correct 5 ms 1368 KB Output is correct
61 Correct 5 ms 1456 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 34972 KB Output is correct
2 Correct 203 ms 34916 KB Output is correct
3 Correct 235 ms 34900 KB Output is correct
4 Correct 584 ms 51056 KB Output is correct
5 Correct 444 ms 53588 KB Output is correct
6 Correct 591 ms 53584 KB Output is correct
7 Correct 285 ms 53840 KB Output is correct
8 Correct 222 ms 53744 KB Output is correct
9 Correct 284 ms 53820 KB Output is correct
10 Correct 259 ms 53728 KB Output is correct
11 Correct 361 ms 53840 KB Output is correct
12 Correct 371 ms 53764 KB Output is correct
13 Correct 547 ms 53820 KB Output is correct
14 Correct 586 ms 53764 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 35152 KB Output is correct
2 Correct 163 ms 34900 KB Output is correct
3 Correct 236 ms 35152 KB Output is correct
4 Correct 542 ms 53752 KB Output is correct
5 Correct 445 ms 53880 KB Output is correct
6 Correct 530 ms 53620 KB Output is correct
7 Correct 225 ms 53848 KB Output is correct
8 Correct 219 ms 53852 KB Output is correct
9 Correct 227 ms 53588 KB Output is correct
10 Correct 294 ms 53584 KB Output is correct
11 Correct 543 ms 53844 KB Output is correct
12 Correct 454 ms 53584 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 0 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 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 452 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 5 ms 1112 KB Output is correct
42 Correct 6 ms 1372 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 5 ms 1116 KB Output is correct
45 Correct 5 ms 1116 KB Output is correct
46 Correct 5 ms 1372 KB Output is correct
47 Correct 5 ms 1368 KB Output is correct
48 Correct 6 ms 1372 KB Output is correct
49 Correct 6 ms 1372 KB Output is correct
50 Correct 6 ms 1356 KB Output is correct
51 Correct 6 ms 1524 KB Output is correct
52 Correct 6 ms 1372 KB Output is correct
53 Correct 5 ms 1492 KB Output is correct
54 Correct 5 ms 1372 KB Output is correct
55 Correct 6 ms 1496 KB Output is correct
56 Correct 5 ms 1368 KB Output is correct
57 Correct 6 ms 1352 KB Output is correct
58 Correct 4 ms 1344 KB Output is correct
59 Correct 4 ms 1368 KB Output is correct
60 Correct 5 ms 1368 KB Output is correct
61 Correct 5 ms 1456 KB Output is correct
62 Correct 120 ms 34972 KB Output is correct
63 Correct 203 ms 34916 KB Output is correct
64 Correct 235 ms 34900 KB Output is correct
65 Correct 584 ms 51056 KB Output is correct
66 Correct 444 ms 53588 KB Output is correct
67 Correct 591 ms 53584 KB Output is correct
68 Correct 285 ms 53840 KB Output is correct
69 Correct 222 ms 53744 KB Output is correct
70 Correct 284 ms 53820 KB Output is correct
71 Correct 259 ms 53728 KB Output is correct
72 Correct 361 ms 53840 KB Output is correct
73 Correct 371 ms 53764 KB Output is correct
74 Correct 547 ms 53820 KB Output is correct
75 Correct 586 ms 53764 KB Output is correct
76 Correct 121 ms 35152 KB Output is correct
77 Correct 163 ms 34900 KB Output is correct
78 Correct 236 ms 35152 KB Output is correct
79 Correct 542 ms 53752 KB Output is correct
80 Correct 445 ms 53880 KB Output is correct
81 Correct 530 ms 53620 KB Output is correct
82 Correct 225 ms 53848 KB Output is correct
83 Correct 219 ms 53852 KB Output is correct
84 Correct 227 ms 53588 KB Output is correct
85 Correct 294 ms 53584 KB Output is correct
86 Correct 543 ms 53844 KB Output is correct
87 Correct 454 ms 53584 KB Output is correct
88 Correct 286 ms 35156 KB Output is correct
89 Correct 597 ms 53076 KB Output is correct
90 Correct 346 ms 37948 KB Output is correct
91 Correct 561 ms 53588 KB Output is correct
92 Correct 162 ms 34900 KB Output is correct
93 Correct 248 ms 35408 KB Output is correct
94 Correct 456 ms 48244 KB Output is correct
95 Correct 524 ms 53844 KB Output is correct
96 Correct 519 ms 53584 KB Output is correct
97 Correct 619 ms 53848 KB Output is correct
98 Correct 551 ms 53844 KB Output is correct
99 Correct 550 ms 53840 KB Output is correct
100 Correct 536 ms 53844 KB Output is correct
101 Correct 290 ms 53856 KB Output is correct
102 Correct 288 ms 53584 KB Output is correct
103 Correct 308 ms 53884 KB Output is correct
104 Correct 318 ms 53820 KB Output is correct
105 Correct 351 ms 53824 KB Output is correct
106 Correct 270 ms 53588 KB Output is correct
107 Correct 301 ms 53820 KB Output is correct
108 Correct 437 ms 54100 KB Output is correct
109 Correct 468 ms 53588 KB Output is correct
110 Correct 528 ms 53624 KB Output is correct
111 Correct 554 ms 53840 KB Output is correct
112 Correct 426 ms 53800 KB Output is correct
113 Correct 517 ms 53816 KB Output is correct
114 Correct 546 ms 53840 KB Output is correct
115 Correct 219 ms 53588 KB Output is correct
116 Correct 223 ms 53816 KB Output is correct
117 Correct 255 ms 53588 KB Output is correct
118 Correct 250 ms 53760 KB Output is correct
119 Correct 330 ms 53972 KB Output is correct
120 Correct 332 ms 53776 KB Output is correct