oj.uz

Submission #489981

# Submission time Handle Problem Language Result Execution time Memory
489981 2021-11-25T07:27:45 Z blue Treatment Project (JOI20_treatment) C++17
35 / 100
 36 ms 30108 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
using namespace std;
 
using ll = long long;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vi = vector<int>;
using vll = vector<ll>;
 
struct project
{
    ll T;
    ll L;
    ll R;
    ll C;
    int I;
};
 
 
 
vector<project> P;
 
const int maxM = 100'000;
vi query_ans;
 
vi visited(maxM, 0);
 
const ll INF = 1'000'000'000'000'000'000LL;
 
vll dp(maxM, INF);
 
struct pos
{
    int i;
};
 
bool operator < (pos A, pos B)
{
    if(dp[A.i] == dp[B.i]) return A.i < B.i;
    else return dp[A.i] < dp[B.i];
}
 
 
 
struct segtree
{
    int l;
    int r;
    deque<pll> v;
 
    segtree* left = NULL;
    segtree* right = NULL;
 
    segtree()
    {
        ;
    }
 
    segtree(int L, int R)
    {
        l = L;
        r = R;
        if(l == r) return;
 
        int m = (l+r)/2;
        left = new segtree(l, m);
        right = new segtree(m+1, r);
    }
 
    void add(int I, ll Pr, ll val)
    {
       v.push_back({Pr, val});
        if(l != r)
        {
            if(I <= (l+r)/2) left->add(I, Pr, val);
            else right->add(I, Pr, val);
        }
    }
 
    void get(int L, int R, ll mxv)
    {
        if(R < l || r < L) return;
        else if(L <= l && r <= R)
        {
            while(1)
            {
                if(v.empty()) break;
                if(v[0].second > mxv) break;
                if(!visited[v[0].first])
                {
                    query_ans.push_back(v[0].first);
                    visited[v[0].first] = 1;
                }
                v.pop_front();
            }
        }
        else
        {
            left->get(L, R, mxv);
            right->get(L, R, mxv);
        }
    }
};
 
int main()
{
    int N, M;
    cin >> N >> M;
  
  M = min(M, 9000);
 
    P = vector<project>(M);
    for(int i = 0; i < M; i++) cin >> P[i].T >> P[i].L >> P[i].R >> P[i].C;
 
    sort(P.begin(), P.end(), [] (project x, project y)
    {
        return x.T < y.T;
    });
 
    for(int i = 0; i < M; i++) P[i].I = i;
 
    segtree U(0, M-1), D(0, M-1);
 
    sort(P.begin(), P.end(), [] (project x, project y)
    {
        return x.L + x.T <= y.L + y.T;
    });
 
    for(int i = 0; i < M; i++)
        U.add(P[i].I, P[i].I, P[i].L + P[i].T);
 
    sort(P.begin(), P.end(), [] (project x, project y)
    {
        return x.L - x.T < y.L - y.T;
    });
 
    for(int i = 0; i < M; i++)
        D.add(P[i].I, P[i].I, P[i].L - P[i].T);
 
 
 
    sort(P.begin(), P.end(), [] (project x, project y)
    {
        return x.I < y.I;
    });
 
    for(int i = 0; i < M; i++)
    {
        if(P[i].L == 1)
        {
            dp[i] = P[i].C;
            visited[i] = 1;
        }
    }
 
 
    set<pos> tbv;
    for(int i = 0; i < M; i++) tbv.insert(pos{i});
 
    while(!tbv.empty())
    {
        int u = tbv.begin()->i;
        tbv.erase(tbv.begin());
        // cerr << "visiting " << u << ' ' << P[u].L << ' ' << P[u].R <<  '\n';
 
 
        if(!visited[u]) break;
 
 
        query_ans.clear();
        U.get(u+1, M-1, P[u].R + P[u].T + 1);
        D.get(0, u-1, P[u].R - P[u].T + 1);
 
        for(int v: query_ans)
        {
            // cerr << u << " -> " << v << '\n';
            if(P[v].L <= P[u].R + 1 - abs(P[u].T - P[v].T))
            {
                if(dp[v] > dp[u] + P[v].C)
                {
 
                    tbv.erase(pos{v});
                    dp[v] = dp[u] + P[v].C;
                    tbv.insert(pos{v});
                }
            }
        }
 
    }
 
    ll final_ans = INF;
    for(int i = 0; i < M; i++)
        if(P[i].R == N)
            final_ans = min(final_ans, dp[i]);
 
    if(final_ans >= INF) final_ans = -1;
 
    cout << final_ans << '\n';
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 30108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 1 ms 1484 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct
20 Correct 22 ms 17156 KB Output is correct
21 Correct 23 ms 17160 KB Output is correct
22 Correct 36 ms 17160 KB Output is correct
23 Correct 25 ms 17124 KB Output is correct
24 Correct 29 ms 17080 KB Output is correct
25 Correct 28 ms 17184 KB Output is correct
26 Correct 25 ms 17172 KB Output is correct
27 Correct 25 ms 17160 KB Output is correct
28 Correct 28 ms 17156 KB Output is correct
29 Correct 30 ms 17100 KB Output is correct
30 Correct 24 ms 17144 KB Output is correct
31 Correct 22 ms 17172 KB Output is correct
32 Correct 28 ms 17188 KB Output is correct
33 Correct 28 ms 17216 KB Output is correct
34 Correct 28 ms 17192 KB Output is correct
35 Correct 27 ms 17100 KB Output is correct
36 Correct 25 ms 17228 KB Output is correct
37 Correct 26 ms 17160 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 30108 KB Output isn't correct
2 Halted 0 ms 0 KB -