oj.uz

답안 #491317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491317 2021-12-01T13:25:42 Z blue 치료 계획 (JOI20_treatment) C++17
35 / 100
 698 ms 108116 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;
    vector<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.back().second > mxv) break;
                if(!visited[v.back().first])
                {
                    query_ans.push_back(v.back().first);
                    visited[v.back().first] = 1;
                }
                v.pop_back();
            }
        }
        else
        {
            left->get(L, R, mxv);
            right->get(L, R, mxv);
        }
    }
  
    void reverse()
    {
      std::reverse(v.begin(), v.end());
      if(left != NULL)
      {
        left->reverse();
        right->reverse();
      }
    }
};
 
int main()
{
    int N, M;
    cin >> N >> M;
 
    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);
  
    D.reverse();
    U.reverse();
 
 
 
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 698 ms 108064 KB Output is correct
2 Correct 550 ms 108116 KB Output is correct
3 Runtime error 185 ms 61508 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1356 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 1356 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 1356 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 1356 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1356 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 1356 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 1356 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 1356 KB Output is correct
19 Correct 1 ms 1484 KB Output is correct
20 Correct 14 ms 6412 KB Output is correct
21 Correct 15 ms 6348 KB Output is correct
22 Correct 18 ms 6348 KB Output is correct
23 Correct 17 ms 6416 KB Output is correct
24 Correct 21 ms 6348 KB Output is correct
25 Correct 21 ms 6348 KB Output is correct
26 Correct 21 ms 6288 KB Output is correct
27 Correct 20 ms 6284 KB Output is correct
28 Correct 20 ms 6412 KB Output is correct
29 Correct 20 ms 6344 KB Output is correct
30 Correct 15 ms 6372 KB Output is correct
31 Correct 16 ms 6348 KB Output is correct
32 Correct 19 ms 6348 KB Output is correct
33 Correct 19 ms 6348 KB Output is correct
34 Correct 20 ms 6348 KB Output is correct
35 Correct 18 ms 6372 KB Output is correct
36 Correct 17 ms 6476 KB Output is correct
37 Correct 18 ms 6352 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 698 ms 108064 KB Output is correct
2 Correct 550 ms 108116 KB Output is correct
3 Runtime error 185 ms 61508 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -