oj.uz

Submission #700943

# Submission time Handle Problem Language Result Execution time Memory
700943 2023-02-19T13:05:56 Z Farbod Constellation 3 (JOI20_constellation3) C++17
35 / 100
 535 ms 524288 KB 
/*
*  In the name of God
*
*  Author: Farbod Doost
*  Last Modified: Sun, 19 Feb 2023 (16:35:33)
*
*/
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;
const long long inf = 1e18;

int pw[N];

int n, m, a[N], dp[N][20];
long long s[N];
vector <pair <int, int>> adj[N];

vector <int> v;

int mx(int l, int r)
{
    if (a[dp[l][pw[r - l + 1]]] > a[dp[r - (1 << pw[r - l + 1]) + 1][pw[r - l + 1]]])
        return dp[l][pw[r - l + 1]];
    return dp[r - (1 << pw[r - l + 1]) + 1][pw[r - l + 1]];
}

int mn(int i, int x)
{
    int j = upper_bound(adj[i].begin(), adj[i].end(), make_pair(x + 1, 0)) - adj[i].begin();
    j--;

    if (j < 0)
        return 0;
    return adj[i][j].second;
}

void f(int l, int r, vector <long long> &ans)
{
    if (l > r) {
        for (int i = 0; i < v.size(); i++)
            ans.push_back(0);
        v.pop_back();

        return;
    }
    if (l == r) {
        for (int i = 0; i < v.size(); i++) 
            ans.push_back(s[l] - mn(l, v[i]));
        v.pop_back();

        return;
    }

    int mid = mx(l, r);

    vector <long long> ansL, ansR;
    v.push_back(a[mid]), f(l, mid - 1, ansL);
    v.push_back(a[mid]), f(mid + 1, r, ansR);

    for (int i = 0; i < v.size(); i++) {
        long long Ans = inf;

        Ans = min(Ans, ansL[i] + ansR.back() + s[mid]),
        Ans = min(Ans, ansL.back() + ansR[i] + s[mid]),
        Ans = min(Ans, ansL.back() + ansR.back() + s[mid] - mn(mid, v[i]));

        ans.push_back(Ans);
    }

    ansL.clear(), ansR.clear();

    v.pop_back();

    return;
}

signed main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    pw[1] = 0;
    for (int i = 2; i < N; i++)
        pw[i] = pw[i / 2] + 1;

    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i], dp[i][0] = i;

    for (int j = 1; j < 20; j++)
        for (int i = 0; i < n; i++) {
            if (a[dp[i][j - 1]] > a[dp[min(n - 1, i + (1 << (j - 1)))][j - 1]])
                dp[i][j] = dp[i][j - 1];
            else
                dp[i][j] = dp[min(n - 1, i + (1 << (j - 1)))][j - 1];
        }
                

    cin >> m;
    for (int i = 0; i < m; i++) {
        int x, y, c;
        cin >> x >> y >> c, x--;
        
        s[x] += c;
        adj[x].push_back({y, c});
    }

    for (int i = 0; i < n; i++) {
        sort(adj[i].begin(), adj[i].end());
        for (int j = 1; j < adj[i].size(); j++)
            adj[i][j].second = max(adj[i][j].second, adj[i][j - 1].second);
    }

    vector <long long> ans;

    v.push_back(n), f(0, n - 1, ans);

    cout << ans.back();

    return 0;
}

Compilation message

constellation3.cpp: In function 'void f(int, int, std::vector<long long int>&)':
constellation3.cpp:42:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         for (int i = 0; i < v.size(); i++)
      |                         ~~^~~~~~~~~~
constellation3.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (int i = 0; i < v.size(); i++)
      |                         ~~^~~~~~~~~~
constellation3.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~
constellation3.cpp: In function 'int main()':
constellation3.cpp:111:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         for (int j = 1; j < adj[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5812 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 3 ms 5844 KB Output is correct
5 Correct 4 ms 5816 KB Output is correct
6 Correct 3 ms 5824 KB Output is correct
7 Correct 4 ms 5820 KB Output is correct
8 Correct 3 ms 5816 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 4 ms 5972 KB Output is correct
11 Correct 3 ms 5844 KB Output is correct
12 Correct 3 ms 5844 KB Output is correct
13 Correct 3 ms 5836 KB Output is correct
14 Correct 3 ms 5844 KB Output is correct
15 Correct 3 ms 5816 KB Output is correct
16 Correct 5 ms 5844 KB Output is correct
17 Correct 4 ms 5820 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 4 ms 5876 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 4 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5812 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 3 ms 5844 KB Output is correct
5 Correct 4 ms 5816 KB Output is correct
6 Correct 3 ms 5824 KB Output is correct
7 Correct 4 ms 5820 KB Output is correct
8 Correct 3 ms 5816 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 4 ms 5972 KB Output is correct
11 Correct 3 ms 5844 KB Output is correct
12 Correct 3 ms 5844 KB Output is correct
13 Correct 3 ms 5836 KB Output is correct
14 Correct 3 ms 5844 KB Output is correct
15 Correct 3 ms 5816 KB Output is correct
16 Correct 5 ms 5844 KB Output is correct
17 Correct 4 ms 5820 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 4 ms 5876 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 4 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 5 ms 5972 KB Output is correct
24 Correct 6 ms 6088 KB Output is correct
25 Correct 5 ms 5972 KB Output is correct
26 Correct 6 ms 6092 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 6 ms 5972 KB Output is correct
29 Correct 5 ms 5972 KB Output is correct
30 Correct 5 ms 5980 KB Output is correct
31 Correct 5 ms 6100 KB Output is correct
32 Correct 16 ms 10944 KB Output is correct
33 Correct 14 ms 8660 KB Output is correct
34 Correct 12 ms 8020 KB Output is correct
35 Correct 13 ms 7380 KB Output is correct
36 Correct 16 ms 6348 KB Output is correct
37 Correct 16 ms 6336 KB Output is correct
38 Correct 28 ms 6536 KB Output is correct
39 Correct 5 ms 6100 KB Output is correct
40 Correct 23 ms 12340 KB Output is correct
41 Correct 5 ms 6100 KB Output is correct
42 Correct 7 ms 6100 KB Output is correct
43 Correct 23 ms 12500 KB Output is correct
44 Correct 5 ms 5972 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5812 KB Output is correct
2 Correct 4 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 3 ms 5844 KB Output is correct
5 Correct 4 ms 5816 KB Output is correct
6 Correct 3 ms 5824 KB Output is correct
7 Correct 4 ms 5820 KB Output is correct
8 Correct 3 ms 5816 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 4 ms 5972 KB Output is correct
11 Correct 3 ms 5844 KB Output is correct
12 Correct 3 ms 5844 KB Output is correct
13 Correct 3 ms 5836 KB Output is correct
14 Correct 3 ms 5844 KB Output is correct
15 Correct 3 ms 5816 KB Output is correct
16 Correct 5 ms 5844 KB Output is correct
17 Correct 4 ms 5820 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 4 ms 5876 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 4 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 5 ms 5972 KB Output is correct
24 Correct 6 ms 6088 KB Output is correct
25 Correct 5 ms 5972 KB Output is correct
26 Correct 6 ms 6092 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 6 ms 5972 KB Output is correct
29 Correct 5 ms 5972 KB Output is correct
30 Correct 5 ms 5980 KB Output is correct
31 Correct 5 ms 6100 KB Output is correct
32 Correct 16 ms 10944 KB Output is correct
33 Correct 14 ms 8660 KB Output is correct
34 Correct 12 ms 8020 KB Output is correct
35 Correct 13 ms 7380 KB Output is correct
36 Correct 16 ms 6348 KB Output is correct
37 Correct 16 ms 6336 KB Output is correct
38 Correct 28 ms 6536 KB Output is correct
39 Correct 5 ms 6100 KB Output is correct
40 Correct 23 ms 12340 KB Output is correct
41 Correct 5 ms 6100 KB Output is correct
42 Correct 7 ms 6100 KB Output is correct
43 Correct 23 ms 12500 KB Output is correct
44 Correct 5 ms 5972 KB Output is correct
45 Correct 231 ms 29400 KB Output is correct
46 Correct 245 ms 29116 KB Output is correct
47 Correct 229 ms 28772 KB Output is correct
48 Correct 273 ms 29448 KB Output is correct
49 Correct 232 ms 28684 KB Output is correct
50 Correct 238 ms 28620 KB Output is correct
51 Correct 286 ms 28764 KB Output is correct
52 Correct 248 ms 29192 KB Output is correct
53 Correct 249 ms 29160 KB Output is correct
54 Runtime error 535 ms 524288 KB Execution killed with signal 9
55 Halted 0 ms 0 KB -